./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.BOUNDED-16.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_lcr.8.ufo.BOUNDED-16.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 6327d27f7abe073a313b5cd298156d916d823d684efcd0c205043cb09610f085
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 16:18:12,383 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 16:18:12,422 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:12,426 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 16:18:12,427 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 16:18:12,442 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 16:18:12,443 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 16:18:12,443 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 16:18:12,443 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 16:18:12,443 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 16:18:12,444 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 16:18:12,444 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 16:18:12,444 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 16:18:12,444 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 16:18:12,444 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 16:18:12,444 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 16:18:12,444 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 16:18:12,444 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 16:18:12,445 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 16:18:12,445 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 16:18:12,445 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 16:18:12,445 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 16:18:12,445 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 16:18:12,445 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 16:18:12,445 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 16:18:12,445 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 16:18:12,445 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 16:18:12,445 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 16:18:12,445 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 16:18:12,446 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 16:18:12,446 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 16:18:12,446 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 16:18:12,446 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 16:18:12,446 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 16:18:12,446 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 16:18:12,446 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 16:18:12,446 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 16:18:12,446 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 16:18:12,446 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 16:18:12,447 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 16:18:12,447 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 16:18:12,447 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 16:18:12,447 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 16:18:12,447 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 -> 6327d27f7abe073a313b5cd298156d916d823d684efcd0c205043cb09610f085
[2025-02-05 16:18:12,663 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 16:18:12,673 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 16:18:12,674 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 16:18:12,678 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 16:18:12,679 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 16:18:12,679 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.BOUNDED-16.pals.c
[2025-02-05 16:18:14,030 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3eeb1817d/9a9ea7ca43d644fab6c795ff3d232c17/FLAG56d8de50f
[2025-02-05 16:18:14,303 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 16:18:14,304 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.BOUNDED-16.pals.c
[2025-02-05 16:18:14,334 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3eeb1817d/9a9ea7ca43d644fab6c795ff3d232c17/FLAG56d8de50f
[2025-02-05 16:18:14,600 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3eeb1817d/9a9ea7ca43d644fab6c795ff3d232c17
[2025-02-05 16:18:14,603 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 16:18:14,605 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 16:18:14,606 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 16:18:14,607 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 16:18:14,610 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 16:18:14,610 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:18:14" (1/1) ...
[2025-02-05 16:18:14,613 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c5a69ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:14, skipping insertion in model container
[2025-02-05 16:18:14,613 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:18:14" (1/1) ...
[2025-02-05 16:18:14,662 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 16:18:15,044 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_lcr.8.ufo.BOUNDED-16.pals.c[26453,26466]
[2025-02-05 16:18:15,052 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 16:18:15,073 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 16:18:15,140 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_lcr.8.ufo.BOUNDED-16.pals.c[26453,26466]
[2025-02-05 16:18:15,140 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 16:18:15,157 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 16:18:15,157 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:15 WrapperNode
[2025-02-05 16:18:15,158 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 16:18:15,159 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 16:18:15,159 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 16:18:15,159 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 16:18:15,163 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:15" (1/1) ...
[2025-02-05 16:18:15,171 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:15" (1/1) ...
[2025-02-05 16:18:15,204 INFO  L138                Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 529
[2025-02-05 16:18:15,205 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 16:18:15,205 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 16:18:15,205 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 16:18:15,205 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 16:18:15,211 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:15" (1/1) ...
[2025-02-05 16:18:15,211 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:15" (1/1) ...
[2025-02-05 16:18:15,213 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:15" (1/1) ...
[2025-02-05 16:18:15,222 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:15,223 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:15" (1/1) ...
[2025-02-05 16:18:15,223 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:15" (1/1) ...
[2025-02-05 16:18:15,228 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:15" (1/1) ...
[2025-02-05 16:18:15,230 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:15" (1/1) ...
[2025-02-05 16:18:15,231 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:15" (1/1) ...
[2025-02-05 16:18:15,232 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:15" (1/1) ...
[2025-02-05 16:18:15,234 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 16:18:15,234 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 16:18:15,234 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 16:18:15,234 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 16:18:15,235 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:15" (1/1) ...
[2025-02-05 16:18:15,239 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 16:18:15,248 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 16:18:15,258 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:15,259 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:15,277 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 16:18:15,277 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 16:18:15,277 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 16:18:15,277 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 16:18:15,395 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 16:18:15,398 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 16:18:15,850 INFO  L?                        ?]: Removed 55 outVars from TransFormulas that were not future-live.
[2025-02-05 16:18:15,850 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 16:18:15,862 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 16:18:15,862 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 16:18:15,863 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:18:15 BoogieIcfgContainer
[2025-02-05 16:18:15,863 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 16:18:15,864 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 16:18:15,864 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 16:18:15,868 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 16:18:15,868 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:18:14" (1/3) ...
[2025-02-05 16:18:15,868 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a00c0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:18:15, skipping insertion in model container
[2025-02-05 16:18:15,868 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:15" (2/3) ...
[2025-02-05 16:18:15,868 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a00c0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:18:15, skipping insertion in model container
[2025-02-05 16:18:15,868 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:18:15" (3/3) ...
[2025-02-05 16:18:15,869 INFO  L128   eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.BOUNDED-16.pals.c
[2025-02-05 16:18:15,879 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 16:18:15,880 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.ufo.BOUNDED-16.pals.c that has 1 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 16:18:15,916 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 16:18:15,924 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;@7f890e30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 16:18:15,924 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 16:18:15,927 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 130 states, 128 states have (on average 1.796875) internal successors, (230), 129 states have internal predecessors, (230), 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:18:15,931 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-02-05 16:18:15,931 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:15,931 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]
[2025-02-05 16:18:15,932 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:15,935 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:15,935 INFO  L85        PathProgramCache]: Analyzing trace with hash -1616186147, now seen corresponding path program 1 times
[2025-02-05 16:18:15,940 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:15,940 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894982727]
[2025-02-05 16:18:15,940 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:15,941 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:16,011 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-02-05 16:18:16,041 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-02-05 16:18:16,041 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:16,041 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:16,170 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:18:16,171 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:16,171 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894982727]
[2025-02-05 16:18:16,172 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894982727] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:16,172 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:16,172 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 16:18:16,177 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89958175]
[2025-02-05 16:18:16,177 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:16,180 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-05 16:18:16,180 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:16,191 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-05 16:18:16,191 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 16:18:16,193 INFO  L87              Difference]: Start difference. First operand  has 130 states, 128 states have (on average 1.796875) internal successors, (230), 129 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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:18:16,207 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:16,208 INFO  L93              Difference]: Finished difference Result 194 states and 332 transitions.
[2025-02-05 16:18:16,208 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-05 16:18:16,209 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 29
[2025-02-05 16:18:16,210 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:16,214 INFO  L225             Difference]: With dead ends: 194
[2025-02-05 16:18:16,215 INFO  L226             Difference]: Without dead ends: 127
[2025-02-05 16:18:16,217 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 16:18:16,219 INFO  L435           NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:16,219 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:16,228 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 127 states.
[2025-02-05 16:18:16,243 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127.
[2025-02-05 16:18:16,244 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 127 states, 126 states have (on average 1.7857142857142858) internal successors, (225), 126 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:16,247 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 225 transitions.
[2025-02-05 16:18:16,251 INFO  L78                 Accepts]: Start accepts. Automaton has 127 states and 225 transitions. Word has length 29
[2025-02-05 16:18:16,251 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:16,251 INFO  L471      AbstractCegarLoop]: Abstraction has 127 states and 225 transitions.
[2025-02-05 16:18:16,251 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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:18:16,252 INFO  L276                IsEmpty]: Start isEmpty. Operand 127 states and 225 transitions.
[2025-02-05 16:18:16,252 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-02-05 16:18:16,254 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:16,254 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]
[2025-02-05 16:18:16,254 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 16:18:16,255 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:16,255 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:16,255 INFO  L85        PathProgramCache]: Analyzing trace with hash -1683192900, now seen corresponding path program 1 times
[2025-02-05 16:18:16,255 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:16,256 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859412788]
[2025-02-05 16:18:16,256 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:16,256 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:16,302 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-02-05 16:18:16,350 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-02-05 16:18:16,350 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:16,350 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:16,641 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:18:16,641 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:16,641 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859412788]
[2025-02-05 16:18:16,641 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859412788] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:16,641 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:16,641 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:18:16,641 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230623641]
[2025-02-05 16:18:16,641 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:16,642 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:18:16,642 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:16,643 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:18:16,643 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:18:16,643 INFO  L87              Difference]: Start difference. First operand 127 states and 225 transitions. Second operand  has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:18:16,791 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:16,792 INFO  L93              Difference]: Finished difference Result 191 states and 326 transitions.
[2025-02-05 16:18:16,793 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:18:16,794 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 29
[2025-02-05 16:18:16,794 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:16,795 INFO  L225             Difference]: With dead ends: 191
[2025-02-05 16:18:16,795 INFO  L226             Difference]: Without dead ends: 127
[2025-02-05 16:18:16,795 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:18:16,796 INFO  L435           NwaCegarLoop]: 223 mSDtfsCounter, 0 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:16,796 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 826 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:18:16,796 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 127 states.
[2025-02-05 16:18:16,803 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127.
[2025-02-05 16:18:16,807 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 127 states, 126 states have (on average 1.3015873015873016) internal successors, (164), 126 states have internal predecessors, (164), 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:18:16,808 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 164 transitions.
[2025-02-05 16:18:16,808 INFO  L78                 Accepts]: Start accepts. Automaton has 127 states and 164 transitions. Word has length 29
[2025-02-05 16:18:16,809 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:16,809 INFO  L471      AbstractCegarLoop]: Abstraction has 127 states and 164 transitions.
[2025-02-05 16:18:16,809 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:18:16,809 INFO  L276                IsEmpty]: Start isEmpty. Operand 127 states and 164 transitions.
[2025-02-05 16:18:16,810 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2025-02-05 16:18:16,810 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:16,810 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:16,814 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 16:18:16,814 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:16,815 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:16,815 INFO  L85        PathProgramCache]: Analyzing trace with hash -1940804992, now seen corresponding path program 1 times
[2025-02-05 16:18:16,815 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:16,815 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767780018]
[2025-02-05 16:18:16,815 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:16,815 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:16,855 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes.
[2025-02-05 16:18:16,919 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements.
[2025-02-05 16:18:16,921 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:16,921 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:17,325 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:18:17,327 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:17,328 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767780018]
[2025-02-05 16:18:17,328 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767780018] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:17,328 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:17,328 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-02-05 16:18:17,328 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606321678]
[2025-02-05 16:18:17,328 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:17,329 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-02-05 16:18:17,329 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:17,330 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-02-05 16:18:17,330 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2025-02-05 16:18:17,331 INFO  L87              Difference]: Start difference. First operand 127 states and 164 transitions. Second operand  has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 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:18:17,956 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:17,956 INFO  L93              Difference]: Finished difference Result 1087 states and 1716 transitions.
[2025-02-05 16:18:17,957 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-02-05 16:18:17,957 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 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 89
[2025-02-05 16:18:17,957 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:17,962 INFO  L225             Difference]: With dead ends: 1087
[2025-02-05 16:18:17,962 INFO  L226             Difference]: Without dead ends: 1027
[2025-02-05 16:18:17,963 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506
[2025-02-05 16:18:17,964 INFO  L435           NwaCegarLoop]: 160 mSDtfsCounter, 1777 mSDsluCounter, 5496 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1777 SdHoareTripleChecker+Valid, 5656 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:17,964 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1777 Valid, 5656 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 16:18:17,966 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1027 states.
[2025-02-05 16:18:17,994 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 185.
[2025-02-05 16:18:17,994 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 185 states, 184 states have (on average 1.4021739130434783) internal successors, (258), 184 states have internal predecessors, (258), 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:18:17,995 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 258 transitions.
[2025-02-05 16:18:17,995 INFO  L78                 Accepts]: Start accepts. Automaton has 185 states and 258 transitions. Word has length 89
[2025-02-05 16:18:17,995 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:17,995 INFO  L471      AbstractCegarLoop]: Abstraction has 185 states and 258 transitions.
[2025-02-05 16:18:17,996 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 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:18:17,996 INFO  L276                IsEmpty]: Start isEmpty. Operand 185 states and 258 transitions.
[2025-02-05 16:18:18,001 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-02-05 16:18:18,001 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:18,001 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:18,001 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 16:18:18,002 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:18,002 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:18,002 INFO  L85        PathProgramCache]: Analyzing trace with hash 22562363, now seen corresponding path program 1 times
[2025-02-05 16:18:18,004 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:18,004 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57426924]
[2025-02-05 16:18:18,004 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:18,004 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:18,033 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-02-05 16:18:18,045 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-02-05 16:18:18,046 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:18,046 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:18,143 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:18:18,144 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:18,144 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57426924]
[2025-02-05 16:18:18,144 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57426924] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:18,144 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:18,144 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:18:18,144 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753031064]
[2025-02-05 16:18:18,144 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:18,145 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:18:18,145 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:18,145 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:18:18,145 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:18,145 INFO  L87              Difference]: Start difference. First operand 185 states and 258 transitions. Second operand  has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:18:18,170 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:18,171 INFO  L93              Difference]: Finished difference Result 410 states and 621 transitions.
[2025-02-05 16:18:18,173 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:18:18,173 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91
[2025-02-05 16:18:18,173 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:18,174 INFO  L225             Difference]: With dead ends: 410
[2025-02-05 16:18:18,174 INFO  L226             Difference]: Without dead ends: 292
[2025-02-05 16:18:18,175 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:18:18,175 INFO  L435           NwaCegarLoop]: 162 mSDtfsCounter, 67 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:18,175 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 254 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:18,176 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 292 states.
[2025-02-05 16:18:18,191 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290.
[2025-02-05 16:18:18,193 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 290 states, 289 states have (on average 1.4740484429065743) internal successors, (426), 289 states have internal predecessors, (426), 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:18:18,195 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 426 transitions.
[2025-02-05 16:18:18,196 INFO  L78                 Accepts]: Start accepts. Automaton has 290 states and 426 transitions. Word has length 91
[2025-02-05 16:18:18,196 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:18,196 INFO  L471      AbstractCegarLoop]: Abstraction has 290 states and 426 transitions.
[2025-02-05 16:18:18,196 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:18:18,197 INFO  L276                IsEmpty]: Start isEmpty. Operand 290 states and 426 transitions.
[2025-02-05 16:18:18,198 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-02-05 16:18:18,200 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:18,200 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:18,200 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 16:18:18,200 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:18,201 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:18,201 INFO  L85        PathProgramCache]: Analyzing trace with hash 54885598, now seen corresponding path program 1 times
[2025-02-05 16:18:18,201 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:18,201 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024279516]
[2025-02-05 16:18:18,201 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:18,201 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:18,224 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-02-05 16:18:18,242 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-02-05 16:18:18,242 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:18,242 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:18,713 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:18:18,714 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:18,714 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024279516]
[2025-02-05 16:18:18,714 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024279516] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:18,714 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:18,714 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-02-05 16:18:18,714 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436986500]
[2025-02-05 16:18:18,714 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:18,715 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-02-05 16:18:18,715 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:18,715 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-02-05 16:18:18,715 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2025-02-05 16:18:18,715 INFO  L87              Difference]: Start difference. First operand 290 states and 426 transitions. Second operand  has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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:18:19,147 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:19,147 INFO  L93              Difference]: Finished difference Result 515 states and 786 transitions.
[2025-02-05 16:18:19,152 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-05 16:18:19,153 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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 91
[2025-02-05 16:18:19,154 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:19,156 INFO  L225             Difference]: With dead ends: 515
[2025-02-05 16:18:19,156 INFO  L226             Difference]: Without dead ends: 292
[2025-02-05 16:18:19,158 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240
[2025-02-05 16:18:19,159 INFO  L435           NwaCegarLoop]: 154 mSDtfsCounter, 352 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:19,159 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 818 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:18:19,160 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 292 states.
[2025-02-05 16:18:19,169 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290.
[2025-02-05 16:18:19,170 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 290 states, 289 states have (on average 1.467128027681661) internal successors, (424), 289 states have internal predecessors, (424), 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:18:19,171 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 424 transitions.
[2025-02-05 16:18:19,172 INFO  L78                 Accepts]: Start accepts. Automaton has 290 states and 424 transitions. Word has length 91
[2025-02-05 16:18:19,172 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:19,172 INFO  L471      AbstractCegarLoop]: Abstraction has 290 states and 424 transitions.
[2025-02-05 16:18:19,172 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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:18:19,172 INFO  L276                IsEmpty]: Start isEmpty. Operand 290 states and 424 transitions.
[2025-02-05 16:18:19,177 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-02-05 16:18:19,177 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:19,177 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:19,177 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 16:18:19,177 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:19,177 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:19,177 INFO  L85        PathProgramCache]: Analyzing trace with hash 1731991271, now seen corresponding path program 1 times
[2025-02-05 16:18:19,178 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:19,178 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751946870]
[2025-02-05 16:18:19,178 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:19,178 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:19,199 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-02-05 16:18:19,240 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-02-05 16:18:19,240 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:19,240 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:19,569 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:18:19,569 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:19,569 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751946870]
[2025-02-05 16:18:19,569 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751946870] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:19,569 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:19,569 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:18:19,569 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309942158]
[2025-02-05 16:18:19,570 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:19,570 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:18:19,570 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:19,570 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:18:19,571 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:18:19,571 INFO  L87              Difference]: Start difference. First operand 290 states and 424 transitions. Second operand  has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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:18:19,608 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:19,611 INFO  L93              Difference]: Finished difference Result 298 states and 433 transitions.
[2025-02-05 16:18:19,612 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:18:19,612 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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 92
[2025-02-05 16:18:19,613 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:19,614 INFO  L225             Difference]: With dead ends: 298
[2025-02-05 16:18:19,617 INFO  L226             Difference]: Without dead ends: 296
[2025-02-05 16:18:19,618 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:18:19,618 INFO  L435           NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:19,618 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 635 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:19,619 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 296 states.
[2025-02-05 16:18:19,625 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296.
[2025-02-05 16:18:19,626 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 296 states, 295 states have (on average 1.4542372881355932) internal successors, (429), 295 states have internal predecessors, (429), 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:18:19,627 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 429 transitions.
[2025-02-05 16:18:19,627 INFO  L78                 Accepts]: Start accepts. Automaton has 296 states and 429 transitions. Word has length 92
[2025-02-05 16:18:19,627 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:19,627 INFO  L471      AbstractCegarLoop]: Abstraction has 296 states and 429 transitions.
[2025-02-05 16:18:19,627 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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:18:19,627 INFO  L276                IsEmpty]: Start isEmpty. Operand 296 states and 429 transitions.
[2025-02-05 16:18:19,632 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2025-02-05 16:18:19,632 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:19,632 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:19,632 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 16:18:19,632 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:19,633 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:19,633 INFO  L85        PathProgramCache]: Analyzing trace with hash -274829988, now seen corresponding path program 1 times
[2025-02-05 16:18:19,633 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:19,633 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991597464]
[2025-02-05 16:18:19,633 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:19,633 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:19,649 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes.
[2025-02-05 16:18:19,661 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-02-05 16:18:19,661 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:19,661 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:19,710 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:18:19,710 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:19,710 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991597464]
[2025-02-05 16:18:19,710 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991597464] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:19,711 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:19,711 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:18:19,711 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17621842]
[2025-02-05 16:18:19,711 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:19,711 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:18:19,711 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:19,712 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:18:19,712 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:19,712 INFO  L87              Difference]: Start difference. First operand 296 states and 429 transitions. Second operand  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:18:19,729 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:19,729 INFO  L93              Difference]: Finished difference Result 538 states and 810 transitions.
[2025-02-05 16:18:19,729 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:18:19,730 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93
[2025-02-05 16:18:19,730 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:19,731 INFO  L225             Difference]: With dead ends: 538
[2025-02-05 16:18:19,731 INFO  L226             Difference]: Without dead ends: 414
[2025-02-05 16:18:19,732 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:18:19,732 INFO  L435           NwaCegarLoop]: 246 mSDtfsCounter, 87 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:19,732 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 344 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:19,733 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 414 states.
[2025-02-05 16:18:19,740 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 412.
[2025-02-05 16:18:19,741 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 412 states, 411 states have (on average 1.4841849148418491) internal successors, (610), 411 states have internal predecessors, (610), 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:18:19,742 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 610 transitions.
[2025-02-05 16:18:19,742 INFO  L78                 Accepts]: Start accepts. Automaton has 412 states and 610 transitions. Word has length 93
[2025-02-05 16:18:19,742 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:19,742 INFO  L471      AbstractCegarLoop]: Abstraction has 412 states and 610 transitions.
[2025-02-05 16:18:19,742 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:18:19,742 INFO  L276                IsEmpty]: Start isEmpty. Operand 412 states and 610 transitions.
[2025-02-05 16:18:19,743 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2025-02-05 16:18:19,743 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:19,743 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:19,743 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 16:18:19,743 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:19,744 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:19,744 INFO  L85        PathProgramCache]: Analyzing trace with hash -283471332, now seen corresponding path program 1 times
[2025-02-05 16:18:19,744 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:19,744 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463633572]
[2025-02-05 16:18:19,744 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:19,744 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:19,758 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes.
[2025-02-05 16:18:19,789 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-02-05 16:18:19,789 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:19,789 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:19,839 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:18:19,839 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:19,839 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463633572]
[2025-02-05 16:18:19,839 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463633572] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:19,839 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:19,839 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:18:19,839 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045269538]
[2025-02-05 16:18:19,839 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:19,840 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:18:19,840 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:19,840 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:18:19,840 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:19,840 INFO  L87              Difference]: Start difference. First operand 412 states and 610 transitions. Second operand  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:18:19,901 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:19,904 INFO  L93              Difference]: Finished difference Result 1074 states and 1650 transitions.
[2025-02-05 16:18:19,905 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:18:19,905 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93
[2025-02-05 16:18:19,906 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:19,912 INFO  L225             Difference]: With dead ends: 1074
[2025-02-05 16:18:19,912 INFO  L226             Difference]: Without dead ends: 731
[2025-02-05 16:18:19,917 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:18:19,917 INFO  L435           NwaCegarLoop]: 248 mSDtfsCounter, 85 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:19,917 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 350 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:19,919 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 731 states.
[2025-02-05 16:18:19,944 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 729.
[2025-02-05 16:18:19,948 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 729 states, 728 states have (on average 1.5137362637362637) internal successors, (1102), 728 states have internal predecessors, (1102), 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:18:19,954 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1102 transitions.
[2025-02-05 16:18:19,954 INFO  L78                 Accepts]: Start accepts. Automaton has 729 states and 1102 transitions. Word has length 93
[2025-02-05 16:18:19,955 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:19,955 INFO  L471      AbstractCegarLoop]: Abstraction has 729 states and 1102 transitions.
[2025-02-05 16:18:19,955 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:18:19,955 INFO  L276                IsEmpty]: Start isEmpty. Operand 729 states and 1102 transitions.
[2025-02-05 16:18:19,956 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2025-02-05 16:18:19,959 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:19,960 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:19,960 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 16:18:19,960 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:19,960 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:19,960 INFO  L85        PathProgramCache]: Analyzing trace with hash 1691936476, now seen corresponding path program 1 times
[2025-02-05 16:18:19,961 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:19,961 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856407891]
[2025-02-05 16:18:19,961 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:19,961 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:19,987 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes.
[2025-02-05 16:18:20,004 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-02-05 16:18:20,004 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:20,004 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:20,088 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:18:20,088 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:20,088 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856407891]
[2025-02-05 16:18:20,088 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856407891] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:20,088 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:20,088 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:18:20,088 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736714181]
[2025-02-05 16:18:20,088 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:20,089 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:18:20,089 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:20,089 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:18:20,089 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:20,090 INFO  L87              Difference]: Start difference. First operand 729 states and 1102 transitions. Second operand  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:18:20,130 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:20,130 INFO  L93              Difference]: Finished difference Result 2001 states and 3084 transitions.
[2025-02-05 16:18:20,131 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:18:20,131 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93
[2025-02-05 16:18:20,131 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:20,135 INFO  L225             Difference]: With dead ends: 2001
[2025-02-05 16:18:20,135 INFO  L226             Difference]: Without dead ends: 1341
[2025-02-05 16:18:20,136 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:18:20,138 INFO  L435           NwaCegarLoop]: 246 mSDtfsCounter, 83 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:20,138 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 352 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:20,140 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1341 states.
[2025-02-05 16:18:20,162 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1339.
[2025-02-05 16:18:20,163 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1339 states, 1338 states have (on average 1.5231689088191331) internal successors, (2038), 1338 states have internal predecessors, (2038), 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:18:20,167 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2038 transitions.
[2025-02-05 16:18:20,167 INFO  L78                 Accepts]: Start accepts. Automaton has 1339 states and 2038 transitions. Word has length 93
[2025-02-05 16:18:20,167 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:20,167 INFO  L471      AbstractCegarLoop]: Abstraction has 1339 states and 2038 transitions.
[2025-02-05 16:18:20,168 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:18:20,168 INFO  L276                IsEmpty]: Start isEmpty. Operand 1339 states and 2038 transitions.
[2025-02-05 16:18:20,168 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2025-02-05 16:18:20,168 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:20,168 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:20,168 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 16:18:20,169 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:20,169 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:20,169 INFO  L85        PathProgramCache]: Analyzing trace with hash 1537567644, now seen corresponding path program 1 times
[2025-02-05 16:18:20,169 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:20,169 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742794248]
[2025-02-05 16:18:20,169 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:20,169 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:20,185 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes.
[2025-02-05 16:18:20,193 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-02-05 16:18:20,193 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:20,193 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:20,233 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:18:20,234 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:20,234 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742794248]
[2025-02-05 16:18:20,234 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742794248] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:20,234 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:20,234 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:18:20,234 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830940773]
[2025-02-05 16:18:20,234 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:20,234 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:18:20,234 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:20,235 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:18:20,235 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:20,235 INFO  L87              Difference]: Start difference. First operand 1339 states and 2038 transitions. Second operand  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:18:20,283 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:20,283 INFO  L93              Difference]: Finished difference Result 3783 states and 5808 transitions.
[2025-02-05 16:18:20,284 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:18:20,284 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93
[2025-02-05 16:18:20,284 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:20,292 INFO  L225             Difference]: With dead ends: 3783
[2025-02-05 16:18:20,292 INFO  L226             Difference]: Without dead ends: 2513
[2025-02-05 16:18:20,293 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:18:20,294 INFO  L435           NwaCegarLoop]: 244 mSDtfsCounter, 81 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:20,294 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 354 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:20,296 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2513 states.
[2025-02-05 16:18:20,337 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2511.
[2025-02-05 16:18:20,340 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2511 states, 2510 states have (on average 1.5195219123505976) internal successors, (3814), 2510 states have internal predecessors, (3814), 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:18:20,347 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 3814 transitions.
[2025-02-05 16:18:20,347 INFO  L78                 Accepts]: Start accepts. Automaton has 2511 states and 3814 transitions. Word has length 93
[2025-02-05 16:18:20,347 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:20,347 INFO  L471      AbstractCegarLoop]: Abstraction has 2511 states and 3814 transitions.
[2025-02-05 16:18:20,347 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:18:20,348 INFO  L276                IsEmpty]: Start isEmpty. Operand 2511 states and 3814 transitions.
[2025-02-05 16:18:20,348 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2025-02-05 16:18:20,348 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:20,348 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:20,348 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 16:18:20,348 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:20,349 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:20,349 INFO  L85        PathProgramCache]: Analyzing trace with hash 558637148, now seen corresponding path program 1 times
[2025-02-05 16:18:20,349 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:20,349 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437166924]
[2025-02-05 16:18:20,349 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:20,349 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:20,368 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes.
[2025-02-05 16:18:20,375 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-02-05 16:18:20,375 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:20,375 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:20,440 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:18:20,440 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:20,440 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437166924]
[2025-02-05 16:18:20,440 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437166924] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:20,441 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:20,441 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:18:20,441 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461435976]
[2025-02-05 16:18:20,441 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:20,441 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:18:20,441 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:20,441 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:18:20,442 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:20,442 INFO  L87              Difference]: Start difference. First operand 2511 states and 3814 transitions. Second operand  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:18:20,506 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:20,507 INFO  L93              Difference]: Finished difference Result 7203 states and 10968 transitions.
[2025-02-05 16:18:20,507 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:18:20,507 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93
[2025-02-05 16:18:20,508 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:20,521 INFO  L225             Difference]: With dead ends: 7203
[2025-02-05 16:18:20,522 INFO  L226             Difference]: Without dead ends: 4761
[2025-02-05 16:18:20,525 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:18:20,526 INFO  L435           NwaCegarLoop]: 242 mSDtfsCounter, 79 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:20,526 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 356 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:20,529 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4761 states.
[2025-02-05 16:18:20,613 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4761 to 4759.
[2025-02-05 16:18:20,619 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4759 states, 4758 states have (on average 1.5077763766288357) internal successors, (7174), 4758 states have internal predecessors, (7174), 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:18:20,635 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4759 states and 7174 transitions.
[2025-02-05 16:18:20,636 INFO  L78                 Accepts]: Start accepts. Automaton has 4759 states and 7174 transitions. Word has length 93
[2025-02-05 16:18:20,636 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:20,636 INFO  L471      AbstractCegarLoop]: Abstraction has 4759 states and 7174 transitions.
[2025-02-05 16:18:20,636 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:18:20,636 INFO  L276                IsEmpty]: Start isEmpty. Operand 4759 states and 7174 transitions.
[2025-02-05 16:18:20,637 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2025-02-05 16:18:20,637 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:20,637 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:20,637 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 16:18:20,637 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:20,638 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:20,638 INFO  L85        PathProgramCache]: Analyzing trace with hash 110691612, now seen corresponding path program 1 times
[2025-02-05 16:18:20,638 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:20,638 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647647686]
[2025-02-05 16:18:20,638 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:20,638 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:20,650 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes.
[2025-02-05 16:18:20,657 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-02-05 16:18:20,658 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:20,658 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:20,699 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:18:20,699 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:20,699 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647647686]
[2025-02-05 16:18:20,699 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647647686] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:20,699 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:20,700 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:18:20,700 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294881343]
[2025-02-05 16:18:20,700 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:20,700 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:18:20,700 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:20,700 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:18:20,700 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:20,701 INFO  L87              Difference]: Start difference. First operand 4759 states and 7174 transitions. Second operand  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:18:20,849 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:20,849 INFO  L93              Difference]: Finished difference Result 13755 states and 20712 transitions.
[2025-02-05 16:18:20,849 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:18:20,850 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93
[2025-02-05 16:18:20,850 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:20,880 INFO  L225             Difference]: With dead ends: 13755
[2025-02-05 16:18:20,880 INFO  L226             Difference]: Without dead ends: 9065
[2025-02-05 16:18:20,884 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:18:20,885 INFO  L435           NwaCegarLoop]: 240 mSDtfsCounter, 77 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:20,885 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 358 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:20,892 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9065 states.
[2025-02-05 16:18:21,085 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9065 to 9063.
[2025-02-05 16:18:21,098 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9063 states, 9062 states have (on average 1.490840873979254) internal successors, (13510), 9062 states have internal predecessors, (13510), 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:18:21,128 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 13510 transitions.
[2025-02-05 16:18:21,128 INFO  L78                 Accepts]: Start accepts. Automaton has 9063 states and 13510 transitions. Word has length 93
[2025-02-05 16:18:21,129 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:21,129 INFO  L471      AbstractCegarLoop]: Abstraction has 9063 states and 13510 transitions.
[2025-02-05 16:18:21,129 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:18:21,129 INFO  L276                IsEmpty]: Start isEmpty. Operand 9063 states and 13510 transitions.
[2025-02-05 16:18:21,129 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2025-02-05 16:18:21,129 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:21,130 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:21,130 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 16:18:21,130 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:21,130 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:21,130 INFO  L85        PathProgramCache]: Analyzing trace with hash 525867484, now seen corresponding path program 1 times
[2025-02-05 16:18:21,130 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:21,130 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56892360]
[2025-02-05 16:18:21,130 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:21,131 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:21,142 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes.
[2025-02-05 16:18:21,150 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-02-05 16:18:21,150 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:21,150 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:21,186 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:18:21,186 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:21,186 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56892360]
[2025-02-05 16:18:21,187 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56892360] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:21,187 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:21,187 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:18:21,187 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952813801]
[2025-02-05 16:18:21,187 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:21,187 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:18:21,187 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:21,188 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:18:21,188 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:21,188 INFO  L87              Difference]: Start difference. First operand 9063 states and 13510 transitions. Second operand  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:18:21,425 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:21,425 INFO  L93              Difference]: Finished difference Result 26283 states and 39048 transitions.
[2025-02-05 16:18:21,426 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:18:21,426 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93
[2025-02-05 16:18:21,426 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:21,467 INFO  L225             Difference]: With dead ends: 26283
[2025-02-05 16:18:21,467 INFO  L226             Difference]: Without dead ends: 17289
[2025-02-05 16:18:21,477 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:18:21,478 INFO  L435           NwaCegarLoop]: 238 mSDtfsCounter, 75 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:21,478 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 360 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:21,491 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17289 states.
[2025-02-05 16:18:21,829 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17289 to 17287.
[2025-02-05 16:18:21,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17287 states, 17286 states have (on average 1.4702071040148097) internal successors, (25414), 17286 states have internal predecessors, (25414), 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:18:21,904 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17287 states to 17287 states and 25414 transitions.
[2025-02-05 16:18:21,905 INFO  L78                 Accepts]: Start accepts. Automaton has 17287 states and 25414 transitions. Word has length 93
[2025-02-05 16:18:21,905 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:21,905 INFO  L471      AbstractCegarLoop]: Abstraction has 17287 states and 25414 transitions.
[2025-02-05 16:18:21,905 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:18:21,906 INFO  L276                IsEmpty]: Start isEmpty. Operand 17287 states and 25414 transitions.
[2025-02-05 16:18:21,906 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2025-02-05 16:18:21,906 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:21,906 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:21,906 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 16:18:21,906 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:21,906 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:21,907 INFO  L85        PathProgramCache]: Analyzing trace with hash 39149212, now seen corresponding path program 1 times
[2025-02-05 16:18:21,907 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:21,907 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085561269]
[2025-02-05 16:18:21,907 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:21,907 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:21,918 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes.
[2025-02-05 16:18:21,926 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-02-05 16:18:21,926 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:21,926 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:21,962 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:18:21,962 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:21,962 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085561269]
[2025-02-05 16:18:21,962 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085561269] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:21,962 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:21,962 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:18:21,962 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287317946]
[2025-02-05 16:18:21,963 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:21,963 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:18:21,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:21,963 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:18:21,963 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:21,963 INFO  L87              Difference]: Start difference. First operand 17287 states and 25414 transitions. Second operand  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:18:22,358 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:22,358 INFO  L93              Difference]: Finished difference Result 50187 states and 73416 transitions.
[2025-02-05 16:18:22,359 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:18:22,359 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93
[2025-02-05 16:18:22,359 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:22,419 INFO  L225             Difference]: With dead ends: 50187
[2025-02-05 16:18:22,419 INFO  L226             Difference]: Without dead ends: 32969
[2025-02-05 16:18:22,439 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:18:22,439 INFO  L435           NwaCegarLoop]: 236 mSDtfsCounter, 73 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:22,439 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 362 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:22,464 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32969 states.
[2025-02-05 16:18:23,282 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32969 to 32967.
[2025-02-05 16:18:23,325 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32967 states, 32966 states have (on average 1.446520657647273) internal successors, (47686), 32966 states have internal predecessors, (47686), 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:18:23,424 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32967 states to 32967 states and 47686 transitions.
[2025-02-05 16:18:23,426 INFO  L78                 Accepts]: Start accepts. Automaton has 32967 states and 47686 transitions. Word has length 93
[2025-02-05 16:18:23,426 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:23,426 INFO  L471      AbstractCegarLoop]: Abstraction has 32967 states and 47686 transitions.
[2025-02-05 16:18:23,427 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:18:23,427 INFO  L276                IsEmpty]: Start isEmpty. Operand 32967 states and 47686 transitions.
[2025-02-05 16:18:23,434 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2025-02-05 16:18:23,434 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:23,435 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:23,435 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 16:18:23,435 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:23,435 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:23,435 INFO  L85        PathProgramCache]: Analyzing trace with hash -418722285, now seen corresponding path program 1 times
[2025-02-05 16:18:23,435 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:23,435 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479622654]
[2025-02-05 16:18:23,435 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:23,436 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:23,452 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes.
[2025-02-05 16:18:23,465 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements.
[2025-02-05 16:18:23,465 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:23,465 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:23,782 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-02-05 16:18:23,783 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:23,783 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479622654]
[2025-02-05 16:18:23,783 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479622654] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:23,783 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:23,783 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-02-05 16:18:23,783 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947619688]
[2025-02-05 16:18:23,783 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:23,784 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-02-05 16:18:23,784 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:23,784 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-02-05 16:18:23,784 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-02-05 16:18:23,784 INFO  L87              Difference]: Start difference. First operand 32967 states and 47686 transitions. Second operand  has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 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:18:26,620 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:26,620 INFO  L93              Difference]: Finished difference Result 292953 states and 423759 transitions.
[2025-02-05 16:18:26,621 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-05 16:18:26,621 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 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 118
[2025-02-05 16:18:26,621 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:27,187 INFO  L225             Difference]: With dead ends: 292953
[2025-02-05 16:18:27,187 INFO  L226             Difference]: Without dead ends: 269911
[2025-02-05 16:18:27,237 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272
[2025-02-05 16:18:27,237 INFO  L435           NwaCegarLoop]: 264 mSDtfsCounter, 1554 mSDsluCounter, 2485 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 2749 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:27,237 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 2749 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-05 16:18:27,481 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 269911 states.
[2025-02-05 16:18:30,316 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 269911 to 60999.
[2025-02-05 16:18:30,387 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60999 states, 60998 states have (on average 1.4406701859077347) internal successors, (87878), 60998 states have internal predecessors, (87878), 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:18:30,524 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60999 states to 60999 states and 87878 transitions.
[2025-02-05 16:18:30,533 INFO  L78                 Accepts]: Start accepts. Automaton has 60999 states and 87878 transitions. Word has length 118
[2025-02-05 16:18:30,534 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:30,534 INFO  L471      AbstractCegarLoop]: Abstraction has 60999 states and 87878 transitions.
[2025-02-05 16:18:30,534 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 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:18:30,534 INFO  L276                IsEmpty]: Start isEmpty. Operand 60999 states and 87878 transitions.
[2025-02-05 16:18:30,543 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2025-02-05 16:18:30,543 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:30,543 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:30,543 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 16:18:30,544 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:30,544 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:30,544 INFO  L85        PathProgramCache]: Analyzing trace with hash -427363629, now seen corresponding path program 1 times
[2025-02-05 16:18:30,544 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:30,544 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287346479]
[2025-02-05 16:18:30,544 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:30,545 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:30,572 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes.
[2025-02-05 16:18:30,584 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements.
[2025-02-05 16:18:30,584 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:30,584 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:30,784 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-02-05 16:18:30,784 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:30,784 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287346479]
[2025-02-05 16:18:30,784 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287346479] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:30,784 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:30,784 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-02-05 16:18:30,784 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410581964]
[2025-02-05 16:18:30,784 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:30,785 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-02-05 16:18:30,785 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:30,785 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-02-05 16:18:30,785 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-02-05 16:18:30,785 INFO  L87              Difference]: Start difference. First operand 60999 states and 87878 transitions. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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:18:35,567 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:35,568 INFO  L93              Difference]: Finished difference Result 325849 states and 471119 transitions.
[2025-02-05 16:18:35,568 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-05 16:18:35,569 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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 118
[2025-02-05 16:18:35,569 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:36,160 INFO  L225             Difference]: With dead ends: 325849
[2025-02-05 16:18:36,161 INFO  L226             Difference]: Without dead ends: 292951
[2025-02-05 16:18:36,243 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272
[2025-02-05 16:18:36,244 INFO  L435           NwaCegarLoop]: 263 mSDtfsCounter, 1558 mSDsluCounter, 2396 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 2659 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:36,246 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 2659 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:18:36,515 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 292951 states.
[2025-02-05 16:18:41,098 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 292951 to 105415.
[2025-02-05 16:18:41,168 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 105415 states, 105414 states have (on average 1.4371335875690137) internal successors, (151494), 105414 states have internal predecessors, (151494), 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:18:41,314 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 105415 states to 105415 states and 151494 transitions.
[2025-02-05 16:18:41,324 INFO  L78                 Accepts]: Start accepts. Automaton has 105415 states and 151494 transitions. Word has length 118
[2025-02-05 16:18:41,324 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:41,324 INFO  L471      AbstractCegarLoop]: Abstraction has 105415 states and 151494 transitions.
[2025-02-05 16:18:41,324 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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:18:41,324 INFO  L276                IsEmpty]: Start isEmpty. Operand 105415 states and 151494 transitions.
[2025-02-05 16:18:41,341 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2025-02-05 16:18:41,342 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:41,343 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:41,343 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 16:18:41,344 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:41,344 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:41,345 INFO  L85        PathProgramCache]: Analyzing trace with hash 1548044179, now seen corresponding path program 1 times
[2025-02-05 16:18:41,345 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:41,345 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562186920]
[2025-02-05 16:18:41,345 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:41,345 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:41,363 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes.
[2025-02-05 16:18:41,374 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements.
[2025-02-05 16:18:41,375 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:41,375 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:41,551 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-02-05 16:18:41,551 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:41,552 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562186920]
[2025-02-05 16:18:41,552 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562186920] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:41,552 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:41,552 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-02-05 16:18:41,552 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367889880]
[2025-02-05 16:18:41,552 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:41,552 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-02-05 16:18:41,552 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:41,558 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-02-05 16:18:41,558 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-02-05 16:18:41,558 INFO  L87              Difference]: Start difference. First operand 105415 states and 151494 transitions. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 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:18:47,256 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:47,256 INFO  L93              Difference]: Finished difference Result 358745 states and 518351 transitions.
[2025-02-05 16:18:47,257 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-05 16:18:47,257 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 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 118
[2025-02-05 16:18:47,257 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:47,915 INFO  L225             Difference]: With dead ends: 358745
[2025-02-05 16:18:47,916 INFO  L226             Difference]: Without dead ends: 325847
[2025-02-05 16:18:47,982 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272
[2025-02-05 16:18:47,983 INFO  L435           NwaCegarLoop]: 261 mSDtfsCounter, 1578 mSDsluCounter, 2348 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 2609 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:47,983 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 2609 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-05 16:18:48,205 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 325847 states.