./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f7b08d697525a6b6e4b6c32e081a52208b7f6ea0ef3da259b2ed32d3a516e9b
[2025-02-05 16:18:57,293 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 16:18:57,304 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 16:18:57,305 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 16:18:57,307 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 16:18:57,308 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 16:18:57,309 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c
[2025-02-05 16:18:58,522 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c70011849/92f2fa47794543828d9b061951567023/FLAGc6af08419
[2025-02-05 16:18:58,767 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 16:18:58,767 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c
[2025-02-05 16:18:58,775 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c70011849/92f2fa47794543828d9b061951567023/FLAGc6af08419
[2025-02-05 16:18:59,095 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c70011849/92f2fa47794543828d9b061951567023
[2025-02-05 16:18:59,098 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 16:18:59,100 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 16:18:59,102 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 16:18:59,102 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 16:18:59,109 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 16:18:59,110 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:18:59" (1/1) ...
[2025-02-05 16:18:59,111 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fd970e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:59, skipping insertion in model container
[2025-02-05 16:18:59,111 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:18:59" (1/1) ...
[2025-02-05 16:18:59,131 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 16:18:59,340 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c[14467,14480]
[2025-02-05 16:18:59,348 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 16:18:59,364 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 16:18:59,426 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c[14467,14480]
[2025-02-05 16:18:59,426 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 16:18:59,442 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 16:18:59,444 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:59 WrapperNode
[2025-02-05 16:18:59,444 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 16:18:59,446 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 16:18:59,446 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 16:18:59,446 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 16:18:59,451 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:59" (1/1) ...
[2025-02-05 16:18:59,461 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:59" (1/1) ...
[2025-02-05 16:18:59,488 INFO  L138                Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 487
[2025-02-05 16:18:59,489 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 16:18:59,489 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 16:18:59,489 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 16:18:59,489 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 16:18:59,498 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:59" (1/1) ...
[2025-02-05 16:18:59,498 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:59" (1/1) ...
[2025-02-05 16:18:59,505 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:59" (1/1) ...
[2025-02-05 16:18:59,524 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-05 16:18:59,524 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:59" (1/1) ...
[2025-02-05 16:18:59,524 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:59" (1/1) ...
[2025-02-05 16:18:59,535 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:59" (1/1) ...
[2025-02-05 16:18:59,536 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:59" (1/1) ...
[2025-02-05 16:18:59,537 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:59" (1/1) ...
[2025-02-05 16:18:59,541 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:59" (1/1) ...
[2025-02-05 16:18:59,548 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 16:18:59,552 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 16:18:59,552 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 16:18:59,552 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 16:18:59,553 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:59" (1/1) ...
[2025-02-05 16:18:59,568 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 16:18:59,604 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 16:18:59,624 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 16:18:59,629 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 16:18:59,645 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 16:18:59,646 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 16:18:59,646 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 16:18:59,646 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 16:18:59,732 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 16:18:59,733 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 16:19:00,139 INFO  L?                        ?]: Removed 48 outVars from TransFormulas that were not future-live.
[2025-02-05 16:19:00,139 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 16:19:00,147 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 16:19:00,148 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 16:19:00,148 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:19:00 BoogieIcfgContainer
[2025-02-05 16:19:00,148 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 16:19:00,150 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 16:19:00,150 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 16:19:00,156 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 16:19:00,156 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:18:59" (1/3) ...
[2025-02-05 16:19:00,156 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ba2870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:19:00, skipping insertion in model container
[2025-02-05 16:19:00,156 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:59" (2/3) ...
[2025-02-05 16:19:00,157 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ba2870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:19:00, skipping insertion in model container
[2025-02-05 16:19:00,157 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:19:00" (3/3) ...
[2025-02-05 16:19:00,159 INFO  L128   eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c
[2025-02-05 16:19:00,169 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 16:19:00,171 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c that has 1 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 16:19:00,219 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 16:19:00,227 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;@639e977a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 16:19:00,227 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 16:19:00,229 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 130 states, 128 states have (on average 1.78125) internal successors, (228), 129 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:00,237 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-02-05 16:19:00,237 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:00,237 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:00,238 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:00,244 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:00,244 INFO  L85        PathProgramCache]: Analyzing trace with hash -1292662406, now seen corresponding path program 1 times
[2025-02-05 16:19:00,257 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:00,258 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958131410]
[2025-02-05 16:19:00,258 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:00,258 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:00,339 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-02-05 16:19:00,409 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-02-05 16:19:00,409 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:00,409 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:00,716 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:00,717 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:00,717 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958131410]
[2025-02-05 16:19:00,717 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958131410] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:00,717 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:00,718 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:19:00,719 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344093872]
[2025-02-05 16:19:00,719 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:00,725 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:19:00,726 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:00,740 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:19:00,742 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:00,746 INFO  L87              Difference]: Start difference. First operand  has 130 states, 128 states have (on average 1.78125) internal successors, (228), 129 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:00,850 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:00,851 INFO  L93              Difference]: Finished difference Result 201 states and 350 transitions.
[2025-02-05 16:19:00,854 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:19:00,856 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37
[2025-02-05 16:19:00,856 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:00,862 INFO  L225             Difference]: With dead ends: 201
[2025-02-05 16:19:00,862 INFO  L226             Difference]: Without dead ends: 127
[2025-02-05 16:19:00,864 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:00,865 INFO  L435           NwaCegarLoop]: 221 mSDtfsCounter, 0 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:00,866 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 849 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:19:00,876 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 127 states.
[2025-02-05 16:19:00,885 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127.
[2025-02-05 16:19:00,886 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 127 states, 126 states have (on average 1.5317460317460319) internal successors, (193), 126 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:00,889 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 193 transitions.
[2025-02-05 16:19:00,890 INFO  L78                 Accepts]: Start accepts. Automaton has 127 states and 193 transitions. Word has length 37
[2025-02-05 16:19:00,890 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:00,890 INFO  L471      AbstractCegarLoop]: Abstraction has 127 states and 193 transitions.
[2025-02-05 16:19:00,890 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:00,890 INFO  L276                IsEmpty]: Start isEmpty. Operand 127 states and 193 transitions.
[2025-02-05 16:19:00,891 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-02-05 16:19:00,891 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:00,891 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:00,892 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 16:19:00,892 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:00,893 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:00,893 INFO  L85        PathProgramCache]: Analyzing trace with hash -122888143, now seen corresponding path program 1 times
[2025-02-05 16:19:00,893 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:00,893 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008993974]
[2025-02-05 16:19:00,893 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:00,893 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:00,908 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-02-05 16:19:00,936 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-02-05 16:19:00,936 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:00,936 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:01,053 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:01,053 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:01,053 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008993974]
[2025-02-05 16:19:01,053 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008993974] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:01,053 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:01,053 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:19:01,053 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393906562]
[2025-02-05 16:19:01,053 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:01,054 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:19:01,054 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:01,055 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:19:01,055 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:01,055 INFO  L87              Difference]: Start difference. First operand 127 states and 193 transitions. Second operand  has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,109 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:01,109 INFO  L93              Difference]: Finished difference Result 251 states and 405 transitions.
[2025-02-05 16:19:01,111 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:19:01,111 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66
[2025-02-05 16:19:01,111 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:01,112 INFO  L225             Difference]: With dead ends: 251
[2025-02-05 16:19:01,112 INFO  L226             Difference]: Without dead ends: 184
[2025-02-05 16:19:01,113 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:01,113 INFO  L435           NwaCegarLoop]: 192 mSDtfsCounter, 89 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:01,113 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 342 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:01,114 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 184 states.
[2025-02-05 16:19:01,125 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182.
[2025-02-05 16:19:01,126 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 182 states, 181 states have (on average 1.569060773480663) internal successors, (284), 181 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,128 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 284 transitions.
[2025-02-05 16:19:01,129 INFO  L78                 Accepts]: Start accepts. Automaton has 182 states and 284 transitions. Word has length 66
[2025-02-05 16:19:01,129 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:01,129 INFO  L471      AbstractCegarLoop]: Abstraction has 182 states and 284 transitions.
[2025-02-05 16:19:01,129 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,129 INFO  L276                IsEmpty]: Start isEmpty. Operand 182 states and 284 transitions.
[2025-02-05 16:19:01,131 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2025-02-05 16:19:01,131 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:01,131 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:01,131 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 16:19:01,131 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:01,131 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:01,132 INFO  L85        PathProgramCache]: Analyzing trace with hash -1175250762, now seen corresponding path program 1 times
[2025-02-05 16:19:01,132 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:01,132 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037904028]
[2025-02-05 16:19:01,132 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:01,132 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:01,163 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes.
[2025-02-05 16:19:01,177 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements.
[2025-02-05 16:19:01,177 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:01,177 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:01,253 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:01,253 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:01,253 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037904028]
[2025-02-05 16:19:01,253 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037904028] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:01,253 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:01,253 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:19:01,253 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188622847]
[2025-02-05 16:19:01,253 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:01,254 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:19:01,255 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:01,255 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:19:01,255 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:01,256 INFO  L87              Difference]: Start difference. First operand 182 states and 284 transitions. Second operand  has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,285 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:01,286 INFO  L93              Difference]: Finished difference Result 410 states and 668 transitions.
[2025-02-05 16:19:01,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:19:01,286 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68
[2025-02-05 16:19:01,286 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:01,288 INFO  L225             Difference]: With dead ends: 410
[2025-02-05 16:19:01,290 INFO  L226             Difference]: Without dead ends: 288
[2025-02-05 16:19:01,290 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:01,291 INFO  L435           NwaCegarLoop]: 191 mSDtfsCounter, 91 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:01,291 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 350 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:01,292 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 288 states.
[2025-02-05 16:19:01,303 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 286.
[2025-02-05 16:19:01,307 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 286 states, 285 states have (on average 1.6105263157894736) internal successors, (459), 285 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,308 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 459 transitions.
[2025-02-05 16:19:01,309 INFO  L78                 Accepts]: Start accepts. Automaton has 286 states and 459 transitions. Word has length 68
[2025-02-05 16:19:01,309 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:01,309 INFO  L471      AbstractCegarLoop]: Abstraction has 286 states and 459 transitions.
[2025-02-05 16:19:01,310 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,310 INFO  L276                IsEmpty]: Start isEmpty. Operand 286 states and 459 transitions.
[2025-02-05 16:19:01,311 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2025-02-05 16:19:01,312 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:01,312 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:01,313 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 16:19:01,313 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:01,314 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:01,314 INFO  L85        PathProgramCache]: Analyzing trace with hash 270481819, now seen corresponding path program 1 times
[2025-02-05 16:19:01,314 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:01,314 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182222774]
[2025-02-05 16:19:01,314 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:01,314 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:01,326 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes.
[2025-02-05 16:19:01,388 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements.
[2025-02-05 16:19:01,388 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:01,388 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:01,517 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:01,518 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:01,518 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182222774]
[2025-02-05 16:19:01,518 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182222774] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:01,518 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:01,518 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:19:01,519 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176835571]
[2025-02-05 16:19:01,519 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:01,519 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:19:01,519 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:01,519 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:19:01,520 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:01,520 INFO  L87              Difference]: Start difference. First operand 286 states and 459 transitions. Second operand  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,562 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:01,562 INFO  L93              Difference]: Finished difference Result 706 states and 1165 transitions.
[2025-02-05 16:19:01,562 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:19:01,563 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70
[2025-02-05 16:19:01,563 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:01,567 INFO  L225             Difference]: With dead ends: 706
[2025-02-05 16:19:01,567 INFO  L226             Difference]: Without dead ends: 480
[2025-02-05 16:19:01,567 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:01,569 INFO  L435           NwaCegarLoop]: 191 mSDtfsCounter, 85 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:01,569 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 351 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:01,573 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 480 states.
[2025-02-05 16:19:01,587 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 478.
[2025-02-05 16:19:01,588 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 478 states, 477 states have (on average 1.6331236897274632) internal successors, (779), 477 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,589 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 779 transitions.
[2025-02-05 16:19:01,589 INFO  L78                 Accepts]: Start accepts. Automaton has 478 states and 779 transitions. Word has length 70
[2025-02-05 16:19:01,590 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:01,590 INFO  L471      AbstractCegarLoop]: Abstraction has 478 states and 779 transitions.
[2025-02-05 16:19:01,590 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,590 INFO  L276                IsEmpty]: Start isEmpty. Operand 478 states and 779 transitions.
[2025-02-05 16:19:01,591 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2025-02-05 16:19:01,592 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:01,592 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:01,592 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 16:19:01,592 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:01,592 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:01,592 INFO  L85        PathProgramCache]: Analyzing trace with hash -688620832, now seen corresponding path program 1 times
[2025-02-05 16:19:01,592 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:01,593 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116111785]
[2025-02-05 16:19:01,593 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:01,593 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:01,606 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes.
[2025-02-05 16:19:01,622 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements.
[2025-02-05 16:19:01,622 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:01,622 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:01,736 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:01,736 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:01,736 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116111785]
[2025-02-05 16:19:01,736 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116111785] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:01,736 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:01,736 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:19:01,736 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911182987]
[2025-02-05 16:19:01,736 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:01,736 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:19:01,736 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:01,737 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:19:01,737 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:01,737 INFO  L87              Difference]: Start difference. First operand 478 states and 779 transitions. Second operand  has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,918 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:01,918 INFO  L93              Difference]: Finished difference Result 2018 states and 3397 transitions.
[2025-02-05 16:19:01,918 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-05 16:19:01,919 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72
[2025-02-05 16:19:01,919 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:01,927 INFO  L225             Difference]: With dead ends: 2018
[2025-02-05 16:19:01,927 INFO  L226             Difference]: Without dead ends: 1600
[2025-02-05 16:19:01,928 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-02-05 16:19:01,930 INFO  L435           NwaCegarLoop]: 189 mSDtfsCounter, 658 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:01,930 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1281 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:19:01,932 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1600 states.
[2025-02-05 16:19:01,964 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 843.
[2025-02-05 16:19:01,965 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 843 states, 842 states have (on average 1.652019002375297) internal successors, (1391), 842 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,967 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1391 transitions.
[2025-02-05 16:19:01,968 INFO  L78                 Accepts]: Start accepts. Automaton has 843 states and 1391 transitions. Word has length 72
[2025-02-05 16:19:01,968 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:01,968 INFO  L471      AbstractCegarLoop]: Abstraction has 843 states and 1391 transitions.
[2025-02-05 16:19:01,968 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:01,968 INFO  L276                IsEmpty]: Start isEmpty. Operand 843 states and 1391 transitions.
[2025-02-05 16:19:01,970 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2025-02-05 16:19:01,970 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:01,970 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:01,970 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 16:19:01,970 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:01,970 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:01,970 INFO  L85        PathProgramCache]: Analyzing trace with hash 178445883, now seen corresponding path program 1 times
[2025-02-05 16:19:01,970 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:01,971 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684750434]
[2025-02-05 16:19:01,971 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:01,971 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:01,984 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes.
[2025-02-05 16:19:01,996 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements.
[2025-02-05 16:19:01,996 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:01,997 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:02,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:02,079 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:02,079 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684750434]
[2025-02-05 16:19:02,079 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684750434] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:02,080 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:02,080 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 16:19:02,080 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6181953]
[2025-02-05 16:19:02,080 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:02,082 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 16:19:02,082 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:02,082 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 16:19:02,082 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 16:19:02,082 INFO  L87              Difference]: Start difference. First operand 843 states and 1391 transitions. Second operand  has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:02,165 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:02,165 INFO  L93              Difference]: Finished difference Result 2444 states and 4106 transitions.
[2025-02-05 16:19:02,166 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 16:19:02,166 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73
[2025-02-05 16:19:02,166 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:02,171 INFO  L225             Difference]: With dead ends: 2444
[2025-02-05 16:19:02,171 INFO  L226             Difference]: Without dead ends: 1661
[2025-02-05 16:19:02,172 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:02,173 INFO  L435           NwaCegarLoop]: 194 mSDtfsCounter, 331 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:02,173 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 624 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:19:02,175 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1661 states.
[2025-02-05 16:19:02,204 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1243.
[2025-02-05 16:19:02,206 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1243 states, 1242 states have (on average 1.6610305958132046) internal successors, (2063), 1242 states have internal predecessors, (2063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:02,210 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 2063 transitions.
[2025-02-05 16:19:02,211 INFO  L78                 Accepts]: Start accepts. Automaton has 1243 states and 2063 transitions. Word has length 73
[2025-02-05 16:19:02,211 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:02,211 INFO  L471      AbstractCegarLoop]: Abstraction has 1243 states and 2063 transitions.
[2025-02-05 16:19:02,211 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:02,211 INFO  L276                IsEmpty]: Start isEmpty. Operand 1243 states and 2063 transitions.
[2025-02-05 16:19:02,212 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2025-02-05 16:19:02,212 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:02,212 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:02,213 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 16:19:02,213 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:02,213 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:02,213 INFO  L85        PathProgramCache]: Analyzing trace with hash -1473780398, now seen corresponding path program 1 times
[2025-02-05 16:19:02,213 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:02,213 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793903602]
[2025-02-05 16:19:02,213 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:02,213 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:02,225 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes.
[2025-02-05 16:19:02,234 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements.
[2025-02-05 16:19:02,234 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:02,234 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:02,270 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:02,271 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:02,271 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793903602]
[2025-02-05 16:19:02,271 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793903602] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:02,271 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:02,271 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:19:02,271 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324173054]
[2025-02-05 16:19:02,271 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:02,272 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:19:02,272 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:02,272 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:19:02,272 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:02,272 INFO  L87              Difference]: Start difference. First operand 1243 states and 2063 transitions. Second operand  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:02,308 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:02,308 INFO  L93              Difference]: Finished difference Result 2758 states and 4633 transitions.
[2025-02-05 16:19:02,308 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:19:02,309 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74
[2025-02-05 16:19:02,309 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:02,314 INFO  L225             Difference]: With dead ends: 2758
[2025-02-05 16:19:02,315 INFO  L226             Difference]: Without dead ends: 1900
[2025-02-05 16:19:02,316 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:02,317 INFO  L435           NwaCegarLoop]: 270 mSDtfsCounter, 98 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:02,317 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 437 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:02,318 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1900 states.
[2025-02-05 16:19:02,351 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1898.
[2025-02-05 16:19:02,354 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1898 states, 1897 states have (on average 1.6615709014233) internal successors, (3152), 1897 states have internal predecessors, (3152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:02,360 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 3152 transitions.
[2025-02-05 16:19:02,360 INFO  L78                 Accepts]: Start accepts. Automaton has 1898 states and 3152 transitions. Word has length 74
[2025-02-05 16:19:02,360 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:02,360 INFO  L471      AbstractCegarLoop]: Abstraction has 1898 states and 3152 transitions.
[2025-02-05 16:19:02,360 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:02,360 INFO  L276                IsEmpty]: Start isEmpty. Operand 1898 states and 3152 transitions.
[2025-02-05 16:19:02,361 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2025-02-05 16:19:02,361 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:02,361 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:02,361 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 16:19:02,361 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:02,362 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:02,362 INFO  L85        PathProgramCache]: Analyzing trace with hash 843976882, now seen corresponding path program 1 times
[2025-02-05 16:19:02,362 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:02,362 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968032198]
[2025-02-05 16:19:02,362 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:02,362 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:02,372 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes.
[2025-02-05 16:19:02,381 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements.
[2025-02-05 16:19:02,381 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:02,381 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:02,433 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:02,433 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:02,433 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968032198]
[2025-02-05 16:19:02,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968032198] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:02,433 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:02,433 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:19:02,433 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650652049]
[2025-02-05 16:19:02,433 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:02,434 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:19:02,434 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:02,434 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:19:02,434 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:02,434 INFO  L87              Difference]: Start difference. First operand 1898 states and 3152 transitions. Second operand  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:02,487 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:02,487 INFO  L93              Difference]: Finished difference Result 3742 states and 6231 transitions.
[2025-02-05 16:19:02,488 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:19:02,488 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74
[2025-02-05 16:19:02,489 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:02,497 INFO  L225             Difference]: With dead ends: 3742
[2025-02-05 16:19:02,497 INFO  L226             Difference]: Without dead ends: 2684
[2025-02-05 16:19:02,498 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:02,499 INFO  L435           NwaCegarLoop]: 267 mSDtfsCounter, 92 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:02,499 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 435 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:02,501 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2684 states.
[2025-02-05 16:19:02,541 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2682.
[2025-02-05 16:19:02,544 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2682 states, 2681 states have (on average 1.6508765386049982) internal successors, (4426), 2681 states have internal predecessors, (4426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:02,551 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 4426 transitions.
[2025-02-05 16:19:02,552 INFO  L78                 Accepts]: Start accepts. Automaton has 2682 states and 4426 transitions. Word has length 74
[2025-02-05 16:19:02,552 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:02,552 INFO  L471      AbstractCegarLoop]: Abstraction has 2682 states and 4426 transitions.
[2025-02-05 16:19:02,552 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:02,552 INFO  L276                IsEmpty]: Start isEmpty. Operand 2682 states and 4426 transitions.
[2025-02-05 16:19:02,553 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2025-02-05 16:19:02,553 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:02,554 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:02,554 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 16:19:02,554 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:02,555 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:02,555 INFO  L85        PathProgramCache]: Analyzing trace with hash 1285863230, now seen corresponding path program 1 times
[2025-02-05 16:19:02,555 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:02,555 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162839202]
[2025-02-05 16:19:02,555 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:02,555 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:02,564 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes.
[2025-02-05 16:19:02,573 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements.
[2025-02-05 16:19:02,573 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:02,573 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:02,623 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:02,623 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:02,624 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162839202]
[2025-02-05 16:19:02,624 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162839202] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:02,624 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:02,624 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 16:19:02,624 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628122010]
[2025-02-05 16:19:02,624 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:02,625 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 16:19:02,625 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:02,625 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 16:19:02,625 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 16:19:02,626 INFO  L87              Difference]: Start difference. First operand 2682 states and 4426 transitions. Second operand  has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:02,778 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:02,779 INFO  L93              Difference]: Finished difference Result 8478 states and 14054 transitions.
[2025-02-05 16:19:02,779 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 16:19:02,780 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74
[2025-02-05 16:19:02,780 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:02,799 INFO  L225             Difference]: With dead ends: 8478
[2025-02-05 16:19:02,799 INFO  L226             Difference]: Without dead ends: 5866
[2025-02-05 16:19:02,804 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:02,806 INFO  L435           NwaCegarLoop]: 182 mSDtfsCounter, 330 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:02,806 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 614 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:19:02,811 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5866 states.
[2025-02-05 16:19:02,903 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5866 to 4255.
[2025-02-05 16:19:02,910 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4255 states, 4254 states have (on average 1.6424541607898449) internal successors, (6987), 4254 states have internal predecessors, (6987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:02,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 6987 transitions.
[2025-02-05 16:19:02,926 INFO  L78                 Accepts]: Start accepts. Automaton has 4255 states and 6987 transitions. Word has length 74
[2025-02-05 16:19:02,926 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:02,926 INFO  L471      AbstractCegarLoop]: Abstraction has 4255 states and 6987 transitions.
[2025-02-05 16:19:02,926 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:02,926 INFO  L276                IsEmpty]: Start isEmpty. Operand 4255 states and 6987 transitions.
[2025-02-05 16:19:02,930 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2025-02-05 16:19:02,930 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:02,930 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:02,930 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 16:19:02,930 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:02,930 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:02,931 INFO  L85        PathProgramCache]: Analyzing trace with hash 835732498, now seen corresponding path program 1 times
[2025-02-05 16:19:02,931 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:02,931 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353939775]
[2025-02-05 16:19:02,931 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:02,932 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:02,943 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes.
[2025-02-05 16:19:02,954 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements.
[2025-02-05 16:19:02,954 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:02,954 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:02,988 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:02,988 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:02,988 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353939775]
[2025-02-05 16:19:02,988 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353939775] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:02,988 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:02,988 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:19:02,988 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448547674]
[2025-02-05 16:19:02,988 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:02,989 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:19:02,989 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:02,989 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:19:02,989 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:02,989 INFO  L87              Difference]: Start difference. First operand 4255 states and 6987 transitions. Second operand  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:03,086 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:03,086 INFO  L93              Difference]: Finished difference Result 8507 states and 13972 transitions.
[2025-02-05 16:19:03,087 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:19:03,087 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74
[2025-02-05 16:19:03,087 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:03,103 INFO  L225             Difference]: With dead ends: 8507
[2025-02-05 16:19:03,103 INFO  L226             Difference]: Without dead ends: 6035
[2025-02-05 16:19:03,106 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:03,107 INFO  L435           NwaCegarLoop]: 255 mSDtfsCounter, 86 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:03,107 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 424 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:03,111 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6035 states.
[2025-02-05 16:19:03,257 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6035 to 6033.
[2025-02-05 16:19:03,265 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6033 states, 6032 states have (on average 1.626160477453581) internal successors, (9809), 6032 states have internal predecessors, (9809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:03,283 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6033 states to 6033 states and 9809 transitions.
[2025-02-05 16:19:03,291 INFO  L78                 Accepts]: Start accepts. Automaton has 6033 states and 9809 transitions. Word has length 74
[2025-02-05 16:19:03,291 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:03,291 INFO  L471      AbstractCegarLoop]: Abstraction has 6033 states and 9809 transitions.
[2025-02-05 16:19:03,291 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:03,291 INFO  L276                IsEmpty]: Start isEmpty. Operand 6033 states and 9809 transitions.
[2025-02-05 16:19:03,291 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2025-02-05 16:19:03,291 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:03,292 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:03,292 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 16:19:03,292 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:03,292 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:03,292 INFO  L85        PathProgramCache]: Analyzing trace with hash 1254215577, now seen corresponding path program 1 times
[2025-02-05 16:19:03,292 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:03,292 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216655698]
[2025-02-05 16:19:03,292 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:03,292 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:03,325 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes.
[2025-02-05 16:19:03,342 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements.
[2025-02-05 16:19:03,345 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:03,345 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:03,587 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:03,587 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:03,587 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216655698]
[2025-02-05 16:19:03,588 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216655698] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:03,591 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:03,592 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 16:19:03,592 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961158940]
[2025-02-05 16:19:03,592 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:03,592 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 16:19:03,592 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:03,593 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 16:19:03,596 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 16:19:03,597 INFO  L87              Difference]: Start difference. First operand 6033 states and 9809 transitions. Second operand  has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:03,893 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:03,894 INFO  L93              Difference]: Finished difference Result 19008 states and 30980 transitions.
[2025-02-05 16:19:03,894 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 16:19:03,894 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75
[2025-02-05 16:19:03,894 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:03,930 INFO  L225             Difference]: With dead ends: 19008
[2025-02-05 16:19:03,931 INFO  L226             Difference]: Without dead ends: 13053
[2025-02-05 16:19:03,941 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:03,942 INFO  L435           NwaCegarLoop]: 182 mSDtfsCounter, 328 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:03,942 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 616 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:19:03,953 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13053 states.
[2025-02-05 16:19:04,174 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13053 to 9500.
[2025-02-05 16:19:04,196 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9500 states, 9499 states have (on average 1.6144857353405622) internal successors, (15336), 9499 states have internal predecessors, (15336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:04,223 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9500 states to 9500 states and 15336 transitions.
[2025-02-05 16:19:04,224 INFO  L78                 Accepts]: Start accepts. Automaton has 9500 states and 15336 transitions. Word has length 75
[2025-02-05 16:19:04,224 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:04,224 INFO  L471      AbstractCegarLoop]: Abstraction has 9500 states and 15336 transitions.
[2025-02-05 16:19:04,224 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:04,224 INFO  L276                IsEmpty]: Start isEmpty. Operand 9500 states and 15336 transitions.
[2025-02-05 16:19:04,225 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-02-05 16:19:04,225 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:04,225 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:04,225 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 16:19:04,225 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:04,225 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:04,253 INFO  L85        PathProgramCache]: Analyzing trace with hash -136437513, now seen corresponding path program 1 times
[2025-02-05 16:19:04,253 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:04,253 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023848977]
[2025-02-05 16:19:04,253 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:04,253 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:04,263 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-02-05 16:19:04,273 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-02-05 16:19:04,273 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:04,273 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:04,449 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:04,449 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:04,449 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023848977]
[2025-02-05 16:19:04,449 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023848977] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:04,449 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:04,449 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:19:04,449 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301026476]
[2025-02-05 16:19:04,449 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:04,450 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:19:04,450 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:04,450 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:19:04,450 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:04,450 INFO  L87              Difference]: Start difference. First operand 9500 states and 15336 transitions. Second operand  has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:04,665 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:04,665 INFO  L93              Difference]: Finished difference Result 18924 states and 30569 transitions.
[2025-02-05 16:19:04,666 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:19:04,666 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77
[2025-02-05 16:19:04,666 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:04,698 INFO  L225             Difference]: With dead ends: 18924
[2025-02-05 16:19:04,702 INFO  L226             Difference]: Without dead ends: 9502
[2025-02-05 16:19:04,728 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:19:04,729 INFO  L435           NwaCegarLoop]: 188 mSDtfsCounter, 86 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:04,729 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 668 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:19:04,738 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9502 states.
[2025-02-05 16:19:05,004 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9502 to 9500.
[2025-02-05 16:19:05,018 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9500 states, 9499 states have (on average 1.6013264554163595) internal successors, (15211), 9499 states have internal predecessors, (15211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:05,036 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9500 states to 9500 states and 15211 transitions.
[2025-02-05 16:19:05,037 INFO  L78                 Accepts]: Start accepts. Automaton has 9500 states and 15211 transitions. Word has length 77
[2025-02-05 16:19:05,037 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:05,037 INFO  L471      AbstractCegarLoop]: Abstraction has 9500 states and 15211 transitions.
[2025-02-05 16:19:05,038 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:05,038 INFO  L276                IsEmpty]: Start isEmpty. Operand 9500 states and 15211 transitions.
[2025-02-05 16:19:05,039 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2025-02-05 16:19:05,039 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:05,039 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:05,039 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 16:19:05,039 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:05,039 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:05,039 INFO  L85        PathProgramCache]: Analyzing trace with hash 95490263, now seen corresponding path program 1 times
[2025-02-05 16:19:05,040 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:05,040 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667030174]
[2025-02-05 16:19:05,040 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:05,040 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:05,049 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes.
[2025-02-05 16:19:05,060 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements.
[2025-02-05 16:19:05,060 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:05,060 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:05,347 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:05,347 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:05,347 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667030174]
[2025-02-05 16:19:05,347 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667030174] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:05,347 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:05,347 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:19:05,348 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18149059]
[2025-02-05 16:19:05,348 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:05,348 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:19:05,348 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:05,348 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:19:05,348 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:05,349 INFO  L87              Difference]: Start difference. First operand 9500 states and 15211 transitions. Second operand  has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:05,618 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:05,618 INFO  L93              Difference]: Finished difference Result 27212 states and 43717 transitions.
[2025-02-05 16:19:05,619 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:19:05,619 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80
[2025-02-05 16:19:05,619 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:05,655 INFO  L225             Difference]: With dead ends: 27212
[2025-02-05 16:19:05,655 INFO  L226             Difference]: Without dead ends: 17790
[2025-02-05 16:19:05,669 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:19:05,670 INFO  L435           NwaCegarLoop]: 183 mSDtfsCounter, 84 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:05,670 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 678 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:19:05,688 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17790 states.
[2025-02-05 16:19:05,986 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17790 to 17788.
[2025-02-05 16:19:06,010 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17788 states, 17787 states have (on average 1.5865519761623659) internal successors, (28220), 17787 states have internal predecessors, (28220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:06,040 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17788 states to 17788 states and 28220 transitions.
[2025-02-05 16:19:06,041 INFO  L78                 Accepts]: Start accepts. Automaton has 17788 states and 28220 transitions. Word has length 80
[2025-02-05 16:19:06,042 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:06,042 INFO  L471      AbstractCegarLoop]: Abstraction has 17788 states and 28220 transitions.
[2025-02-05 16:19:06,042 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:06,042 INFO  L276                IsEmpty]: Start isEmpty. Operand 17788 states and 28220 transitions.
[2025-02-05 16:19:06,042 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2025-02-05 16:19:06,042 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:06,043 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:06,043 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 16:19:06,043 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:06,044 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:06,044 INFO  L85        PathProgramCache]: Analyzing trace with hash -1302384368, now seen corresponding path program 1 times
[2025-02-05 16:19:06,044 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:06,044 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85268699]
[2025-02-05 16:19:06,044 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:06,044 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:06,090 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes.
[2025-02-05 16:19:06,112 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements.
[2025-02-05 16:19:06,112 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:06,112 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:06,317 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:06,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:06,318 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85268699]
[2025-02-05 16:19:06,318 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85268699] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:06,318 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:06,318 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-05 16:19:06,318 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414820408]
[2025-02-05 16:19:06,318 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:06,318 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-05 16:19:06,318 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:06,319 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-05 16:19:06,319 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-02-05 16:19:06,319 INFO  L87              Difference]: Start difference. First operand 17788 states and 28220 transitions. Second operand  has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:06,506 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:06,506 INFO  L93              Difference]: Finished difference Result 18876 states and 29669 transitions.
[2025-02-05 16:19:06,507 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-05 16:19:06,507 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81
[2025-02-05 16:19:06,507 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:06,539 INFO  L225             Difference]: With dead ends: 18876
[2025-02-05 16:19:06,540 INFO  L226             Difference]: Without dead ends: 18874
[2025-02-05 16:19:06,543 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-02-05 16:19:06,544 INFO  L435           NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:06,544 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1291 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:06,552 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18874 states.
[2025-02-05 16:19:06,869 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18874 to 18874.
[2025-02-05 16:19:06,897 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18874 states, 18873 states have (on average 1.5523234249986753) internal successors, (29297), 18873 states have internal predecessors, (29297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:06,934 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18874 states to 18874 states and 29297 transitions.
[2025-02-05 16:19:06,936 INFO  L78                 Accepts]: Start accepts. Automaton has 18874 states and 29297 transitions. Word has length 81
[2025-02-05 16:19:06,937 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:06,937 INFO  L471      AbstractCegarLoop]: Abstraction has 18874 states and 29297 transitions.
[2025-02-05 16:19:06,937 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:06,937 INFO  L276                IsEmpty]: Start isEmpty. Operand 18874 states and 29297 transitions.
[2025-02-05 16:19:06,940 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2025-02-05 16:19:06,940 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:06,940 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:06,940 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 16:19:06,940 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:06,941 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:06,941 INFO  L85        PathProgramCache]: Analyzing trace with hash -1134624664, now seen corresponding path program 1 times
[2025-02-05 16:19:06,941 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:06,941 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325775970]
[2025-02-05 16:19:06,941 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:06,941 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:06,956 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes.
[2025-02-05 16:19:06,975 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements.
[2025-02-05 16:19:06,975 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:06,975 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:07,092 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-02-05 16:19:07,092 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:07,092 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325775970]
[2025-02-05 16:19:07,092 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325775970] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:07,092 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:07,092 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:19:07,092 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699870246]
[2025-02-05 16:19:07,092 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:07,093 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:19:07,093 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:07,093 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:19:07,093 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:07,094 INFO  L87              Difference]: Start difference. First operand 18874 states and 29297 transitions. Second operand  has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:07,553 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:07,554 INFO  L93              Difference]: Finished difference Result 46590 states and 72581 transitions.
[2025-02-05 16:19:07,554 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:19:07,555 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107
[2025-02-05 16:19:07,555 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:07,627 INFO  L225             Difference]: With dead ends: 46590
[2025-02-05 16:19:07,627 INFO  L226             Difference]: Without dead ends: 37348
[2025-02-05 16:19:07,640 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-05 16:19:07,640 INFO  L435           NwaCegarLoop]: 290 mSDtfsCounter, 408 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:07,640 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 890 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:19:07,661 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37348 states.
[2025-02-05 16:19:08,023 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37348 to 29098.
[2025-02-05 16:19:08,054 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 29098 states, 29097 states have (on average 1.5491975117709729) internal successors, (45077), 29097 states have internal predecessors, (45077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:08,094 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29098 states to 29098 states and 45077 transitions.
[2025-02-05 16:19:08,097 INFO  L78                 Accepts]: Start accepts. Automaton has 29098 states and 45077 transitions. Word has length 107
[2025-02-05 16:19:08,097 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:08,097 INFO  L471      AbstractCegarLoop]: Abstraction has 29098 states and 45077 transitions.
[2025-02-05 16:19:08,097 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:08,097 INFO  L276                IsEmpty]: Start isEmpty. Operand 29098 states and 45077 transitions.
[2025-02-05 16:19:08,099 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2025-02-05 16:19:08,099 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:08,099 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:08,099 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 16:19:08,099 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:08,099 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:08,099 INFO  L85        PathProgramCache]: Analyzing trace with hash 1183132616, now seen corresponding path program 1 times
[2025-02-05 16:19:08,099 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:08,099 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268159862]
[2025-02-05 16:19:08,099 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:08,099 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:08,108 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes.
[2025-02-05 16:19:08,117 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements.
[2025-02-05 16:19:08,118 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:08,118 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:08,272 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-02-05 16:19:08,273 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:08,273 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268159862]
[2025-02-05 16:19:08,273 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268159862] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:08,273 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:08,273 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:19:08,273 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665570104]
[2025-02-05 16:19:08,273 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:08,274 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:19:08,275 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:08,275 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:19:08,275 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:08,276 INFO  L87              Difference]: Start difference. First operand 29098 states and 45077 transitions. Second operand  has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:08,611 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:08,611 INFO  L93              Difference]: Finished difference Result 52282 states and 81451 transitions.
[2025-02-05 16:19:08,612 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:19:08,612 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107
[2025-02-05 16:19:08,612 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:08,680 INFO  L225             Difference]: With dead ends: 52282
[2025-02-05 16:19:08,680 INFO  L226             Difference]: Without dead ends: 43300
[2025-02-05 16:19:08,703 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-05 16:19:08,703 INFO  L435           NwaCegarLoop]: 294 mSDtfsCounter, 412 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:08,703 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 873 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:19:08,732 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 43300 states.
[2025-02-05 16:19:09,212 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 43300 to 39566.
[2025-02-05 16:19:09,250 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39566 states, 39565 states have (on average 1.5505876405914318) internal successors, (61349), 39565 states have internal predecessors, (61349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:09,305 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39566 states to 39566 states and 61349 transitions.
[2025-02-05 16:19:09,308 INFO  L78                 Accepts]: Start accepts. Automaton has 39566 states and 61349 transitions. Word has length 107
[2025-02-05 16:19:09,308 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:09,308 INFO  L471      AbstractCegarLoop]: Abstraction has 39566 states and 61349 transitions.
[2025-02-05 16:19:09,308 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:09,308 INFO  L276                IsEmpty]: Start isEmpty. Operand 39566 states and 61349 transitions.
[2025-02-05 16:19:09,310 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2025-02-05 16:19:09,310 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:09,310 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:09,310 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 16:19:09,310 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:09,311 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:09,311 INFO  L85        PathProgramCache]: Analyzing trace with hash 1174888232, now seen corresponding path program 1 times
[2025-02-05 16:19:09,311 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:09,311 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145755612]
[2025-02-05 16:19:09,311 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:09,311 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:09,322 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes.
[2025-02-05 16:19:09,336 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements.
[2025-02-05 16:19:09,336 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:09,336 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:09,430 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-02-05 16:19:09,431 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:09,431 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145755612]
[2025-02-05 16:19:09,431 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145755612] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:09,431 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:09,431 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:19:09,431 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230753656]
[2025-02-05 16:19:09,431 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:09,431 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:19:09,431 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:09,431 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:19:09,432 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:09,432 INFO  L87              Difference]: Start difference. First operand 39566 states and 61349 transitions. Second operand  has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:09,958 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:09,959 INFO  L93              Difference]: Finished difference Result 55906 states and 87091 transitions.
[2025-02-05 16:19:09,959 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:19:09,959 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107
[2025-02-05 16:19:09,960 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:10,040 INFO  L225             Difference]: With dead ends: 55906
[2025-02-05 16:19:10,041 INFO  L226             Difference]: Without dead ends: 46924
[2025-02-05 16:19:10,063 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-05 16:19:10,064 INFO  L435           NwaCegarLoop]: 295 mSDtfsCounter, 423 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:10,064 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 826 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:19:10,095 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 46924 states.
[2025-02-05 16:19:10,843 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 46924 to 45414.
[2025-02-05 16:19:10,888 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 45414 states, 45413 states have (on average 1.552440931010944) internal successors, (70501), 45413 states have internal predecessors, (70501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:10,967 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 45414 states to 45414 states and 70501 transitions.
[2025-02-05 16:19:10,970 INFO  L78                 Accepts]: Start accepts. Automaton has 45414 states and 70501 transitions. Word has length 107
[2025-02-05 16:19:10,971 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:10,971 INFO  L471      AbstractCegarLoop]: Abstraction has 45414 states and 70501 transitions.
[2025-02-05 16:19:10,971 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:10,971 INFO  L276                IsEmpty]: Start isEmpty. Operand 45414 states and 70501 transitions.
[2025-02-05 16:19:10,973 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2025-02-05 16:19:10,973 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:10,974 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:10,974 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-05 16:19:10,974 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:10,974 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:10,975 INFO  L85        PathProgramCache]: Analyzing trace with hash -762771021, now seen corresponding path program 1 times
[2025-02-05 16:19:10,975 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:10,975 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130528518]
[2025-02-05 16:19:10,975 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:10,975 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:10,987 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes.
[2025-02-05 16:19:10,998 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements.
[2025-02-05 16:19:10,999 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:10,999 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:11,082 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-02-05 16:19:11,083 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:11,083 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130528518]
[2025-02-05 16:19:11,083 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130528518] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:11,083 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:11,083 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 16:19:11,083 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503610412]
[2025-02-05 16:19:11,083 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:11,084 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 16:19:11,084 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:11,084 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 16:19:11,084 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 16:19:11,084 INFO  L87              Difference]: Start difference. First operand 45414 states and 70501 transitions. Second operand  has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:11,627 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:11,628 INFO  L93              Difference]: Finished difference Result 74297 states and 115970 transitions.
[2025-02-05 16:19:11,628 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 16:19:11,628 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108
[2025-02-05 16:19:11,628 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:11,720 INFO  L225             Difference]: With dead ends: 74297
[2025-02-05 16:19:11,721 INFO  L226             Difference]: Without dead ends: 59103
[2025-02-05 16:19:11,746 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-02-05 16:19:11,747 INFO  L435           NwaCegarLoop]: 288 mSDtfsCounter, 171 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:11,747 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 639 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:11,787 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 59103 states.
[2025-02-05 16:19:12,464 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 59103 to 57595.
[2025-02-05 16:19:12,517 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 57595 states, 57594 states have (on average 1.5524360176407264) internal successors, (89411), 57594 states have internal predecessors, (89411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:12,606 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 57595 states to 57595 states and 89411 transitions.
[2025-02-05 16:19:12,609 INFO  L78                 Accepts]: Start accepts. Automaton has 57595 states and 89411 transitions. Word has length 108
[2025-02-05 16:19:12,609 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:12,609 INFO  L471      AbstractCegarLoop]: Abstraction has 57595 states and 89411 transitions.
[2025-02-05 16:19:12,609 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:12,609 INFO  L276                IsEmpty]: Start isEmpty. Operand 57595 states and 89411 transitions.
[2025-02-05 16:19:12,611 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2025-02-05 16:19:12,611 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:12,611 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:12,611 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-05 16:19:12,611 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:12,611 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:12,612 INFO  L85        PathProgramCache]: Analyzing trace with hash -551420108, now seen corresponding path program 1 times
[2025-02-05 16:19:12,612 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:12,612 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213970044]
[2025-02-05 16:19:12,612 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:12,612 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:12,626 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes.
[2025-02-05 16:19:12,634 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements.
[2025-02-05 16:19:12,635 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:12,636 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:12,671 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-02-05 16:19:12,671 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:12,671 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213970044]
[2025-02-05 16:19:12,671 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213970044] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:12,671 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:12,671 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:19:12,671 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809154582]
[2025-02-05 16:19:12,671 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:12,671 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:19:12,671 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:12,672 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:19:12,672 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:12,672 INFO  L87              Difference]: Start difference. First operand 57595 states and 89411 transitions. Second operand  has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:13,680 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:13,681 INFO  L93              Difference]: Finished difference Result 124861 states and 194477 transitions.
[2025-02-05 16:19:13,681 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:19:13,681 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108
[2025-02-05 16:19:13,682 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:13,848 INFO  L225             Difference]: With dead ends: 124861
[2025-02-05 16:19:13,848 INFO  L226             Difference]: Without dead ends: 97591
[2025-02-05 16:19:13,899 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:13,900 INFO  L435           NwaCegarLoop]: 192 mSDtfsCounter, 74 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:13,900 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 353 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:13,974 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 97591 states.
[2025-02-05 16:19:15,656 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 97591 to 97313.
[2025-02-05 16:19:15,750 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 97313 states, 97312 states have (on average 1.5516277540282801) internal successors, (150992), 97312 states have internal predecessors, (150992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:16,198 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97313 states to 97313 states and 150992 transitions.
[2025-02-05 16:19:16,203 INFO  L78                 Accepts]: Start accepts. Automaton has 97313 states and 150992 transitions. Word has length 108
[2025-02-05 16:19:16,203 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:16,203 INFO  L471      AbstractCegarLoop]: Abstraction has 97313 states and 150992 transitions.
[2025-02-05 16:19:16,203 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:16,203 INFO  L276                IsEmpty]: Start isEmpty. Operand 97313 states and 150992 transitions.
[2025-02-05 16:19:16,205 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-02-05 16:19:16,205 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:16,205 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:16,205 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-02-05 16:19:16,205 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:16,205 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:16,205 INFO  L85        PathProgramCache]: Analyzing trace with hash -435187069, now seen corresponding path program 1 times
[2025-02-05 16:19:16,205 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:16,205 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479462775]
[2025-02-05 16:19:16,206 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:16,206 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:16,213 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-02-05 16:19:16,220 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-02-05 16:19:16,220 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:16,220 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:16,250 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:16,250 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:16,250 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479462775]
[2025-02-05 16:19:16,250 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479462775] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:16,250 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:16,250 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:19:16,250 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420270696]
[2025-02-05 16:19:16,251 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:16,251 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:19:16,251 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:16,251 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:19:16,251 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:16,251 INFO  L87              Difference]: Start difference. First operand 97313 states and 150992 transitions. Second operand  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:17,979 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:17,980 INFO  L93              Difference]: Finished difference Result 289637 states and 448427 transitions.
[2025-02-05 16:19:17,981 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:19:17,981 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109
[2025-02-05 16:19:17,981 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:18,449 INFO  L225             Difference]: With dead ends: 289637
[2025-02-05 16:19:18,450 INFO  L226             Difference]: Without dead ends: 192396
[2025-02-05 16:19:18,514 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:18,515 INFO  L435           NwaCegarLoop]: 249 mSDtfsCounter, 125 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:18,515 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 434 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-05 16:19:18,636 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 192396 states.
[2025-02-05 16:19:21,302 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 192396 to 192394.
[2025-02-05 16:19:21,432 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 192394 states, 192393 states have (on average 1.5349830815050443) internal successors, (295320), 192393 states have internal predecessors, (295320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:21,752 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 192394 states to 192394 states and 295320 transitions.
[2025-02-05 16:19:21,759 INFO  L78                 Accepts]: Start accepts. Automaton has 192394 states and 295320 transitions. Word has length 109
[2025-02-05 16:19:21,759 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:21,759 INFO  L471      AbstractCegarLoop]: Abstraction has 192394 states and 295320 transitions.
[2025-02-05 16:19:21,760 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:21,760 INFO  L276                IsEmpty]: Start isEmpty. Operand 192394 states and 295320 transitions.
[2025-02-05 16:19:21,763 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-02-05 16:19:21,763 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:21,763 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:21,763 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-02-05 16:19:21,763 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:21,763 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:21,763 INFO  L85        PathProgramCache]: Analyzing trace with hash -343695613, now seen corresponding path program 1 times
[2025-02-05 16:19:21,763 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:21,763 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383324841]
[2025-02-05 16:19:21,763 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:21,763 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:21,771 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-02-05 16:19:21,777 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-02-05 16:19:21,777 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:21,777 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:21,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:21,803 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:21,803 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383324841]
[2025-02-05 16:19:21,803 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383324841] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:21,803 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:21,804 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:19:21,804 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161509060]
[2025-02-05 16:19:21,804 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:21,805 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:19:21,805 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:21,805 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:19:21,805 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:21,805 INFO  L87              Difference]: Start difference. First operand 192394 states and 295320 transitions. Second operand  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:25,751 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:25,752 INFO  L93              Difference]: Finished difference Result 572619 states and 876937 transitions.
[2025-02-05 16:19:25,752 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:19:25,752 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109
[2025-02-05 16:19:25,752 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:26,454 INFO  L225             Difference]: With dead ends: 572619
[2025-02-05 16:19:26,455 INFO  L226             Difference]: Without dead ends: 380359
[2025-02-05 16:19:26,584 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:26,584 INFO  L435           NwaCegarLoop]: 275 mSDtfsCounter, 144 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:26,584 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 460 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:26,852 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 380359 states.
[2025-02-05 16:19:32,835 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 380359 to 380357.
[2025-02-05 16:19:33,346 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 380357 states, 380356 states have (on average 1.5179700070460305) internal successors, (577369), 380356 states have internal predecessors, (577369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:34,700 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 380357 states to 380357 states and 577369 transitions.
[2025-02-05 16:19:34,748 INFO  L78                 Accepts]: Start accepts. Automaton has 380357 states and 577369 transitions. Word has length 109
[2025-02-05 16:19:34,749 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:34,749 INFO  L471      AbstractCegarLoop]: Abstraction has 380357 states and 577369 transitions.
[2025-02-05 16:19:34,749 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:34,749 INFO  L276                IsEmpty]: Start isEmpty. Operand 380357 states and 577369 transitions.
[2025-02-05 16:19:34,761 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-02-05 16:19:34,761 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:34,761 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:19:34,761 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-02-05 16:19:34,762 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:34,763 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:34,763 INFO  L85        PathProgramCache]: Analyzing trace with hash 1731023930, now seen corresponding path program 1 times
[2025-02-05 16:19:34,763 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:34,763 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254519137]
[2025-02-05 16:19:34,763 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:34,763 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:34,779 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-02-05 16:19:34,832 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-02-05 16:19:34,833 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:34,833 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:34,970 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:34,970 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:34,971 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254519137]
[2025-02-05 16:19:34,971 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254519137] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:34,971 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:34,971 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:19:34,971 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577609113]
[2025-02-05 16:19:34,971 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:34,971 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:19:34,971 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:34,972 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:19:34,972 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:34,972 INFO  L87              Difference]: Start difference. First operand 380357 states and 577369 transitions. Second operand  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)