./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c82e02bad63eada28ee405f8cd74dfaf9484d0aadaa27f27fe076fa722fdcdb7
[2025-03-03 14:50:25,605 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 14:50:25,614 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 14:50:25,615 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 14:50:25,616 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 14:50:25,617 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 14:50:25,617 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c
[2025-03-03 14:50:26,716 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0663c89b1/1645659944c449bab84d911acff95ea2/FLAG58aea0954
[2025-03-03 14:50:26,991 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 14:50:26,991 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c
[2025-03-03 14:50:27,001 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0663c89b1/1645659944c449bab84d911acff95ea2/FLAG58aea0954
[2025-03-03 14:50:27,283 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0663c89b1/1645659944c449bab84d911acff95ea2
[2025-03-03 14:50:27,285 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 14:50:27,288 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 14:50:27,289 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 14:50:27,289 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 14:50:27,292 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 14:50:27,292 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:50:27" (1/1) ...
[2025-03-03 14:50:27,294 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e97e282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:27, skipping insertion in model container
[2025-03-03 14:50:27,294 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:50:27" (1/1) ...
[2025-03-03 14:50:27,319 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 14:50:27,516 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c[16852,16865]
[2025-03-03 14:50:27,520 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 14:50:27,530 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 14:50:27,577 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c[16852,16865]
[2025-03-03 14:50:27,578 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 14:50:27,591 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 14:50:27,591 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:27 WrapperNode
[2025-03-03 14:50:27,592 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 14:50:27,592 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 14:50:27,592 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 14:50:27,592 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 14:50:27,596 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:27" (1/1) ...
[2025-03-03 14:50:27,602 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:27" (1/1) ...
[2025-03-03 14:50:27,624 INFO  L138                Inliner]: procedures = 26, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 448
[2025-03-03 14:50:27,625 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 14:50:27,625 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 14:50:27,625 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 14:50:27,626 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 14:50:27,634 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:27" (1/1) ...
[2025-03-03 14:50:27,634 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:27" (1/1) ...
[2025-03-03 14:50:27,636 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:27" (1/1) ...
[2025-03-03 14:50:27,655 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 14:50:27,655 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:27" (1/1) ...
[2025-03-03 14:50:27,655 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:27" (1/1) ...
[2025-03-03 14:50:27,667 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:27" (1/1) ...
[2025-03-03 14:50:27,669 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:27" (1/1) ...
[2025-03-03 14:50:27,670 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:27" (1/1) ...
[2025-03-03 14:50:27,671 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:27" (1/1) ...
[2025-03-03 14:50:27,673 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 14:50:27,673 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 14:50:27,673 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 14:50:27,673 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 14:50:27,674 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:27" (1/1) ...
[2025-03-03 14:50:27,677 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 14:50:27,685 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:50:27,697 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 14:50:27,703 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 14:50:27,718 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 14:50:27,718 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 14:50:27,718 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 14:50:27,718 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 14:50:27,797 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 14:50:27,799 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 14:50:28,188 INFO  L?                        ?]: Removed 51 outVars from TransFormulas that were not future-live.
[2025-03-03 14:50:28,189 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 14:50:28,196 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 14:50:28,196 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 14:50:28,197 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:50:28 BoogieIcfgContainer
[2025-03-03 14:50:28,197 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 14:50:28,199 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 14:50:28,199 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 14:50:28,202 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 14:50:28,202 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:50:27" (1/3) ...
[2025-03-03 14:50:28,202 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7205f37b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:50:28, skipping insertion in model container
[2025-03-03 14:50:28,203 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:27" (2/3) ...
[2025-03-03 14:50:28,203 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7205f37b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:50:28, skipping insertion in model container
[2025-03-03 14:50:28,203 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:50:28" (3/3) ...
[2025-03-03 14:50:28,204 INFO  L128   eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c
[2025-03-03 14:50:28,213 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 14:50:28,216 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c that has 1 procedures, 121 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 14:50:28,267 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 14:50:28,277 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;@4e4b7da0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 14:50:28,279 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 14:50:28,282 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 121 states, 119 states have (on average 1.7563025210084033) internal successors, (209), 120 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:28,287 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-03-03 14:50:28,288 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:28,288 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:50:28,289 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:28,293 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:28,294 INFO  L85        PathProgramCache]: Analyzing trace with hash 1078540218, now seen corresponding path program 1 times
[2025-03-03 14:50:28,299 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:28,300 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43042373]
[2025-03-03 14:50:28,300 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:28,302 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:28,376 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-03-03 14:50:28,421 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-03-03 14:50:28,421 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:28,421 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:28,510 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:28,511 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:28,512 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43042373]
[2025-03-03 14:50:28,512 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43042373] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:28,512 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:28,513 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 14:50:28,514 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389442682]
[2025-03-03 14:50:28,514 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:28,518 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-03 14:50:28,518 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:28,531 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-03 14:50:28,531 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 14:50:28,533 INFO  L87              Difference]: Start difference. First operand  has 121 states, 119 states have (on average 1.7563025210084033) internal successors, (209), 120 states have internal predecessors, (209), 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 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:28,546 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:28,547 INFO  L93              Difference]: Finished difference Result 193 states and 328 transitions.
[2025-03-03 14:50:28,547 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-03 14:50:28,548 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37
[2025-03-03 14:50:28,548 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:28,553 INFO  L225             Difference]: With dead ends: 193
[2025-03-03 14:50:28,553 INFO  L226             Difference]: Without dead ends: 118
[2025-03-03 14:50:28,555 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 14:50:28,556 INFO  L435           NwaCegarLoop]: 204 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, 204 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:28,557 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:28,565 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 118 states.
[2025-03-03 14:50:28,574 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118.
[2025-03-03 14:50:28,575 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 118 states, 117 states have (on average 1.7435897435897436) internal successors, (204), 117 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:28,579 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 204 transitions.
[2025-03-03 14:50:28,580 INFO  L78                 Accepts]: Start accepts. Automaton has 118 states and 204 transitions. Word has length 37
[2025-03-03 14:50:28,580 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:28,580 INFO  L471      AbstractCegarLoop]: Abstraction has 118 states and 204 transitions.
[2025-03-03 14:50:28,580 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:28,581 INFO  L276                IsEmpty]: Start isEmpty. Operand 118 states and 204 transitions.
[2025-03-03 14:50:28,581 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-03-03 14:50:28,583 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:28,583 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:50:28,584 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 14:50:28,584 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:28,584 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:28,584 INFO  L85        PathProgramCache]: Analyzing trace with hash -931563623, now seen corresponding path program 1 times
[2025-03-03 14:50:28,584 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:28,584 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109074247]
[2025-03-03 14:50:28,584 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:28,585 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:28,601 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-03-03 14:50:28,620 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-03-03 14:50:28,620 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:28,620 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:28,840 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:28,840 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:28,840 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109074247]
[2025-03-03 14:50:28,841 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109074247] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:28,841 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:28,841 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 14:50:28,841 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011369564]
[2025-03-03 14:50:28,841 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:28,842 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 14:50:28,842 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:28,842 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 14:50:28,842 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 14:50:28,842 INFO  L87              Difference]: Start difference. First operand 118 states and 204 transitions. Second operand  has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:28,931 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:28,934 INFO  L93              Difference]: Finished difference Result 193 states and 324 transitions.
[2025-03-03 14:50:28,934 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 14:50:28,934 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37
[2025-03-03 14:50:28,934 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:28,935 INFO  L225             Difference]: With dead ends: 193
[2025-03-03 14:50:28,935 INFO  L226             Difference]: Without dead ends: 118
[2025-03-03 14:50:28,935 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-03-03 14:50:28,936 INFO  L435           NwaCegarLoop]: 202 mSDtfsCounter, 0 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:28,936 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 762 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:50:28,937 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 118 states.
[2025-03-03 14:50:28,942 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118.
[2025-03-03 14:50:28,943 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 118 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:28,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 163 transitions.
[2025-03-03 14:50:28,943 INFO  L78                 Accepts]: Start accepts. Automaton has 118 states and 163 transitions. Word has length 37
[2025-03-03 14:50:28,943 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:28,944 INFO  L471      AbstractCegarLoop]: Abstraction has 118 states and 163 transitions.
[2025-03-03 14:50:28,944 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:28,944 INFO  L276                IsEmpty]: Start isEmpty. Operand 118 states and 163 transitions.
[2025-03-03 14:50:28,945 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-03-03 14:50:28,946 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:28,946 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:50:28,947 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 14:50:28,947 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:28,947 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:28,947 INFO  L85        PathProgramCache]: Analyzing trace with hash -1046637199, now seen corresponding path program 1 times
[2025-03-03 14:50:28,947 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:28,947 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546735641]
[2025-03-03 14:50:28,947 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:28,947 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:28,964 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-03-03 14:50:28,983 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-03-03 14:50:28,983 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:28,983 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:29,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-03-03 14:50:29,088 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:29,088 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546735641]
[2025-03-03 14:50:29,088 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546735641] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:29,088 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:29,088 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:50:29,089 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258256989]
[2025-03-03 14:50:29,089 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:29,089 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:50:29,089 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:29,089 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:50:29,089 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:29,090 INFO  L87              Difference]: Start difference. First operand 118 states and 163 transitions. Second operand  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:29,115 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:29,115 INFO  L93              Difference]: Finished difference Result 252 states and 381 transitions.
[2025-03-03 14:50:29,115 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:50:29,115 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77
[2025-03-03 14:50:29,115 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:29,116 INFO  L225             Difference]: With dead ends: 252
[2025-03-03 14:50:29,116 INFO  L226             Difference]: Without dead ends: 181
[2025-03-03 14:50:29,117 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:29,117 INFO  L435           NwaCegarLoop]: 243 mSDtfsCounter, 100 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:29,117 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 360 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:29,118 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 181 states.
[2025-03-03 14:50:29,123 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179.
[2025-03-03 14:50:29,123 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 179 states, 178 states have (on average 1.4775280898876404) internal successors, (263), 178 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:29,124 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 263 transitions.
[2025-03-03 14:50:29,124 INFO  L78                 Accepts]: Start accepts. Automaton has 179 states and 263 transitions. Word has length 77
[2025-03-03 14:50:29,124 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:29,124 INFO  L471      AbstractCegarLoop]: Abstraction has 179 states and 263 transitions.
[2025-03-03 14:50:29,124 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:29,124 INFO  L276                IsEmpty]: Start isEmpty. Operand 179 states and 263 transitions.
[2025-03-03 14:50:29,125 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-03-03 14:50:29,126 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:29,126 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:50:29,126 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 14:50:29,126 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:29,126 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:29,126 INFO  L85        PathProgramCache]: Analyzing trace with hash -1263268706, now seen corresponding path program 1 times
[2025-03-03 14:50:29,126 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:29,126 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903583007]
[2025-03-03 14:50:29,126 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:29,126 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:29,142 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-03-03 14:50:29,159 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-03-03 14:50:29,159 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:29,159 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:29,230 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:29,230 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:29,231 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903583007]
[2025-03-03 14:50:29,231 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903583007] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:29,232 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:29,232 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:50:29,232 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550778214]
[2025-03-03 14:50:29,232 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:29,233 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:50:29,233 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:29,233 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:50:29,233 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:29,233 INFO  L87              Difference]: Start difference. First operand 179 states and 263 transitions. Second operand  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:29,267 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:29,268 INFO  L93              Difference]: Finished difference Result 427 states and 667 transitions.
[2025-03-03 14:50:29,268 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:50:29,268 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77
[2025-03-03 14:50:29,269 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:29,270 INFO  L225             Difference]: With dead ends: 427
[2025-03-03 14:50:29,270 INFO  L226             Difference]: Without dead ends: 295
[2025-03-03 14:50:29,270 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:29,271 INFO  L435           NwaCegarLoop]: 236 mSDtfsCounter, 96 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:29,271 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 357 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:29,275 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 295 states.
[2025-03-03 14:50:29,283 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293.
[2025-03-03 14:50:29,284 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 293 states, 292 states have (on average 1.5342465753424657) internal successors, (448), 292 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:29,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 448 transitions.
[2025-03-03 14:50:29,285 INFO  L78                 Accepts]: Start accepts. Automaton has 293 states and 448 transitions. Word has length 77
[2025-03-03 14:50:29,286 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:29,286 INFO  L471      AbstractCegarLoop]: Abstraction has 293 states and 448 transitions.
[2025-03-03 14:50:29,286 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:29,286 INFO  L276                IsEmpty]: Start isEmpty. Operand 293 states and 448 transitions.
[2025-03-03 14:50:29,287 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-03-03 14:50:29,287 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:29,287 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:50:29,287 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 14:50:29,287 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:29,288 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:29,288 INFO  L85        PathProgramCache]: Analyzing trace with hash -1076420021, now seen corresponding path program 1 times
[2025-03-03 14:50:29,288 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:29,288 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880328325]
[2025-03-03 14:50:29,288 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:29,288 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:29,304 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-03-03 14:50:29,318 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-03-03 14:50:29,318 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:29,318 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:29,407 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:29,407 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:29,407 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880328325]
[2025-03-03 14:50:29,407 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880328325] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:29,408 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:29,408 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:50:29,408 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328648473]
[2025-03-03 14:50:29,408 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:29,408 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:50:29,408 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:29,408 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:50:29,408 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:29,409 INFO  L87              Difference]: Start difference. First operand 293 states and 448 transitions. Second operand  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:29,428 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:29,428 INFO  L93              Difference]: Finished difference Result 753 states and 1194 transitions.
[2025-03-03 14:50:29,430 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:50:29,431 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77
[2025-03-03 14:50:29,431 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:29,432 INFO  L225             Difference]: With dead ends: 753
[2025-03-03 14:50:29,433 INFO  L226             Difference]: Without dead ends: 507
[2025-03-03 14:50:29,433 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:29,436 INFO  L435           NwaCegarLoop]: 229 mSDtfsCounter, 92 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:29,436 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 354 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:29,438 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 507 states.
[2025-03-03 14:50:29,458 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 505.
[2025-03-03 14:50:29,464 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 505 states, 504 states have (on average 1.5634920634920635) internal successors, (788), 504 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:29,466 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 788 transitions.
[2025-03-03 14:50:29,466 INFO  L78                 Accepts]: Start accepts. Automaton has 505 states and 788 transitions. Word has length 77
[2025-03-03 14:50:29,466 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:29,466 INFO  L471      AbstractCegarLoop]: Abstraction has 505 states and 788 transitions.
[2025-03-03 14:50:29,467 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:29,467 INFO  L276                IsEmpty]: Start isEmpty. Operand 505 states and 788 transitions.
[2025-03-03 14:50:29,468 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-03-03 14:50:29,471 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:29,471 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:50:29,471 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 14:50:29,471 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:29,472 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:29,472 INFO  L85        PathProgramCache]: Analyzing trace with hash -887482760, now seen corresponding path program 1 times
[2025-03-03 14:50:29,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:29,472 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536838367]
[2025-03-03 14:50:29,472 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:29,472 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:29,488 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-03-03 14:50:29,500 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-03-03 14:50:29,501 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:29,501 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:29,686 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:29,687 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:29,687 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536838367]
[2025-03-03 14:50:29,687 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536838367] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:29,687 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:29,687 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 14:50:29,687 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070320356]
[2025-03-03 14:50:29,687 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:29,687 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 14:50:29,687 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:29,687 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 14:50:29,688 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-03-03 14:50:29,688 INFO  L87              Difference]: Start difference. First operand 505 states and 788 transitions. Second operand  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:29,881 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:29,881 INFO  L93              Difference]: Finished difference Result 3711 states and 5975 transitions.
[2025-03-03 14:50:29,882 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 14:50:29,882 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77
[2025-03-03 14:50:29,882 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:29,895 INFO  L225             Difference]: With dead ends: 3711
[2025-03-03 14:50:29,895 INFO  L226             Difference]: Without dead ends: 3253
[2025-03-03 14:50:29,898 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156
[2025-03-03 14:50:29,899 INFO  L435           NwaCegarLoop]: 159 mSDtfsCounter, 2099 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2099 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:29,899 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2099 Valid, 1531 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:50:29,902 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3253 states.
[2025-03-03 14:50:29,948 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3253 to 961.
[2025-03-03 14:50:29,950 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 961 states, 960 states have (on average 1.575) internal successors, (1512), 960 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:29,953 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1512 transitions.
[2025-03-03 14:50:29,953 INFO  L78                 Accepts]: Start accepts. Automaton has 961 states and 1512 transitions. Word has length 77
[2025-03-03 14:50:29,953 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:29,953 INFO  L471      AbstractCegarLoop]: Abstraction has 961 states and 1512 transitions.
[2025-03-03 14:50:29,953 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:29,953 INFO  L276                IsEmpty]: Start isEmpty. Operand 961 states and 1512 transitions.
[2025-03-03 14:50:29,954 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2025-03-03 14:50:29,954 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:29,954 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]
[2025-03-03 14:50:29,954 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 14:50:29,954 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:29,956 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:29,956 INFO  L85        PathProgramCache]: Analyzing trace with hash -1712547572, now seen corresponding path program 1 times
[2025-03-03 14:50:29,956 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:29,956 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067168360]
[2025-03-03 14:50:29,956 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:29,956 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:29,971 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes.
[2025-03-03 14:50:30,001 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements.
[2025-03-03 14:50:30,001 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:30,001 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:30,430 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:30,430 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:30,430 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067168360]
[2025-03-03 14:50:30,430 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067168360] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:30,430 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:30,430 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 14:50:30,430 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281434847]
[2025-03-03 14:50:30,430 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:30,430 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 14:50:30,430 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:30,431 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 14:50:30,431 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 14:50:30,431 INFO  L87              Difference]: Start difference. First operand 961 states and 1512 transitions. Second operand  has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:30,463 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:30,464 INFO  L93              Difference]: Finished difference Result 1011 states and 1577 transitions.
[2025-03-03 14:50:30,464 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 14:50:30,464 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78
[2025-03-03 14:50:30,465 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:30,468 INFO  L225             Difference]: With dead ends: 1011
[2025-03-03 14:50:30,468 INFO  L226             Difference]: Without dead ends: 1009
[2025-03-03 14:50:30,468 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-03-03 14:50:30,469 INFO  L435           NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:30,470 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 632 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:30,471 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1009 states.
[2025-03-03 14:50:30,505 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009.
[2025-03-03 14:50:30,507 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1009 states, 1008 states have (on average 1.5476190476190477) internal successors, (1560), 1008 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:30,511 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1560 transitions.
[2025-03-03 14:50:30,511 INFO  L78                 Accepts]: Start accepts. Automaton has 1009 states and 1560 transitions. Word has length 78
[2025-03-03 14:50:30,511 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:30,513 INFO  L471      AbstractCegarLoop]: Abstraction has 1009 states and 1560 transitions.
[2025-03-03 14:50:30,513 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:30,513 INFO  L276                IsEmpty]: Start isEmpty. Operand 1009 states and 1560 transitions.
[2025-03-03 14:50:30,514 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2025-03-03 14:50:30,514 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:30,514 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]
[2025-03-03 14:50:30,514 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 14:50:30,514 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:30,515 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:30,515 INFO  L85        PathProgramCache]: Analyzing trace with hash -1460647624, now seen corresponding path program 1 times
[2025-03-03 14:50:30,515 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:30,515 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506791694]
[2025-03-03 14:50:30,515 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:30,515 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:30,530 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes.
[2025-03-03 14:50:30,547 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements.
[2025-03-03 14:50:30,547 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:30,547 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:30,593 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:30,593 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:30,593 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506791694]
[2025-03-03 14:50:30,593 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506791694] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:30,593 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:30,593 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:50:30,594 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021905954]
[2025-03-03 14:50:30,594 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:30,594 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:50:30,594 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:30,594 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:50:30,594 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:30,594 INFO  L87              Difference]: Start difference. First operand 1009 states and 1560 transitions. Second operand  has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:30,633 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:30,633 INFO  L93              Difference]: Finished difference Result 2813 states and 4386 transitions.
[2025-03-03 14:50:30,634 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:50:30,634 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79
[2025-03-03 14:50:30,635 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:30,640 INFO  L225             Difference]: With dead ends: 2813
[2025-03-03 14:50:30,640 INFO  L226             Difference]: Without dead ends: 1851
[2025-03-03 14:50:30,641 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:30,642 INFO  L435           NwaCegarLoop]: 160 mSDtfsCounter, 76 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 271 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-03-03 14:50:30,642 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 271 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:30,645 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1851 states.
[2025-03-03 14:50:30,680 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1833.
[2025-03-03 14:50:30,683 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1833 states, 1832 states have (on average 1.5414847161572052) internal successors, (2824), 1832 states have internal predecessors, (2824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:30,688 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2824 transitions.
[2025-03-03 14:50:30,688 INFO  L78                 Accepts]: Start accepts. Automaton has 1833 states and 2824 transitions. Word has length 79
[2025-03-03 14:50:30,689 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:30,689 INFO  L471      AbstractCegarLoop]: Abstraction has 1833 states and 2824 transitions.
[2025-03-03 14:50:30,689 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:30,689 INFO  L276                IsEmpty]: Start isEmpty. Operand 1833 states and 2824 transitions.
[2025-03-03 14:50:30,691 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2025-03-03 14:50:30,691 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:30,691 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:50:30,691 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 14:50:30,691 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:30,691 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:30,691 INFO  L85        PathProgramCache]: Analyzing trace with hash -1294935783, now seen corresponding path program 1 times
[2025-03-03 14:50:30,691 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:30,691 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763028544]
[2025-03-03 14:50:30,692 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:30,692 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:30,704 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes.
[2025-03-03 14:50:30,711 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements.
[2025-03-03 14:50:30,712 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:30,712 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:30,747 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:30,747 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:30,747 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763028544]
[2025-03-03 14:50:30,747 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763028544] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:30,747 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:30,747 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:50:30,747 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327032771]
[2025-03-03 14:50:30,747 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:30,748 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:50:30,748 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:30,748 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:50:30,748 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:30,749 INFO  L87              Difference]: Start difference. First operand 1833 states and 2824 transitions. Second operand  has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:30,802 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:30,802 INFO  L93              Difference]: Finished difference Result 5149 states and 7930 transitions.
[2025-03-03 14:50:30,802 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:50:30,802 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80
[2025-03-03 14:50:30,802 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:30,812 INFO  L225             Difference]: With dead ends: 5149
[2025-03-03 14:50:30,812 INFO  L226             Difference]: Without dead ends: 3363
[2025-03-03 14:50:30,815 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:30,817 INFO  L435           NwaCegarLoop]: 206 mSDtfsCounter, 84 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:30,817 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 339 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:30,820 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3363 states.
[2025-03-03 14:50:30,886 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3363 to 3361.
[2025-03-03 14:50:30,891 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3361 states, 3360 states have (on average 1.5238095238095237) internal successors, (5120), 3360 states have internal predecessors, (5120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:30,901 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3361 states to 3361 states and 5120 transitions.
[2025-03-03 14:50:30,902 INFO  L78                 Accepts]: Start accepts. Automaton has 3361 states and 5120 transitions. Word has length 80
[2025-03-03 14:50:30,902 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:30,902 INFO  L471      AbstractCegarLoop]: Abstraction has 3361 states and 5120 transitions.
[2025-03-03 14:50:30,903 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:30,903 INFO  L276                IsEmpty]: Start isEmpty. Operand 3361 states and 5120 transitions.
[2025-03-03 14:50:30,905 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2025-03-03 14:50:30,906 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:30,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]
[2025-03-03 14:50:30,906 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 14:50:30,906 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:30,906 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:30,906 INFO  L85        PathProgramCache]: Analyzing trace with hash 1841355623, now seen corresponding path program 1 times
[2025-03-03 14:50:30,906 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:30,906 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541051813]
[2025-03-03 14:50:30,906 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:30,907 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:30,919 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes.
[2025-03-03 14:50:30,927 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements.
[2025-03-03 14:50:30,928 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:30,928 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:30,959 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:30,960 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:30,960 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541051813]
[2025-03-03 14:50:30,960 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541051813] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:30,960 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:30,960 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:50:30,960 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215021884]
[2025-03-03 14:50:30,960 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:30,961 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:50:30,961 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:30,962 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:50:30,962 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:30,962 INFO  L87              Difference]: Start difference. First operand 3361 states and 5120 transitions. Second operand  has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:31,058 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:31,058 INFO  L93              Difference]: Finished difference Result 9477 states and 14370 transitions.
[2025-03-03 14:50:31,059 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:50:31,059 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80
[2025-03-03 14:50:31,059 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:31,078 INFO  L225             Difference]: With dead ends: 9477
[2025-03-03 14:50:31,078 INFO  L226             Difference]: Without dead ends: 6163
[2025-03-03 14:50:31,083 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:31,083 INFO  L435           NwaCegarLoop]: 223 mSDtfsCounter, 88 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:31,084 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 352 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:31,088 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6163 states.
[2025-03-03 14:50:31,195 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6163 to 6161.
[2025-03-03 14:50:31,203 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6161 states, 6160 states have (on average 1.4987012987012986) internal successors, (9232), 6160 states have internal predecessors, (9232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:31,222 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6161 states to 6161 states and 9232 transitions.
[2025-03-03 14:50:31,222 INFO  L78                 Accepts]: Start accepts. Automaton has 6161 states and 9232 transitions. Word has length 80
[2025-03-03 14:50:31,222 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:31,223 INFO  L471      AbstractCegarLoop]: Abstraction has 6161 states and 9232 transitions.
[2025-03-03 14:50:31,223 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:31,223 INFO  L276                IsEmpty]: Start isEmpty. Operand 6161 states and 9232 transitions.
[2025-03-03 14:50:31,223 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2025-03-03 14:50:31,223 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:31,223 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:50:31,224 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 14:50:31,224 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:31,224 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:31,224 INFO  L85        PathProgramCache]: Analyzing trace with hash -1801594482, now seen corresponding path program 1 times
[2025-03-03 14:50:31,225 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:31,225 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998044211]
[2025-03-03 14:50:31,225 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:31,225 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:31,234 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes.
[2025-03-03 14:50:31,239 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements.
[2025-03-03 14:50:31,239 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:31,239 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:31,269 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:31,269 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:31,269 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998044211]
[2025-03-03 14:50:31,269 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998044211] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:31,269 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:31,269 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:50:31,269 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160042635]
[2025-03-03 14:50:31,269 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:31,270 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:50:31,270 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:31,270 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:50:31,270 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:31,270 INFO  L87              Difference]: Start difference. First operand 6161 states and 9232 transitions. Second operand  has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:31,393 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:31,394 INFO  L93              Difference]: Finished difference Result 12248 states and 18454 transitions.
[2025-03-03 14:50:31,394 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:50:31,394 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81
[2025-03-03 14:50:31,394 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:31,423 INFO  L225             Difference]: With dead ends: 12248
[2025-03-03 14:50:31,424 INFO  L226             Difference]: Without dead ends: 8917
[2025-03-03 14:50:31,426 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:31,427 INFO  L435           NwaCegarLoop]: 257 mSDtfsCounter, 101 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:31,427 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 372 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:31,432 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8917 states.
[2025-03-03 14:50:31,571 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8917 to 8915.
[2025-03-03 14:50:31,584 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8915 states, 8914 states have (on average 1.4918106349562485) internal successors, (13298), 8914 states have internal predecessors, (13298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:31,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8915 states to 8915 states and 13298 transitions.
[2025-03-03 14:50:31,611 INFO  L78                 Accepts]: Start accepts. Automaton has 8915 states and 13298 transitions. Word has length 81
[2025-03-03 14:50:31,611 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:31,611 INFO  L471      AbstractCegarLoop]: Abstraction has 8915 states and 13298 transitions.
[2025-03-03 14:50:31,611 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:31,612 INFO  L276                IsEmpty]: Start isEmpty. Operand 8915 states and 13298 transitions.
[2025-03-03 14:50:31,620 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-03-03 14:50:31,620 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:31,620 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]
[2025-03-03 14:50:31,620 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 14:50:31,621 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:31,623 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:31,623 INFO  L85        PathProgramCache]: Analyzing trace with hash 1614533079, now seen corresponding path program 1 times
[2025-03-03 14:50:31,623 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:31,623 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103135274]
[2025-03-03 14:50:31,623 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:31,623 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:31,634 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-03 14:50:31,645 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-03 14:50:31,645 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:31,645 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:31,812 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 14:50:31,812 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:31,812 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103135274]
[2025-03-03 14:50:31,812 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103135274] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:31,812 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:31,812 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 14:50:31,812 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462924406]
[2025-03-03 14:50:31,812 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:31,813 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 14:50:31,813 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:31,813 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 14:50:31,813 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-03-03 14:50:31,813 INFO  L87              Difference]: Start difference. First operand 8915 states and 13298 transitions. Second operand  has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:32,267 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:32,267 INFO  L93              Difference]: Finished difference Result 34273 states and 51657 transitions.
[2025-03-03 14:50:32,268 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 14:50:32,268 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111
[2025-03-03 14:50:32,268 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:32,321 INFO  L225             Difference]: With dead ends: 34273
[2025-03-03 14:50:32,321 INFO  L226             Difference]: Without dead ends: 29791
[2025-03-03 14:50:32,329 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2025-03-03 14:50:32,330 INFO  L435           NwaCegarLoop]: 278 mSDtfsCounter, 1295 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:32,330 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 1690 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:50:32,349 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29791 states.
[2025-03-03 14:50:32,685 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29791 to 13299.
[2025-03-03 14:50:32,707 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13299 states, 13298 states have (on average 1.4921040758008723) internal successors, (19842), 13298 states have internal predecessors, (19842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:32,735 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13299 states to 13299 states and 19842 transitions.
[2025-03-03 14:50:32,736 INFO  L78                 Accepts]: Start accepts. Automaton has 13299 states and 19842 transitions. Word has length 111
[2025-03-03 14:50:32,736 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:32,736 INFO  L471      AbstractCegarLoop]: Abstraction has 13299 states and 19842 transitions.
[2025-03-03 14:50:32,736 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:32,736 INFO  L276                IsEmpty]: Start isEmpty. Operand 13299 states and 19842 transitions.
[2025-03-03 14:50:32,741 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-03-03 14:50:32,741 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:32,741 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]
[2025-03-03 14:50:32,741 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 14:50:32,741 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:32,742 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:32,742 INFO  L85        PathProgramCache]: Analyzing trace with hash -2095100797, now seen corresponding path program 1 times
[2025-03-03 14:50:32,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:32,742 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902012801]
[2025-03-03 14:50:32,742 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:32,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:32,755 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-03 14:50:32,769 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-03 14:50:32,769 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:32,769 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:32,915 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-03-03 14:50:32,915 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:32,915 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902012801]
[2025-03-03 14:50:32,916 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902012801] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:32,916 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:32,916 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 14:50:32,916 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042698437]
[2025-03-03 14:50:32,916 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:32,916 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 14:50:32,916 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:32,916 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 14:50:32,917 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-03-03 14:50:32,917 INFO  L87              Difference]: Start difference. First operand 13299 states and 19842 transitions. Second operand  has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:33,456 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:33,456 INFO  L93              Difference]: Finished difference Result 38657 states and 58201 transitions.
[2025-03-03 14:50:33,456 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 14:50:33,457 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 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 111
[2025-03-03 14:50:33,457 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:33,512 INFO  L225             Difference]: With dead ends: 38657
[2025-03-03 14:50:33,513 INFO  L226             Difference]: Without dead ends: 34175
[2025-03-03 14:50:33,523 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2025-03-03 14:50:33,524 INFO  L435           NwaCegarLoop]: 276 mSDtfsCounter, 1331 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:33,524 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 1504 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:50:33,543 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34175 states.
[2025-03-03 14:50:34,038 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34175 to 17683.
[2025-03-03 14:50:34,062 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17683 states, 17682 states have (on average 1.4922520076914376) internal successors, (26386), 17682 states have internal predecessors, (26386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:34,086 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17683 states to 17683 states and 26386 transitions.
[2025-03-03 14:50:34,088 INFO  L78                 Accepts]: Start accepts. Automaton has 17683 states and 26386 transitions. Word has length 111
[2025-03-03 14:50:34,088 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:34,088 INFO  L471      AbstractCegarLoop]: Abstraction has 17683 states and 26386 transitions.
[2025-03-03 14:50:34,088 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:34,088 INFO  L276                IsEmpty]: Start isEmpty. Operand 17683 states and 26386 transitions.
[2025-03-03 14:50:34,094 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-03-03 14:50:34,095 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:34,095 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]
[2025-03-03 14:50:34,095 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 14:50:34,095 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:34,096 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:34,096 INFO  L85        PathProgramCache]: Analyzing trace with hash 98762031, now seen corresponding path program 1 times
[2025-03-03 14:50:34,096 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:34,096 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347349598]
[2025-03-03 14:50:34,096 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:34,096 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:34,106 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-03 14:50:34,118 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-03 14:50:34,119 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:34,119 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:34,256 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-03-03 14:50:34,257 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:34,257 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347349598]
[2025-03-03 14:50:34,257 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347349598] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:34,257 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:34,257 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 14:50:34,257 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161913204]
[2025-03-03 14:50:34,257 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:34,257 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 14:50:34,258 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:34,258 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 14:50:34,258 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-03-03 14:50:34,258 INFO  L87              Difference]: Start difference. First operand 17683 states and 26386 transitions. Second operand  has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:34,751 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:34,751 INFO  L93              Difference]: Finished difference Result 43041 states and 64745 transitions.
[2025-03-03 14:50:34,752 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 14:50:34,752 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 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 111
[2025-03-03 14:50:34,752 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:34,810 INFO  L225             Difference]: With dead ends: 43041
[2025-03-03 14:50:34,810 INFO  L226             Difference]: Without dead ends: 38559
[2025-03-03 14:50:34,821 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2025-03-03 14:50:34,822 INFO  L435           NwaCegarLoop]: 274 mSDtfsCounter, 1478 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:34,822 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 1438 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:50:34,843 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 38559 states.
[2025-03-03 14:50:35,217 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 38559 to 22067.
[2025-03-03 14:50:35,244 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22067 states, 22066 states have (on average 1.4923411583431523) internal successors, (32930), 22066 states have internal predecessors, (32930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:35,276 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22067 states to 22067 states and 32930 transitions.
[2025-03-03 14:50:35,277 INFO  L78                 Accepts]: Start accepts. Automaton has 22067 states and 32930 transitions. Word has length 111
[2025-03-03 14:50:35,277 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:35,277 INFO  L471      AbstractCegarLoop]: Abstraction has 22067 states and 32930 transitions.
[2025-03-03 14:50:35,278 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:35,278 INFO  L276                IsEmpty]: Start isEmpty. Operand 22067 states and 32930 transitions.
[2025-03-03 14:50:35,284 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-03-03 14:50:35,284 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:35,284 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 14:50:35,284 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 14:50:35,284 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:35,285 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:35,285 INFO  L85        PathProgramCache]: Analyzing trace with hash -485765408, now seen corresponding path program 1 times
[2025-03-03 14:50:35,285 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:35,285 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125839009]
[2025-03-03 14:50:35,285 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:35,285 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:35,295 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-03 14:50:35,304 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-03 14:50:35,304 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:35,305 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:35,512 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-03-03 14:50:35,512 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:35,512 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125839009]
[2025-03-03 14:50:35,512 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125839009] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:35,512 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:35,513 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 14:50:35,513 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737545440]
[2025-03-03 14:50:35,513 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:35,513 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 14:50:35,513 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:35,513 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 14:50:35,514 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-03-03 14:50:35,514 INFO  L87              Difference]: Start difference. First operand 22067 states and 32930 transitions. Second operand  has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:36,210 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:36,210 INFO  L93              Difference]: Finished difference Result 47425 states and 71289 transitions.
[2025-03-03 14:50:36,211 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 14:50:36,211 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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 111
[2025-03-03 14:50:36,212 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:36,289 INFO  L225             Difference]: With dead ends: 47425
[2025-03-03 14:50:36,289 INFO  L226             Difference]: Without dead ends: 42943
[2025-03-03 14:50:36,312 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2025-03-03 14:50:36,312 INFO  L435           NwaCegarLoop]: 274 mSDtfsCounter, 1378 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:36,312 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 1549 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:50:36,338 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 42943 states.
[2025-03-03 14:50:36,870 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 42943 to 26451.
[2025-03-03 14:50:36,895 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 26451 states, 26450 states have (on average 1.4924007561436674) internal successors, (39474), 26450 states have internal predecessors, (39474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:36,926 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26451 states to 26451 states and 39474 transitions.
[2025-03-03 14:50:36,927 INFO  L78                 Accepts]: Start accepts. Automaton has 26451 states and 39474 transitions. Word has length 111
[2025-03-03 14:50:36,928 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:36,928 INFO  L471      AbstractCegarLoop]: Abstraction has 26451 states and 39474 transitions.
[2025-03-03 14:50:36,928 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:36,928 INFO  L276                IsEmpty]: Start isEmpty. Operand 26451 states and 39474 transitions.
[2025-03-03 14:50:36,934 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-03-03 14:50:36,934 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:36,934 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 14:50:36,935 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-03 14:50:36,935 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:36,935 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:36,935 INFO  L85        PathProgramCache]: Analyzing trace with hash -1644441298, now seen corresponding path program 1 times
[2025-03-03 14:50:36,935 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:36,935 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739554499]
[2025-03-03 14:50:36,935 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:36,936 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:36,945 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-03 14:50:36,956 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-03 14:50:36,958 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:36,958 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:37,088 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 14:50:37,089 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:37,089 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739554499]
[2025-03-03 14:50:37,089 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739554499] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:37,089 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:37,089 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 14:50:37,089 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714532630]
[2025-03-03 14:50:37,089 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:37,090 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 14:50:37,090 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:37,091 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 14:50:37,091 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-03-03 14:50:37,092 INFO  L87              Difference]: Start difference. First operand 26451 states and 39474 transitions. Second operand  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:37,661 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:37,662 INFO  L93              Difference]: Finished difference Result 51809 states and 77833 transitions.
[2025-03-03 14:50:37,662 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 14:50:37,662 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 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 111
[2025-03-03 14:50:37,662 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:37,722 INFO  L225             Difference]: With dead ends: 51809
[2025-03-03 14:50:37,723 INFO  L226             Difference]: Without dead ends: 47327
[2025-03-03 14:50:37,734 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2025-03-03 14:50:37,735 INFO  L435           NwaCegarLoop]: 273 mSDtfsCounter, 1219 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:37,735 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 1672 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:50:37,758 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 47327 states.
[2025-03-03 14:50:38,291 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 47327 to 30835.
[2025-03-03 14:50:38,317 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30835 states, 30834 states have (on average 1.492443406629046) internal successors, (46018), 30834 states have internal predecessors, (46018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:38,354 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30835 states to 30835 states and 46018 transitions.
[2025-03-03 14:50:38,356 INFO  L78                 Accepts]: Start accepts. Automaton has 30835 states and 46018 transitions. Word has length 111
[2025-03-03 14:50:38,356 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:38,356 INFO  L471      AbstractCegarLoop]: Abstraction has 30835 states and 46018 transitions.
[2025-03-03 14:50:38,356 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:38,356 INFO  L276                IsEmpty]: Start isEmpty. Operand 30835 states and 46018 transitions.
[2025-03-03 14:50:38,362 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2025-03-03 14:50:38,362 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:38,362 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:50:38,362 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 14:50:38,363 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:38,363 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:38,364 INFO  L85        PathProgramCache]: Analyzing trace with hash -719853849, now seen corresponding path program 1 times
[2025-03-03 14:50:38,364 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:38,364 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035046494]
[2025-03-03 14:50:38,364 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:38,364 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:38,374 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes.
[2025-03-03 14:50:38,395 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements.
[2025-03-03 14:50:38,395 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:38,396 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:38,453 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:38,453 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:38,453 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035046494]
[2025-03-03 14:50:38,453 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035046494] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:38,453 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:38,453 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:50:38,454 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80835567]
[2025-03-03 14:50:38,454 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:38,454 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:50:38,454 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:38,454 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:50:38,455 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:38,455 INFO  L87              Difference]: Start difference. First operand 30835 states and 46018 transitions. Second operand  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:38,742 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:38,743 INFO  L93              Difference]: Finished difference Result 61623 states and 91988 transitions.
[2025-03-03 14:50:38,743 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:50:38,743 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 112
[2025-03-03 14:50:38,743 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:38,789 INFO  L225             Difference]: With dead ends: 61623
[2025-03-03 14:50:38,789 INFO  L226             Difference]: Without dead ends: 30837
[2025-03-03 14:50:38,818 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:38,818 INFO  L435           NwaCegarLoop]: 205 mSDtfsCounter, 79 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:38,819 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 353 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:38,835 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30837 states.
[2025-03-03 14:50:39,497 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30837 to 30835.
[2025-03-03 14:50:39,526 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30835 states, 30834 states have (on average 1.481546344943893) internal successors, (45682), 30834 states have internal predecessors, (45682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:39,570 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30835 states to 30835 states and 45682 transitions.
[2025-03-03 14:50:39,572 INFO  L78                 Accepts]: Start accepts. Automaton has 30835 states and 45682 transitions. Word has length 112
[2025-03-03 14:50:39,572 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:39,572 INFO  L471      AbstractCegarLoop]: Abstraction has 30835 states and 45682 transitions.
[2025-03-03 14:50:39,572 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:39,572 INFO  L276                IsEmpty]: Start isEmpty. Operand 30835 states and 45682 transitions.
[2025-03-03 14:50:39,576 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2025-03-03 14:50:39,577 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:39,577 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1]
[2025-03-03 14:50:39,577 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-03 14:50:39,577 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:39,577 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:39,577 INFO  L85        PathProgramCache]: Analyzing trace with hash -1019491462, now seen corresponding path program 1 times
[2025-03-03 14:50:39,577 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:39,578 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145436730]
[2025-03-03 14:50:39,578 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:39,578 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:39,591 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes.
[2025-03-03 14:50:39,605 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements.
[2025-03-03 14:50:39,605 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:39,605 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:39,675 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:39,675 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:39,675 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145436730]
[2025-03-03 14:50:39,675 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145436730] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:39,675 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:39,675 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:50:39,675 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028950272]
[2025-03-03 14:50:39,676 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:39,676 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:50:39,676 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:39,676 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:50:39,676 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:39,676 INFO  L87              Difference]: Start difference. First operand 30835 states and 45682 transitions. Second operand  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:39,938 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:39,939 INFO  L93              Difference]: Finished difference Result 46231 states and 68500 transitions.
[2025-03-03 14:50:39,939 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:50:39,940 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 112
[2025-03-03 14:50:39,940 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:39,961 INFO  L225             Difference]: With dead ends: 46231
[2025-03-03 14:50:39,962 INFO  L226             Difference]: Without dead ends: 15445
[2025-03-03 14:50:39,980 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:39,981 INFO  L435           NwaCegarLoop]: 196 mSDtfsCounter, 73 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:39,981 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 334 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:39,989 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15445 states.
[2025-03-03 14:50:40,319 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15445 to 15443.
[2025-03-03 14:50:40,333 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15443 states, 15442 states have (on average 1.4698873202952984) internal successors, (22698), 15442 states have internal predecessors, (22698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:40,494 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15443 states to 15443 states and 22698 transitions.
[2025-03-03 14:50:40,495 INFO  L78                 Accepts]: Start accepts. Automaton has 15443 states and 22698 transitions. Word has length 112
[2025-03-03 14:50:40,496 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:40,496 INFO  L471      AbstractCegarLoop]: Abstraction has 15443 states and 22698 transitions.
[2025-03-03 14:50:40,496 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:40,496 INFO  L276                IsEmpty]: Start isEmpty. Operand 15443 states and 22698 transitions.
[2025-03-03 14:50:40,498 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2025-03-03 14:50:40,498 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:40,498 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:50:40,498 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-03 14:50:40,498 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:40,499 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:40,499 INFO  L85        PathProgramCache]: Analyzing trace with hash -1638469235, now seen corresponding path program 1 times
[2025-03-03 14:50:40,499 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:40,499 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722587269]
[2025-03-03 14:50:40,499 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:40,499 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:40,507 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes.
[2025-03-03 14:50:40,521 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements.
[2025-03-03 14:50:40,522 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:40,522 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:41,245 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:41,245 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:41,245 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722587269]
[2025-03-03 14:50:41,245 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722587269] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 14:50:41,245 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877595056]
[2025-03-03 14:50:41,245 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:41,245 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:50:41,245 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:50:41,247 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 14:50:41,249 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 14:50:41,324 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes.
[2025-03-03 14:50:41,379 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements.
[2025-03-03 14:50:41,379 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:41,379 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:41,384 INFO  L256         TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 15 conjuncts are in the unsatisfiable core
[2025-03-03 14:50:41,390 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 14:50:41,953 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:41,953 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 14:50:43,062 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:43,063 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [877595056] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 14:50:43,063 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 14:50:43,063 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25
[2025-03-03 14:50:43,064 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781259459]
[2025-03-03 14:50:43,064 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 14:50:43,064 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2025-03-03 14:50:43,064 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:43,065 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2025-03-03 14:50:43,065 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650
[2025-03-03 14:50:43,065 INFO  L87              Difference]: Start difference. First operand 15443 states and 22698 transitions. Second operand  has 26 states, 26 states have (on average 11.423076923076923) internal successors, (297), 25 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:43,952 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:43,952 INFO  L93              Difference]: Finished difference Result 56281 states and 83017 transitions.
[2025-03-03 14:50:43,952 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2025-03-03 14:50:43,952 INFO  L78                 Accepts]: Start accepts. Automaton has  has 26 states, 26 states have (on average 11.423076923076923) internal successors, (297), 25 states have internal predecessors, (297), 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 112
[2025-03-03 14:50:43,953 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:43,997 INFO  L225             Difference]: With dead ends: 56281
[2025-03-03 14:50:43,998 INFO  L226             Difference]: Without dead ends: 40887
[2025-03-03 14:50:44,018 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=309, Invalid=1023, Unknown=0, NotChecked=0, Total=1332
[2025-03-03 14:50:44,019 INFO  L435           NwaCegarLoop]: 136 mSDtfsCounter, 1637 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1637 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:44,019 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1637 Valid, 1130 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 14:50:44,043 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 40887 states.
[2025-03-03 14:50:44,689 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 40887 to 39875.
[2025-03-03 14:50:44,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39875 states, 39874 states have (on average 1.4549330390730801) internal successors, (58014), 39874 states have internal predecessors, (58014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:44,771 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39875 states to 39875 states and 58014 transitions.
[2025-03-03 14:50:44,773 INFO  L78                 Accepts]: Start accepts. Automaton has 39875 states and 58014 transitions. Word has length 112
[2025-03-03 14:50:44,774 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:44,774 INFO  L471      AbstractCegarLoop]: Abstraction has 39875 states and 58014 transitions.
[2025-03-03 14:50:44,774 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 11.423076923076923) internal successors, (297), 25 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:44,774 INFO  L276                IsEmpty]: Start isEmpty. Operand 39875 states and 58014 transitions.
[2025-03-03 14:50:44,843 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2025-03-03 14:50:44,844 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:44,844 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:50:44,850 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 14:50:45,044 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:50:45,044 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:45,045 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:45,045 INFO  L85        PathProgramCache]: Analyzing trace with hash 1495815126, now seen corresponding path program 1 times
[2025-03-03 14:50:45,045 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:45,045 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523123482]
[2025-03-03 14:50:45,045 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:45,045 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:45,053 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes.
[2025-03-03 14:50:45,059 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements.
[2025-03-03 14:50:45,060 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:45,060 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:45,089 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:45,090 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:45,090 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523123482]
[2025-03-03 14:50:45,090 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523123482] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:50:45,090 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:50:45,090 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:50:45,090 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713658343]
[2025-03-03 14:50:45,090 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:50:45,090 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:50:45,090 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:45,091 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:50:45,091 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:45,091 INFO  L87              Difference]: Start difference. First operand 39875 states and 58014 transitions. Second operand  has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 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-03-03 14:50:45,759 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:50:45,759 INFO  L93              Difference]: Finished difference Result 112775 states and 163532 transitions.
[2025-03-03 14:50:45,759 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:50:45,760 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 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 113
[2025-03-03 14:50:45,760 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:50:45,840 INFO  L225             Difference]: With dead ends: 112775
[2025-03-03 14:50:45,840 INFO  L226             Difference]: Without dead ends: 72949
[2025-03-03 14:50:45,881 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:50:45,881 INFO  L435           NwaCegarLoop]: 197 mSDtfsCounter, 78 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:50:45,881 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 349 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:50:45,925 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 72949 states.
[2025-03-03 14:50:47,003 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 72949 to 72947.
[2025-03-03 14:50:47,060 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 72947 states, 72946 states have (on average 1.435664738299564) internal successors, (104726), 72946 states have internal predecessors, (104726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:50:47,149 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 72947 states to 72947 states and 104726 transitions.
[2025-03-03 14:50:47,153 INFO  L78                 Accepts]: Start accepts. Automaton has 72947 states and 104726 transitions. Word has length 113
[2025-03-03 14:50:47,153 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:50:47,153 INFO  L471      AbstractCegarLoop]: Abstraction has 72947 states and 104726 transitions.
[2025-03-03 14:50:47,154 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 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-03-03 14:50:47,154 INFO  L276                IsEmpty]: Start isEmpty. Operand 72947 states and 104726 transitions.
[2025-03-03 14:50:47,164 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2025-03-03 14:50:47,164 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:50:47,164 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:50:47,164 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-03 14:50:47,165 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:50:47,165 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:50:47,165 INFO  L85        PathProgramCache]: Analyzing trace with hash 709166332, now seen corresponding path program 1 times
[2025-03-03 14:50:47,166 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:50:47,166 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683908316]
[2025-03-03 14:50:47,166 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:47,166 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:50:47,177 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes.
[2025-03-03 14:50:47,195 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements.
[2025-03-03 14:50:47,196 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:47,196 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:47,984 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:47,985 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:50:47,985 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683908316]
[2025-03-03 14:50:47,985 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683908316] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 14:50:47,985 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139357824]
[2025-03-03 14:50:47,985 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:50:47,985 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:50:47,985 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:50:47,987 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 14:50:47,988 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-03 14:50:48,058 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes.
[2025-03-03 14:50:48,107 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements.
[2025-03-03 14:50:48,108 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:50:48,108 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:50:48,109 INFO  L256         TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 18 conjuncts are in the unsatisfiable core
[2025-03-03 14:50:48,113 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 14:50:48,894 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:48,894 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 14:50:49,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:50:49,505 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139357824] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 14:50:49,505 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 14:50:49,505 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 28
[2025-03-03 14:50:49,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82983742]
[2025-03-03 14:50:49,505 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 14:50:49,506 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2025-03-03 14:50:49,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:50:49,506 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2025-03-03 14:50:49,506 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756
[2025-03-03 14:50:49,506 INFO  L87              Difference]: Start difference. First operand 72947 states and 104726 transitions. Second operand  has 28 states, 28 states have (on average 11.714285714285714) internal successors, (328), 28 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:51:08,698 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:51:08,698 INFO  L93              Difference]: Finished difference Result 869192 states and 1233133 transitions.
[2025-03-03 14:51:08,698 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. 
[2025-03-03 14:51:08,699 INFO  L78                 Accepts]: Start accepts. Automaton has  has 28 states, 28 states have (on average 11.714285714285714) internal successors, (328), 28 states have internal predecessors, (328), 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 113
[2025-03-03 14:51:08,699 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:51:09,709 INFO  L225             Difference]: With dead ends: 869192
[2025-03-03 14:51:09,709 INFO  L226             Difference]: Without dead ends: 796294
[2025-03-03 14:51:10,110 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10175 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=4076, Invalid=22984, Unknown=0, NotChecked=0, Total=27060
[2025-03-03 14:51:10,111 INFO  L435           NwaCegarLoop]: 246 mSDtfsCounter, 20005 mSDsluCounter, 2974 mSDsCounter, 0 mSdLazyCounter, 2928 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20005 SdHoareTripleChecker+Valid, 3220 SdHoareTripleChecker+Invalid, 3234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 2928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:51:10,111 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [20005 Valid, 3220 Invalid, 3234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 2928 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-03-03 14:51:10,449 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 796294 states.