./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.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_opt-floodmax.3.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 a10c9e6583b7bb9620d063f223dce3a6f04929588e6f4ac23db6236ec494c7b2
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 14:53:31,391 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 14:53:31,443 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 14:53:31,450 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 14:53:31,450 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 14:53:31,470 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 14:53:31,471 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 14:53:31,471 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 14:53:31,472 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 14:53:31,472 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 14:53:31,473 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 14:53:31,473 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 14:53:31,473 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 14:53:31,473 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 14:53:31,474 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 14:53:31,474 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 14:53:31,474 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 14:53:31,474 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 14:53:31,474 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 14:53:31,474 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 14:53:31,474 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 14:53:31,475 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 14:53:31,475 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 14:53:31,475 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 14:53:31,475 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 14:53:31,475 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 14:53:31,475 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 14:53:31,475 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 14:53:31,475 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 14:53:31,475 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 14:53:31,475 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 14:53:31,475 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 14:53:31,475 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 14:53:31,476 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 14:53:31,476 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 14:53:31,476 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 14:53:31,476 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 14:53:31,476 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 14:53:31,476 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 14:53:31,476 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 14:53:31,477 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 14:53:31,477 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 14:53:31,477 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 14:53:31,477 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 -> a10c9e6583b7bb9620d063f223dce3a6f04929588e6f4ac23db6236ec494c7b2
[2025-03-03 14:53:31,697 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 14:53:31,705 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 14:53:31,707 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 14:53:31,708 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 14:53:31,708 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 14:53:31,709 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c
[2025-03-03 14:53:32,857 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528fdb7f5/50a5264f15954b94bed7425dcc913d78/FLAG7a3b8a35f
[2025-03-03 14:53:33,086 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 14:53:33,087 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c
[2025-03-03 14:53:33,098 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528fdb7f5/50a5264f15954b94bed7425dcc913d78/FLAG7a3b8a35f
[2025-03-03 14:53:33,422 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528fdb7f5/50a5264f15954b94bed7425dcc913d78
[2025-03-03 14:53:33,424 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 14:53:33,425 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 14:53:33,426 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 14:53:33,426 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 14:53:33,429 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 14:53:33,429 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:53:33" (1/1) ...
[2025-03-03 14:53:33,430 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf49350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:33, skipping insertion in model container
[2025-03-03 14:53:33,430 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:53:33" (1/1) ...
[2025-03-03 14:53:33,452 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 14:53:33,595 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_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c[14521,14534]
[2025-03-03 14:53:33,598 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 14:53:33,607 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 14:53:33,661 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_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c[14521,14534]
[2025-03-03 14:53:33,664 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 14:53:33,676 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 14:53:33,677 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:33 WrapperNode
[2025-03-03 14:53:33,677 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 14:53:33,678 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 14:53:33,678 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 14:53:33,678 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 14:53:33,683 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:53:33" (1/1) ...
[2025-03-03 14:53:33,689 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:53:33" (1/1) ...
[2025-03-03 14:53:33,713 INFO  L138                Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 495
[2025-03-03 14:53:33,713 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 14:53:33,714 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 14:53:33,714 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 14:53:33,714 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 14:53:33,720 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:33" (1/1) ...
[2025-03-03 14:53:33,720 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:33" (1/1) ...
[2025-03-03 14:53:33,723 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:33" (1/1) ...
[2025-03-03 14:53:33,738 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:53:33,739 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:33" (1/1) ...
[2025-03-03 14:53:33,739 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:33" (1/1) ...
[2025-03-03 14:53:33,745 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:33" (1/1) ...
[2025-03-03 14:53:33,746 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:33" (1/1) ...
[2025-03-03 14:53:33,748 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:33" (1/1) ...
[2025-03-03 14:53:33,757 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:33" (1/1) ...
[2025-03-03 14:53:33,761 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 14:53:33,762 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 14:53:33,763 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 14:53:33,763 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 14:53:33,764 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:33" (1/1) ...
[2025-03-03 14:53:33,769 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 14:53:33,779 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:53:33,792 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:53:33,795 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:53:33,816 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 14:53:33,816 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 14:53:33,816 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 14:53:33,816 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 14:53:33,902 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 14:53:33,904 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 14:53:34,291 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L601-1: main_#res#1 := 0;
[2025-03-03 14:53:34,316 INFO  L?                        ?]: Removed 48 outVars from TransFormulas that were not future-live.
[2025-03-03 14:53:34,316 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 14:53:34,324 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 14:53:34,325 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 14:53:34,325 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:53:34 BoogieIcfgContainer
[2025-03-03 14:53:34,325 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 14:53:34,327 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 14:53:34,327 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 14:53:34,331 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 14:53:34,331 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:53:33" (1/3) ...
[2025-03-03 14:53:34,331 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@def95d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:53:34, skipping insertion in model container
[2025-03-03 14:53:34,331 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:33" (2/3) ...
[2025-03-03 14:53:34,332 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@def95d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:53:34, skipping insertion in model container
[2025-03-03 14:53:34,332 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:53:34" (3/3) ...
[2025-03-03 14:53:34,333 INFO  L128   eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c
[2025-03-03 14:53:34,344 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 14:53:34,347 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c that has 1 procedures, 136 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 14:53:34,400 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 14:53:34,428 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;@5f09e3aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 14:53:34,429 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 14:53:34,434 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 136 states, 134 states have (on average 1.7686567164179106) internal successors, (237), 135 states have internal predecessors, (237), 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:53:34,439 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-03-03 14:53:34,440 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:34,440 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:53:34,441 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:34,445 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:34,446 INFO  L85        PathProgramCache]: Analyzing trace with hash 2133716070, now seen corresponding path program 1 times
[2025-03-03 14:53:34,451 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:34,452 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183768474]
[2025-03-03 14:53:34,452 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:34,454 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:34,516 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-03-03 14:53:34,591 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-03-03 14:53:34,592 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:34,592 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:34,703 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:53:34,703 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:34,704 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183768474]
[2025-03-03 14:53:34,705 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183768474] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:34,705 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:34,705 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 14:53:34,706 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605787747]
[2025-03-03 14:53:34,707 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:34,709 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-03 14:53:34,709 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:34,723 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-03 14:53:34,723 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 14:53:34,725 INFO  L87              Difference]: Start difference. First operand  has 136 states, 134 states have (on average 1.7686567164179106) internal successors, (237), 135 states have internal predecessors, (237), 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:53:34,740 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:34,741 INFO  L93              Difference]: Finished difference Result 210 states and 364 transitions.
[2025-03-03 14:53:34,742 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-03 14:53:34,742 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:53:34,743 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:53:34,747 INFO  L225             Difference]: With dead ends: 210
[2025-03-03 14:53:34,748 INFO  L226             Difference]: Without dead ends: 133
[2025-03-03 14:53:34,749 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:53:34,751 INFO  L435           NwaCegarLoop]: 232 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, 232 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:53:34,751 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:53:34,760 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2025-03-03 14:53:34,774 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133.
[2025-03-03 14:53:34,776 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 133 states, 132 states have (on average 1.7575757575757576) internal successors, (232), 132 states have internal predecessors, (232), 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:53:34,781 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 232 transitions.
[2025-03-03 14:53:34,783 INFO  L78                 Accepts]: Start accepts. Automaton has 133 states and 232 transitions. Word has length 37
[2025-03-03 14:53:34,783 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:53:34,783 INFO  L471      AbstractCegarLoop]: Abstraction has 133 states and 232 transitions.
[2025-03-03 14:53:34,784 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:53:34,784 INFO  L276                IsEmpty]: Start isEmpty. Operand 133 states and 232 transitions.
[2025-03-03 14:53:34,785 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-03-03 14:53:34,785 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:34,785 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:53:34,785 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 14:53:34,785 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:34,786 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:34,786 INFO  L85        PathProgramCache]: Analyzing trace with hash 1724891845, now seen corresponding path program 1 times
[2025-03-03 14:53:34,786 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:34,786 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630863966]
[2025-03-03 14:53:34,786 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:34,786 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:34,806 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-03-03 14:53:34,845 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-03-03 14:53:34,845 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:34,845 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:35,043 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:53:35,044 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:35,044 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630863966]
[2025-03-03 14:53:35,044 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630863966] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:35,044 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:35,044 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 14:53:35,044 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598438879]
[2025-03-03 14:53:35,045 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:35,045 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 14:53:35,046 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:35,046 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 14:53:35,047 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 14:53:35,047 INFO  L87              Difference]: Start difference. First operand 133 states and 232 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:53:35,137 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:35,139 INFO  L93              Difference]: Finished difference Result 210 states and 360 transitions.
[2025-03-03 14:53:35,139 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 14:53:35,139 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:53:35,140 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:53:35,140 INFO  L225             Difference]: With dead ends: 210
[2025-03-03 14:53:35,140 INFO  L226             Difference]: Without dead ends: 133
[2025-03-03 14:53:35,141 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:53:35,141 INFO  L435           NwaCegarLoop]: 230 mSDtfsCounter, 0 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:53:35,141 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 885 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:53:35,142 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2025-03-03 14:53:35,147 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133.
[2025-03-03 14:53:35,149 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 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:53:35,151 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 202 transitions.
[2025-03-03 14:53:35,153 INFO  L78                 Accepts]: Start accepts. Automaton has 133 states and 202 transitions. Word has length 37
[2025-03-03 14:53:35,153 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:53:35,153 INFO  L471      AbstractCegarLoop]: Abstraction has 133 states and 202 transitions.
[2025-03-03 14:53:35,153 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:53:35,153 INFO  L276                IsEmpty]: Start isEmpty. Operand 133 states and 202 transitions.
[2025-03-03 14:53:35,154 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-03-03 14:53:35,155 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:35,155 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:53:35,156 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 14:53:35,156 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:35,156 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:35,156 INFO  L85        PathProgramCache]: Analyzing trace with hash 211857297, now seen corresponding path program 1 times
[2025-03-03 14:53:35,156 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:35,157 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980494110]
[2025-03-03 14:53:35,157 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:35,157 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:35,169 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-03-03 14:53:35,182 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-03-03 14:53:35,182 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:35,182 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:35,272 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:53:35,272 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:35,272 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980494110]
[2025-03-03 14:53:35,272 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980494110] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:35,272 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:35,273 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:53:35,273 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296543565]
[2025-03-03 14:53:35,273 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:35,273 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:53:35,273 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:35,274 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:53:35,274 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:53:35,274 INFO  L87              Difference]: Start difference. First operand 133 states and 202 transitions. Second operand  has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:35,319 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:35,319 INFO  L93              Difference]: Finished difference Result 269 states and 432 transitions.
[2025-03-03 14:53:35,320 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:53:35,320 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66
[2025-03-03 14:53:35,320 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:53:35,321 INFO  L225             Difference]: With dead ends: 269
[2025-03-03 14:53:35,321 INFO  L226             Difference]: Without dead ends: 196
[2025-03-03 14:53:35,321 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:53:35,322 INFO  L435           NwaCegarLoop]: 195 mSDtfsCounter, 97 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:53:35,322 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 352 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:53:35,323 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 196 states.
[2025-03-03 14:53:35,334 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193.
[2025-03-03 14:53:35,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 193 states, 192 states have (on average 1.5625) internal successors, (300), 192 states have internal predecessors, (300), 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:53:35,335 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 300 transitions.
[2025-03-03 14:53:35,335 INFO  L78                 Accepts]: Start accepts. Automaton has 193 states and 300 transitions. Word has length 66
[2025-03-03 14:53:35,336 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:53:35,336 INFO  L471      AbstractCegarLoop]: Abstraction has 193 states and 300 transitions.
[2025-03-03 14:53:35,336 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:35,336 INFO  L276                IsEmpty]: Start isEmpty. Operand 193 states and 300 transitions.
[2025-03-03 14:53:35,339 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2025-03-03 14:53:35,339 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:35,339 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:53:35,339 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 14:53:35,339 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:35,339 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:35,339 INFO  L85        PathProgramCache]: Analyzing trace with hash -491433642, now seen corresponding path program 1 times
[2025-03-03 14:53:35,340 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:35,340 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031565371]
[2025-03-03 14:53:35,340 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:35,340 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:35,354 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes.
[2025-03-03 14:53:35,373 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements.
[2025-03-03 14:53:35,375 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:35,375 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:35,468 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:53:35,468 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:35,468 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031565371]
[2025-03-03 14:53:35,468 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031565371] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:35,468 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:35,468 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:53:35,468 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315025768]
[2025-03-03 14:53:35,468 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:35,469 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:53:35,469 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:35,470 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:53:35,470 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:53:35,470 INFO  L87              Difference]: Start difference. First operand 193 states and 300 transitions. Second operand  has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:35,499 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:35,500 INFO  L93              Difference]: Finished difference Result 443 states and 716 transitions.
[2025-03-03 14:53:35,500 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:53:35,500 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68
[2025-03-03 14:53:35,501 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:53:35,502 INFO  L225             Difference]: With dead ends: 443
[2025-03-03 14:53:35,502 INFO  L226             Difference]: Without dead ends: 310
[2025-03-03 14:53:35,502 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:53:35,503 INFO  L435           NwaCegarLoop]: 199 mSDtfsCounter, 99 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:53:35,503 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 365 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:53:35,504 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 310 states.
[2025-03-03 14:53:35,511 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 306.
[2025-03-03 14:53:35,511 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 306 states, 305 states have (on average 1.5967213114754097) internal successors, (487), 305 states have internal predecessors, (487), 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:53:35,512 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 487 transitions.
[2025-03-03 14:53:35,512 INFO  L78                 Accepts]: Start accepts. Automaton has 306 states and 487 transitions. Word has length 68
[2025-03-03 14:53:35,513 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:53:35,513 INFO  L471      AbstractCegarLoop]: Abstraction has 306 states and 487 transitions.
[2025-03-03 14:53:35,513 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:35,513 INFO  L276                IsEmpty]: Start isEmpty. Operand 306 states and 487 transitions.
[2025-03-03 14:53:35,514 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2025-03-03 14:53:35,514 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:35,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]
[2025-03-03 14:53:35,514 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 14:53:35,514 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:35,515 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:35,515 INFO  L85        PathProgramCache]: Analyzing trace with hash 209660699, now seen corresponding path program 1 times
[2025-03-03 14:53:35,515 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:35,515 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467011779]
[2025-03-03 14:53:35,515 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:35,515 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:35,528 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes.
[2025-03-03 14:53:35,537 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements.
[2025-03-03 14:53:35,537 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:35,537 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:35,612 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:53:35,612 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:35,612 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467011779]
[2025-03-03 14:53:35,612 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467011779] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:35,612 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:35,612 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:53:35,612 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853476592]
[2025-03-03 14:53:35,612 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:35,613 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:53:35,613 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:35,613 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:53:35,613 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:53:35,613 INFO  L87              Difference]: Start difference. First operand 306 states and 487 transitions. Second operand  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:35,644 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:35,644 INFO  L93              Difference]: Finished difference Result 766 states and 1249 transitions.
[2025-03-03 14:53:35,644 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:53:35,644 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70
[2025-03-03 14:53:35,644 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:53:35,646 INFO  L225             Difference]: With dead ends: 766
[2025-03-03 14:53:35,646 INFO  L226             Difference]: Without dead ends: 520
[2025-03-03 14:53:35,648 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:53:35,650 INFO  L435           NwaCegarLoop]: 199 mSDtfsCounter, 93 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:53:35,650 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 366 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:53:35,651 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 520 states.
[2025-03-03 14:53:35,662 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 514.
[2025-03-03 14:53:35,663 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 514 states, 513 states have (on average 1.612085769980507) internal successors, (827), 513 states have internal predecessors, (827), 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:53:35,665 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 827 transitions.
[2025-03-03 14:53:35,665 INFO  L78                 Accepts]: Start accepts. Automaton has 514 states and 827 transitions. Word has length 70
[2025-03-03 14:53:35,665 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:53:35,665 INFO  L471      AbstractCegarLoop]: Abstraction has 514 states and 827 transitions.
[2025-03-03 14:53:35,666 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:35,666 INFO  L276                IsEmpty]: Start isEmpty. Operand 514 states and 827 transitions.
[2025-03-03 14:53:35,667 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2025-03-03 14:53:35,667 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:35,667 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:53:35,667 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 14:53:35,668 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:35,668 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:35,668 INFO  L85        PathProgramCache]: Analyzing trace with hash 1957485792, now seen corresponding path program 1 times
[2025-03-03 14:53:35,668 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:35,669 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118242180]
[2025-03-03 14:53:35,669 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:35,669 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:35,684 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes.
[2025-03-03 14:53:35,693 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements.
[2025-03-03 14:53:35,693 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:35,693 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:35,782 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:53:35,782 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:35,782 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118242180]
[2025-03-03 14:53:35,782 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118242180] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:35,782 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:35,782 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 14:53:35,783 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902869738]
[2025-03-03 14:53:35,783 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:35,783 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 14:53:35,783 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:35,783 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 14:53:35,783 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 14:53:35,783 INFO  L87              Difference]: Start difference. First operand 514 states and 827 transitions. Second operand  has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:35,923 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:35,923 INFO  L93              Difference]: Finished difference Result 2190 states and 3633 transitions.
[2025-03-03 14:53:35,923 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 14:53:35,924 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72
[2025-03-03 14:53:35,924 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:53:35,931 INFO  L225             Difference]: With dead ends: 2190
[2025-03-03 14:53:35,931 INFO  L226             Difference]: Without dead ends: 1736
[2025-03-03 14:53:35,932 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-03-03 14:53:35,934 INFO  L435           NwaCegarLoop]: 198 mSDtfsCounter, 716 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:53:35,934 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1358 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:53:35,936 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1736 states.
[2025-03-03 14:53:35,963 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 912.
[2025-03-03 14:53:35,964 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 912 states, 911 states have (on average 1.628979143798024) internal successors, (1484), 911 states have internal predecessors, (1484), 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:53:35,968 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1484 transitions.
[2025-03-03 14:53:35,968 INFO  L78                 Accepts]: Start accepts. Automaton has 912 states and 1484 transitions. Word has length 72
[2025-03-03 14:53:35,969 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:53:35,969 INFO  L471      AbstractCegarLoop]: Abstraction has 912 states and 1484 transitions.
[2025-03-03 14:53:35,969 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:35,969 INFO  L276                IsEmpty]: Start isEmpty. Operand 912 states and 1484 transitions.
[2025-03-03 14:53:35,971 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2025-03-03 14:53:35,971 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:35,971 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:53:35,971 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 14:53:35,971 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:35,971 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:35,971 INFO  L85        PathProgramCache]: Analyzing trace with hash 603372605, now seen corresponding path program 1 times
[2025-03-03 14:53:35,971 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:35,972 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758615393]
[2025-03-03 14:53:35,972 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:35,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:35,984 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes.
[2025-03-03 14:53:35,995 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements.
[2025-03-03 14:53:35,996 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:35,996 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:36,069 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:53:36,069 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:36,069 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758615393]
[2025-03-03 14:53:36,069 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758615393] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:36,069 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:36,069 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 14:53:36,070 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802869098]
[2025-03-03 14:53:36,070 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:36,070 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 14:53:36,070 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:36,070 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 14:53:36,071 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 14:53:36,071 INFO  L87              Difference]: Start difference. First operand 912 states and 1484 transitions. Second operand  has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:36,148 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:36,149 INFO  L93              Difference]: Finished difference Result 2654 states and 4394 transitions.
[2025-03-03 14:53:36,149 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 14:53:36,149 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73
[2025-03-03 14:53:36,149 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:53:36,154 INFO  L225             Difference]: With dead ends: 2654
[2025-03-03 14:53:36,154 INFO  L226             Difference]: Without dead ends: 1802
[2025-03-03 14:53:36,155 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 14:53:36,157 INFO  L435           NwaCegarLoop]: 197 mSDtfsCounter, 357 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:53:36,158 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 654 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:53:36,159 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1802 states.
[2025-03-03 14:53:36,196 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1348.
[2025-03-03 14:53:36,198 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1348 states, 1347 states have (on average 1.6384558277654047) internal successors, (2207), 1347 states have internal predecessors, (2207), 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:53:36,202 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2207 transitions.
[2025-03-03 14:53:36,203 INFO  L78                 Accepts]: Start accepts. Automaton has 1348 states and 2207 transitions. Word has length 73
[2025-03-03 14:53:36,203 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:53:36,203 INFO  L471      AbstractCegarLoop]: Abstraction has 1348 states and 2207 transitions.
[2025-03-03 14:53:36,203 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:36,203 INFO  L276                IsEmpty]: Start isEmpty. Operand 1348 states and 2207 transitions.
[2025-03-03 14:53:36,206 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2025-03-03 14:53:36,206 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:36,206 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:53:36,206 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 14:53:36,207 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:36,207 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:36,207 INFO  L85        PathProgramCache]: Analyzing trace with hash 1573689726, now seen corresponding path program 1 times
[2025-03-03 14:53:36,207 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:36,207 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795826150]
[2025-03-03 14:53:36,207 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:36,207 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:36,217 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes.
[2025-03-03 14:53:36,225 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements.
[2025-03-03 14:53:36,225 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:36,225 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:36,289 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:53:36,289 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:36,289 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795826150]
[2025-03-03 14:53:36,289 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795826150] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:36,289 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:36,289 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 14:53:36,290 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146120156]
[2025-03-03 14:53:36,290 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:36,290 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 14:53:36,290 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:36,290 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 14:53:36,290 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 14:53:36,290 INFO  L87              Difference]: Start difference. First operand 1348 states and 2207 transitions. Second operand  has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:36,375 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:36,375 INFO  L93              Difference]: Finished difference Result 3908 states and 6458 transitions.
[2025-03-03 14:53:36,375 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 14:53:36,376 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74
[2025-03-03 14:53:36,376 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:53:36,387 INFO  L225             Difference]: With dead ends: 3908
[2025-03-03 14:53:36,387 INFO  L226             Difference]: Without dead ends: 2620
[2025-03-03 14:53:36,389 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 14:53:36,390 INFO  L435           NwaCegarLoop]: 193 mSDtfsCounter, 357 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:53:36,390 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 652 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:53:36,392 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2620 states.
[2025-03-03 14:53:36,445 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2620 to 1972.
[2025-03-03 14:53:36,448 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1972 states, 1971 states have (on average 1.637239979705733) internal successors, (3227), 1971 states have internal predecessors, (3227), 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:53:36,455 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 3227 transitions.
[2025-03-03 14:53:36,455 INFO  L78                 Accepts]: Start accepts. Automaton has 1972 states and 3227 transitions. Word has length 74
[2025-03-03 14:53:36,456 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:53:36,456 INFO  L471      AbstractCegarLoop]: Abstraction has 1972 states and 3227 transitions.
[2025-03-03 14:53:36,456 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:36,456 INFO  L276                IsEmpty]: Start isEmpty. Operand 1972 states and 3227 transitions.
[2025-03-03 14:53:36,457 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2025-03-03 14:53:36,457 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:36,458 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:53:36,458 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 14:53:36,458 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:36,458 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:36,458 INFO  L85        PathProgramCache]: Analyzing trace with hash 1586902363, now seen corresponding path program 1 times
[2025-03-03 14:53:36,458 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:36,458 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499343067]
[2025-03-03 14:53:36,459 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:36,459 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:36,470 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes.
[2025-03-03 14:53:36,480 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements.
[2025-03-03 14:53:36,480 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:36,480 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:36,536 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:53:36,536 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:36,536 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499343067]
[2025-03-03 14:53:36,536 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499343067] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:36,536 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:36,536 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 14:53:36,536 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686812219]
[2025-03-03 14:53:36,536 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:36,537 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 14:53:36,537 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:36,537 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 14:53:36,537 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 14:53:36,537 INFO  L87              Difference]: Start difference. First operand 1972 states and 3227 transitions. Second operand  has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:36,636 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:36,637 INFO  L93              Difference]: Finished difference Result 5692 states and 9382 transitions.
[2025-03-03 14:53:36,637 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 14:53:36,637 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75
[2025-03-03 14:53:36,637 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:53:36,648 INFO  L225             Difference]: With dead ends: 5692
[2025-03-03 14:53:36,648 INFO  L226             Difference]: Without dead ends: 3780
[2025-03-03 14:53:36,651 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 14:53:36,653 INFO  L435           NwaCegarLoop]: 193 mSDtfsCounter, 355 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:53:36,653 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 654 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:53:36,658 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3780 states.
[2025-03-03 14:53:36,719 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 2860.
[2025-03-03 14:53:36,723 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2860 states, 2859 states have (on average 1.634487583071004) internal successors, (4673), 2859 states have internal predecessors, (4673), 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:53:36,731 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 4673 transitions.
[2025-03-03 14:53:36,732 INFO  L78                 Accepts]: Start accepts. Automaton has 2860 states and 4673 transitions. Word has length 75
[2025-03-03 14:53:36,732 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:53:36,732 INFO  L471      AbstractCegarLoop]: Abstraction has 2860 states and 4673 transitions.
[2025-03-03 14:53:36,733 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:36,733 INFO  L276                IsEmpty]: Start isEmpty. Operand 2860 states and 4673 transitions.
[2025-03-03 14:53:36,735 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-03-03 14:53:36,735 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:36,735 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]
[2025-03-03 14:53:36,735 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 14:53:36,735 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:36,736 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:36,736 INFO  L85        PathProgramCache]: Analyzing trace with hash 1472660187, now seen corresponding path program 1 times
[2025-03-03 14:53:36,736 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:36,736 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048540131]
[2025-03-03 14:53:36,736 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:36,736 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:36,745 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-03-03 14:53:36,752 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-03-03 14:53:36,753 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:36,753 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:36,780 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:53:36,780 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:36,780 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048540131]
[2025-03-03 14:53:36,780 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048540131] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:36,780 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:36,780 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:53:36,780 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653110198]
[2025-03-03 14:53:36,781 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:36,781 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:53:36,781 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:36,781 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:53:36,781 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:53:36,782 INFO  L87              Difference]: Start difference. First operand 2860 states and 4673 transitions. Second operand  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:53:36,853 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:36,853 INFO  L93              Difference]: Finished difference Result 6485 states and 10687 transitions.
[2025-03-03 14:53:36,854 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:53:36,854 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76
[2025-03-03 14:53:36,854 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:53:36,868 INFO  L225             Difference]: With dead ends: 6485
[2025-03-03 14:53:36,868 INFO  L226             Difference]: Without dead ends: 4424
[2025-03-03 14:53:36,871 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:53:36,872 INFO  L435           NwaCegarLoop]: 285 mSDtfsCounter, 104 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 461 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:53:36,873 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 461 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:53:36,876 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4424 states.
[2025-03-03 14:53:36,959 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4424 to 4422.
[2025-03-03 14:53:36,965 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4422 states, 4421 states have (on average 1.6315313277539019) internal successors, (7213), 4421 states have internal predecessors, (7213), 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:53:36,976 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4422 states to 4422 states and 7213 transitions.
[2025-03-03 14:53:36,976 INFO  L78                 Accepts]: Start accepts. Automaton has 4422 states and 7213 transitions. Word has length 76
[2025-03-03 14:53:36,977 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:53:36,977 INFO  L471      AbstractCegarLoop]: Abstraction has 4422 states and 7213 transitions.
[2025-03-03 14:53:36,977 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:53:36,977 INFO  L276                IsEmpty]: Start isEmpty. Operand 4422 states and 7213 transitions.
[2025-03-03 14:53:36,978 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-03-03 14:53:36,978 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:36,978 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]
[2025-03-03 14:53:36,978 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 14:53:36,978 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:36,979 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:36,979 INFO  L85        PathProgramCache]: Analyzing trace with hash -1797122533, now seen corresponding path program 1 times
[2025-03-03 14:53:36,979 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:36,979 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187292185]
[2025-03-03 14:53:36,979 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:36,979 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:36,988 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-03-03 14:53:36,995 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-03-03 14:53:36,995 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:36,996 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:37,028 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:53:37,029 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:37,029 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187292185]
[2025-03-03 14:53:37,029 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187292185] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:37,029 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:37,029 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:53:37,029 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963555695]
[2025-03-03 14:53:37,030 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:37,030 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:53:37,030 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:37,031 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:53:37,031 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:53:37,031 INFO  L87              Difference]: Start difference. First operand 4422 states and 7213 transitions. Second operand  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:53:37,131 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:37,131 INFO  L93              Difference]: Finished difference Result 9899 states and 16167 transitions.
[2025-03-03 14:53:37,132 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:53:37,132 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76
[2025-03-03 14:53:37,132 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:53:37,152 INFO  L225             Difference]: With dead ends: 9899
[2025-03-03 14:53:37,152 INFO  L226             Difference]: Without dead ends: 6744
[2025-03-03 14:53:37,156 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:53:37,156 INFO  L435           NwaCegarLoop]: 281 mSDtfsCounter, 98 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 458 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:53:37,157 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 458 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:53:37,161 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6744 states.
[2025-03-03 14:53:37,266 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6744 to 6742.
[2025-03-03 14:53:37,277 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6742 states, 6741 states have (on average 1.6181575433911883) internal successors, (10908), 6741 states have internal predecessors, (10908), 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:53:37,299 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6742 states to 6742 states and 10908 transitions.
[2025-03-03 14:53:37,300 INFO  L78                 Accepts]: Start accepts. Automaton has 6742 states and 10908 transitions. Word has length 76
[2025-03-03 14:53:37,300 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:53:37,300 INFO  L471      AbstractCegarLoop]: Abstraction has 6742 states and 10908 transitions.
[2025-03-03 14:53:37,301 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:53:37,301 INFO  L276                IsEmpty]: Start isEmpty. Operand 6742 states and 10908 transitions.
[2025-03-03 14:53:37,301 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-03-03 14:53:37,301 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:37,301 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]
[2025-03-03 14:53:37,301 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 14:53:37,301 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:37,302 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:37,302 INFO  L85        PathProgramCache]: Analyzing trace with hash 1000118619, now seen corresponding path program 1 times
[2025-03-03 14:53:37,302 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:37,302 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131035974]
[2025-03-03 14:53:37,302 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:37,302 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:37,312 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-03-03 14:53:37,344 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-03-03 14:53:37,345 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:37,345 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:37,381 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:53:37,381 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:37,381 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131035974]
[2025-03-03 14:53:37,381 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131035974] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:37,381 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:37,381 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:53:37,382 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611321275]
[2025-03-03 14:53:37,382 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:37,382 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:53:37,382 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:37,382 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:53:37,382 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:53:37,383 INFO  L87              Difference]: Start difference. First operand 6742 states and 10908 transitions. Second operand  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:53:37,514 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:37,514 INFO  L93              Difference]: Finished difference Result 15008 states and 24288 transitions.
[2025-03-03 14:53:37,514 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:53:37,515 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76
[2025-03-03 14:53:37,515 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:53:37,547 INFO  L225             Difference]: With dead ends: 15008
[2025-03-03 14:53:37,547 INFO  L226             Difference]: Without dead ends: 10171
[2025-03-03 14:53:37,556 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:53:37,557 INFO  L435           NwaCegarLoop]: 269 mSDtfsCounter, 92 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 447 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:53:37,557 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 447 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:53:37,567 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10171 states.
[2025-03-03 14:53:37,828 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10171 to 10169.
[2025-03-03 14:53:37,849 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10169 states, 10168 states have (on average 1.6009047993705743) internal successors, (16278), 10168 states have internal predecessors, (16278), 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:53:37,872 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10169 states to 10169 states and 16278 transitions.
[2025-03-03 14:53:37,873 INFO  L78                 Accepts]: Start accepts. Automaton has 10169 states and 16278 transitions. Word has length 76
[2025-03-03 14:53:37,873 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:53:37,873 INFO  L471      AbstractCegarLoop]: Abstraction has 10169 states and 16278 transitions.
[2025-03-03 14:53:37,873 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:53:37,874 INFO  L276                IsEmpty]: Start isEmpty. Operand 10169 states and 16278 transitions.
[2025-03-03 14:53:37,874 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-03-03 14:53:37,874 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:37,874 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:53:37,874 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 14:53:37,875 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:37,875 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:37,875 INFO  L85        PathProgramCache]: Analyzing trace with hash 1747983993, now seen corresponding path program 1 times
[2025-03-03 14:53:37,875 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:37,875 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483390740]
[2025-03-03 14:53:37,875 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:37,875 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:37,886 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-03-03 14:53:37,897 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-03-03 14:53:37,897 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:37,897 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:38,061 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:53:38,061 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:38,061 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483390740]
[2025-03-03 14:53:38,061 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483390740] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:38,061 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:38,061 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 14:53:38,062 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873618227]
[2025-03-03 14:53:38,062 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:38,062 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 14:53:38,062 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:38,063 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 14:53:38,063 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 14:53:38,063 INFO  L87              Difference]: Start difference. First operand 10169 states and 16278 transitions. Second operand  has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:38,273 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:38,273 INFO  L93              Difference]: Finished difference Result 20262 states and 32453 transitions.
[2025-03-03 14:53:38,274 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 14:53:38,274 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77
[2025-03-03 14:53:38,274 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:53:38,291 INFO  L225             Difference]: With dead ends: 20262
[2025-03-03 14:53:38,291 INFO  L226             Difference]: Without dead ends: 10171
[2025-03-03 14:53:38,299 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-03-03 14:53:38,300 INFO  L435           NwaCegarLoop]: 200 mSDtfsCounter, 189 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:53:38,300 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 538 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:53:38,308 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10171 states.
[2025-03-03 14:53:38,516 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10171 to 10169.
[2025-03-03 14:53:38,532 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10169 states, 10168 states have (on average 1.5886113296616837) internal successors, (16153), 10168 states have internal predecessors, (16153), 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:53:38,548 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10169 states to 10169 states and 16153 transitions.
[2025-03-03 14:53:38,549 INFO  L78                 Accepts]: Start accepts. Automaton has 10169 states and 16153 transitions. Word has length 77
[2025-03-03 14:53:38,549 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:53:38,549 INFO  L471      AbstractCegarLoop]: Abstraction has 10169 states and 16153 transitions.
[2025-03-03 14:53:38,549 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:38,550 INFO  L276                IsEmpty]: Start isEmpty. Operand 10169 states and 16153 transitions.
[2025-03-03 14:53:38,550 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2025-03-03 14:53:38,550 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:38,551 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:53:38,551 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 14:53:38,551 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:38,551 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:38,551 INFO  L85        PathProgramCache]: Analyzing trace with hash -620948521, now seen corresponding path program 1 times
[2025-03-03 14:53:38,551 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:38,551 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152389385]
[2025-03-03 14:53:38,551 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:38,551 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:38,561 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes.
[2025-03-03 14:53:38,575 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements.
[2025-03-03 14:53:38,575 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:38,575 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:38,705 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:53:38,705 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:38,705 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152389385]
[2025-03-03 14:53:38,705 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152389385] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:38,705 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:38,706 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 14:53:38,706 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386249519]
[2025-03-03 14:53:38,706 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:38,706 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 14:53:38,706 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:38,706 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 14:53:38,706 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 14:53:38,706 INFO  L87              Difference]: Start difference. First operand 10169 states and 16153 transitions. Second operand  has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:39,008 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:39,009 INFO  L93              Difference]: Finished difference Result 29138 states and 46435 transitions.
[2025-03-03 14:53:39,009 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 14:53:39,009 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80
[2025-03-03 14:53:39,009 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:53:39,044 INFO  L225             Difference]: With dead ends: 29138
[2025-03-03 14:53:39,045 INFO  L226             Difference]: Without dead ends: 19047
[2025-03-03 14:53:39,061 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-03-03 14:53:39,061 INFO  L435           NwaCegarLoop]: 192 mSDtfsCounter, 93 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:53:39,061 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 714 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:53:39,081 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19047 states.
[2025-03-03 14:53:39,405 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19047 to 19045.
[2025-03-03 14:53:39,494 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19045 states, 19044 states have (on average 1.5750892669607226) internal successors, (29996), 19044 states have internal predecessors, (29996), 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:53:39,520 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19045 states to 19045 states and 29996 transitions.
[2025-03-03 14:53:39,522 INFO  L78                 Accepts]: Start accepts. Automaton has 19045 states and 29996 transitions. Word has length 80
[2025-03-03 14:53:39,522 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:53:39,522 INFO  L471      AbstractCegarLoop]: Abstraction has 19045 states and 29996 transitions.
[2025-03-03 14:53:39,523 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:39,523 INFO  L276                IsEmpty]: Start isEmpty. Operand 19045 states and 29996 transitions.
[2025-03-03 14:53:39,523 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2025-03-03 14:53:39,523 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:39,523 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:53:39,523 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 14:53:39,524 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:39,524 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:39,524 INFO  L85        PathProgramCache]: Analyzing trace with hash -2037150190, now seen corresponding path program 1 times
[2025-03-03 14:53:39,524 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:39,524 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426071620]
[2025-03-03 14:53:39,524 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:39,524 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:39,532 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes.
[2025-03-03 14:53:39,555 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements.
[2025-03-03 14:53:39,555 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:39,555 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:39,713 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:53:39,713 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:39,713 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426071620]
[2025-03-03 14:53:39,713 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426071620] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:39,713 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:39,714 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 14:53:39,714 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663749705]
[2025-03-03 14:53:39,714 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:39,714 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 14:53:39,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:39,714 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 14:53:39,714 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 14:53:39,714 INFO  L87              Difference]: Start difference. First operand 19045 states and 29996 transitions. Second operand  has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 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:53:39,845 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:39,846 INFO  L93              Difference]: Finished difference Result 20133 states and 31445 transitions.
[2025-03-03 14:53:39,846 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 14:53:39,846 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 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:53:39,846 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:53:39,881 INFO  L225             Difference]: With dead ends: 20133
[2025-03-03 14:53:39,882 INFO  L226             Difference]: Without dead ends: 20131
[2025-03-03 14:53:39,889 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:53:39,890 INFO  L435           NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:53:39,890 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 782 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:53:39,902 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20131 states.
[2025-03-03 14:53:40,158 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20131 to 20131.
[2025-03-03 14:53:40,179 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20131 states, 20130 states have (on average 1.5436164927968206) internal successors, (31073), 20130 states have internal predecessors, (31073), 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:53:40,206 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20131 states to 20131 states and 31073 transitions.
[2025-03-03 14:53:40,207 INFO  L78                 Accepts]: Start accepts. Automaton has 20131 states and 31073 transitions. Word has length 81
[2025-03-03 14:53:40,207 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:53:40,207 INFO  L471      AbstractCegarLoop]: Abstraction has 20131 states and 31073 transitions.
[2025-03-03 14:53:40,207 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 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:53:40,207 INFO  L276                IsEmpty]: Start isEmpty. Operand 20131 states and 31073 transitions.
[2025-03-03 14:53:40,209 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-03-03 14:53:40,209 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:40,209 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]
[2025-03-03 14:53:40,209 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-03 14:53:40,209 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:40,209 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:40,209 INFO  L85        PathProgramCache]: Analyzing trace with hash -2106157709, now seen corresponding path program 1 times
[2025-03-03 14:53:40,209 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:40,209 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865023887]
[2025-03-03 14:53:40,209 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:40,210 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:40,220 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-03-03 14:53:40,230 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-03-03 14:53:40,230 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:40,231 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:40,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-03-03 14:53:40,332 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:40,332 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865023887]
[2025-03-03 14:53:40,332 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865023887] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:40,332 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:40,332 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 14:53:40,332 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273199106]
[2025-03-03 14:53:40,332 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:40,332 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 14:53:40,332 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:40,332 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 14:53:40,332 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 14:53:40,333 INFO  L87              Difference]: Start difference. First operand 20131 states and 31073 transitions. Second operand  has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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:53:40,667 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:40,667 INFO  L93              Difference]: Finished difference Result 49659 states and 76963 transitions.
[2025-03-03 14:53:40,668 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 14:53:40,668 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109
[2025-03-03 14:53:40,668 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:53:40,746 INFO  L225             Difference]: With dead ends: 49659
[2025-03-03 14:53:40,746 INFO  L226             Difference]: Without dead ends: 39817
[2025-03-03 14:53:40,767 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-03 14:53:40,768 INFO  L435           NwaCegarLoop]: 310 mSDtfsCounter, 450 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:53:40,768 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 876 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:53:40,803 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39817 states.
[2025-03-03 14:53:41,400 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39817 to 31027.
[2025-03-03 14:53:41,432 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31027 states, 31026 states have (on average 1.5411912589441115) internal successors, (47817), 31026 states have internal predecessors, (47817), 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:53:41,481 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31027 states to 31027 states and 47817 transitions.
[2025-03-03 14:53:41,484 INFO  L78                 Accepts]: Start accepts. Automaton has 31027 states and 47817 transitions. Word has length 109
[2025-03-03 14:53:41,485 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:53:41,485 INFO  L471      AbstractCegarLoop]: Abstraction has 31027 states and 47817 transitions.
[2025-03-03 14:53:41,485 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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:53:41,485 INFO  L276                IsEmpty]: Start isEmpty. Operand 31027 states and 47817 transitions.
[2025-03-03 14:53:41,487 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-03-03 14:53:41,487 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:41,487 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]
[2025-03-03 14:53:41,487 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 14:53:41,487 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:41,488 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:41,488 INFO  L85        PathProgramCache]: Analyzing trace with hash -1080973133, now seen corresponding path program 1 times
[2025-03-03 14:53:41,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:41,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766171446]
[2025-03-03 14:53:41,489 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:41,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:41,500 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-03-03 14:53:41,514 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-03-03 14:53:41,515 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:41,515 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:41,638 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-03-03 14:53:41,638 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:41,638 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766171446]
[2025-03-03 14:53:41,638 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766171446] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:41,638 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:41,638 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 14:53:41,638 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241777607]
[2025-03-03 14:53:41,638 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:41,639 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 14:53:41,639 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:41,639 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 14:53:41,639 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 14:53:41,639 INFO  L87              Difference]: Start difference. First operand 31027 states and 47817 transitions. Second operand  has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:53:42,244 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:42,244 INFO  L93              Difference]: Finished difference Result 55735 states and 86393 transitions.
[2025-03-03 14:53:42,244 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 14:53:42,245 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109
[2025-03-03 14:53:42,245 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:53:42,327 INFO  L225             Difference]: With dead ends: 55735
[2025-03-03 14:53:42,327 INFO  L226             Difference]: Without dead ends: 46153
[2025-03-03 14:53:42,339 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-03 14:53:42,340 INFO  L435           NwaCegarLoop]: 316 mSDtfsCounter, 443 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:53:42,341 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 931 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:53:42,365 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 46153 states.
[2025-03-03 14:53:42,934 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 46153 to 42179.
[2025-03-03 14:53:42,976 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 42179 states, 42178 states have (on average 1.542960785243492) internal successors, (65079), 42178 states have internal predecessors, (65079), 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:53:43,034 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42179 states to 42179 states and 65079 transitions.
[2025-03-03 14:53:43,036 INFO  L78                 Accepts]: Start accepts. Automaton has 42179 states and 65079 transitions. Word has length 109
[2025-03-03 14:53:43,037 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:53:43,037 INFO  L471      AbstractCegarLoop]: Abstraction has 42179 states and 65079 transitions.
[2025-03-03 14:53:43,037 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:53:43,037 INFO  L276                IsEmpty]: Start isEmpty. Operand 42179 states and 65079 transitions.
[2025-03-03 14:53:43,038 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-03-03 14:53:43,038 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:43,039 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]
[2025-03-03 14:53:43,039 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-03 14:53:43,039 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:43,039 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:43,039 INFO  L85        PathProgramCache]: Analyzing trace with hash 1716268019, now seen corresponding path program 1 times
[2025-03-03 14:53:43,039 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:43,040 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929821750]
[2025-03-03 14:53:43,040 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:43,040 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:43,050 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-03-03 14:53:43,059 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-03-03 14:53:43,060 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:43,060 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:43,146 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-03-03 14:53:43,146 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:43,146 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929821750]
[2025-03-03 14:53:43,146 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929821750] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:43,146 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:43,146 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 14:53:43,146 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118420883]
[2025-03-03 14:53:43,146 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:43,147 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 14:53:43,147 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:43,147 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 14:53:43,147 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 14:53:43,147 INFO  L87              Difference]: Start difference. First operand 42179 states and 65079 transitions. Second operand  has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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:53:43,586 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:43,586 INFO  L93              Difference]: Finished difference Result 59599 states and 92385 transitions.
[2025-03-03 14:53:43,587 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 14:53:43,587 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109
[2025-03-03 14:53:43,587 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:53:43,698 INFO  L225             Difference]: With dead ends: 59599
[2025-03-03 14:53:43,698 INFO  L226             Difference]: Without dead ends: 50017
[2025-03-03 14:53:43,721 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-03 14:53:43,722 INFO  L435           NwaCegarLoop]: 317 mSDtfsCounter, 456 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:53:43,722 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 882 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:53:43,757 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 50017 states.
[2025-03-03 14:53:44,520 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 50017 to 48411.
[2025-03-03 14:53:44,563 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 48411 states, 48410 states have (on average 1.5449493906217724) internal successors, (74791), 48410 states have internal predecessors, (74791), 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:53:44,642 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48411 states to 48411 states and 74791 transitions.
[2025-03-03 14:53:44,645 INFO  L78                 Accepts]: Start accepts. Automaton has 48411 states and 74791 transitions. Word has length 109
[2025-03-03 14:53:44,645 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:53:44,645 INFO  L471      AbstractCegarLoop]: Abstraction has 48411 states and 74791 transitions.
[2025-03-03 14:53:44,645 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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:53:44,645 INFO  L276                IsEmpty]: Start isEmpty. Operand 48411 states and 74791 transitions.
[2025-03-03 14:53:44,647 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2025-03-03 14:53:44,647 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:44,647 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:53:44,647 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-03 14:53:44,648 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:44,648 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:44,648 INFO  L85        PathProgramCache]: Analyzing trace with hash -815524342, now seen corresponding path program 1 times
[2025-03-03 14:53:44,648 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:44,648 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301660965]
[2025-03-03 14:53:44,648 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:44,648 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:44,659 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes.
[2025-03-03 14:53:44,669 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements.
[2025-03-03 14:53:44,669 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:44,670 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:44,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-03-03 14:53:44,752 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:44,752 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301660965]
[2025-03-03 14:53:44,752 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301660965] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:44,752 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:44,752 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 14:53:44,752 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491162919]
[2025-03-03 14:53:44,752 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:44,752 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 14:53:44,752 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:44,753 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 14:53:44,753 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 14:53:44,753 INFO  L87              Difference]: Start difference. First operand 48411 states and 74791 transitions. Second operand  has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:45,487 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:45,488 INFO  L93              Difference]: Finished difference Result 79154 states and 122950 transitions.
[2025-03-03 14:53:45,488 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 14:53:45,488 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110
[2025-03-03 14:53:45,488 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:53:45,604 INFO  L225             Difference]: With dead ends: 79154
[2025-03-03 14:53:45,604 INFO  L226             Difference]: Without dead ends: 62976
[2025-03-03 14:53:45,620 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 14:53:45,621 INFO  L435           NwaCegarLoop]: 305 mSDtfsCounter, 196 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:53:45,621 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 607 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:53:45,658 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 62976 states.
[2025-03-03 14:53:46,394 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 62976 to 61372.
[2025-03-03 14:53:46,448 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 61372 states, 61371 states have (on average 1.5451434716722883) internal successors, (94827), 61371 states have internal predecessors, (94827), 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:53:46,535 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 61372 states to 61372 states and 94827 transitions.
[2025-03-03 14:53:46,537 INFO  L78                 Accepts]: Start accepts. Automaton has 61372 states and 94827 transitions. Word has length 110
[2025-03-03 14:53:46,538 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:53:46,538 INFO  L471      AbstractCegarLoop]: Abstraction has 61372 states and 94827 transitions.
[2025-03-03 14:53:46,538 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:46,538 INFO  L276                IsEmpty]: Start isEmpty. Operand 61372 states and 94827 transitions.
[2025-03-03 14:53:46,539 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2025-03-03 14:53:46,540 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:46,540 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:53:46,540 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-03 14:53:46,540 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:46,540 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:46,540 INFO  L85        PathProgramCache]: Analyzing trace with hash -604173429, now seen corresponding path program 1 times
[2025-03-03 14:53:46,540 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:46,541 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297451108]
[2025-03-03 14:53:46,541 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:46,541 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:46,548 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes.
[2025-03-03 14:53:46,556 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements.
[2025-03-03 14:53:46,557 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:46,557 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:46,593 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-03-03 14:53:46,593 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:46,593 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297451108]
[2025-03-03 14:53:46,593 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297451108] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:46,593 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:46,593 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:53:46,593 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344377508]
[2025-03-03 14:53:46,593 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:46,594 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:53:46,594 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:46,594 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:53:46,594 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:53:46,594 INFO  L87              Difference]: Start difference. First operand 61372 states and 94827 transitions. Second operand  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:47,620 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:47,620 INFO  L93              Difference]: Finished difference Result 132988 states and 206196 transitions.
[2025-03-03 14:53:47,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:53:47,621 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110
[2025-03-03 14:53:47,621 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:53:47,809 INFO  L225             Difference]: With dead ends: 132988
[2025-03-03 14:53:47,809 INFO  L226             Difference]: Without dead ends: 103954
[2025-03-03 14:53:47,846 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:53:47,847 INFO  L435           NwaCegarLoop]: 201 mSDtfsCounter, 81 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:53:47,848 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 371 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:53:47,922 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 103954 states.
[2025-03-03 14:53:49,305 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 103954 to 103676.
[2025-03-03 14:53:49,394 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 103676 states, 103675 states have (on average 1.5447986496262358) internal successors, (160157), 103675 states have internal predecessors, (160157), 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:53:49,563 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 103676 states to 103676 states and 160157 transitions.
[2025-03-03 14:53:49,568 INFO  L78                 Accepts]: Start accepts. Automaton has 103676 states and 160157 transitions. Word has length 110
[2025-03-03 14:53:49,568 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:53:49,568 INFO  L471      AbstractCegarLoop]: Abstraction has 103676 states and 160157 transitions.
[2025-03-03 14:53:49,569 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:53:49,569 INFO  L276                IsEmpty]: Start isEmpty. Operand 103676 states and 160157 transitions.
[2025-03-03 14:53:49,571 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-03-03 14:53:49,571 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:49,571 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:53:49,571 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-03 14:53:49,571 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:49,572 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:49,572 INFO  L85        PathProgramCache]: Analyzing trace with hash -464026232, now seen corresponding path program 1 times
[2025-03-03 14:53:49,572 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:49,572 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792704864]
[2025-03-03 14:53:49,572 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:49,572 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:49,580 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-03 14:53:49,589 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-03 14:53:49,589 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:49,589 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:49,621 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:53:49,622 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:49,622 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792704864]
[2025-03-03 14:53:49,622 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792704864] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:49,622 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:49,622 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:53:49,622 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128990233]
[2025-03-03 14:53:49,622 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:49,622 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:53:49,622 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:49,623 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:53:49,623 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:53:49,623 INFO  L87              Difference]: Start difference. First operand 103676 states and 160157 transitions. Second operand  has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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:53:51,780 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:51,780 INFO  L93              Difference]: Finished difference Result 308726 states and 475922 transitions.
[2025-03-03 14:53:51,781 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:53:51,781 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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:53:51,781 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:53:52,154 INFO  L225             Difference]: With dead ends: 308726
[2025-03-03 14:53:52,155 INFO  L226             Difference]: Without dead ends: 205122
[2025-03-03 14:53:52,242 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:53:52,243 INFO  L435           NwaCegarLoop]: 258 mSDtfsCounter, 132 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:53:52,243 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 452 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:53:52,390 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 205122 states.
[2025-03-03 14:53:55,318 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 205122 to 205120.
[2025-03-03 14:53:55,467 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 205120 states, 205119 states have (on average 1.5291123689175552) internal successors, (313650), 205119 states have internal predecessors, (313650), 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:53:55,824 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 205120 states to 205120 states and 313650 transitions.
[2025-03-03 14:53:55,834 INFO  L78                 Accepts]: Start accepts. Automaton has 205120 states and 313650 transitions. Word has length 111
[2025-03-03 14:53:55,834 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:53:55,834 INFO  L471      AbstractCegarLoop]: Abstraction has 205120 states and 313650 transitions.
[2025-03-03 14:53:55,834 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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:53:55,834 INFO  L276                IsEmpty]: Start isEmpty. Operand 205120 states and 313650 transitions.
[2025-03-03 14:53:55,838 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-03-03 14:53:55,838 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:53:55,838 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:53:55,838 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-03 14:53:55,838 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:53:55,838 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:53:55,838 INFO  L85        PathProgramCache]: Analyzing trace with hash -372534776, now seen corresponding path program 1 times
[2025-03-03 14:53:55,838 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:53:55,838 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860014967]
[2025-03-03 14:53:55,838 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:53:55,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:53:56,116 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-03 14:53:56,125 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-03 14:53:56,125 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:53:56,125 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:53:56,158 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:53:56,159 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:53:56,159 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860014967]
[2025-03-03 14:53:56,159 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860014967] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:53:56,159 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:53:56,159 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:53:56,159 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289872529]
[2025-03-03 14:53:56,159 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:53:56,160 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:53:56,160 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:53:56,160 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:53:56,160 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:53:56,160 INFO  L87              Difference]: Start difference. First operand 205120 states and 313650 transitions. Second operand  has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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:53:59,991 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:53:59,991 INFO  L93              Difference]: Finished difference Result 610797 states and 931927 transitions.
[2025-03-03 14:53:59,992 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:53:59,992 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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:53:59,992 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:54:01,070 INFO  L225             Difference]: With dead ends: 610797
[2025-03-03 14:54:01,070 INFO  L226             Difference]: Without dead ends: 405811
[2025-03-03 14:54:01,231 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:54:01,232 INFO  L435           NwaCegarLoop]: 284 mSDtfsCounter, 151 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:54:01,232 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 478 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:54:01,488 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 405811 states.
[2025-03-03 14:54:07,484 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 405811 to 405809.
[2025-03-03 14:54:07,791 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 405809 states, 405808 states have (on average 1.513102255253716) internal successors, (614029), 405808 states have internal predecessors, (614029), 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:54:08,948 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 405809 states to 405809 states and 614029 transitions.
[2025-03-03 14:54:08,964 INFO  L78                 Accepts]: Start accepts. Automaton has 405809 states and 614029 transitions. Word has length 111
[2025-03-03 14:54:08,964 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:54:08,964 INFO  L471      AbstractCegarLoop]: Abstraction has 405809 states and 614029 transitions.
[2025-03-03 14:54:08,964 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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:54:08,964 INFO  L276                IsEmpty]: Start isEmpty. Operand 405809 states and 614029 transitions.
[2025-03-03 14:54:08,968 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-03-03 14:54:08,969 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:54:08,969 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:54:08,969 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-03-03 14:54:08,969 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:54:08,969 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:54:08,969 INFO  L85        PathProgramCache]: Analyzing trace with hash -2102543215, now seen corresponding path program 1 times
[2025-03-03 14:54:08,970 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:54:08,970 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687795747]
[2025-03-03 14:54:08,970 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:54:08,970 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:54:08,977 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-03 14:54:08,983 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-03 14:54:08,984 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:54:08,984 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:54:09,033 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-03-03 14:54:09,033 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:54:09,033 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687795747]
[2025-03-03 14:54:09,033 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687795747] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:54:09,033 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:54:09,033 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 14:54:09,034 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573517152]
[2025-03-03 14:54:09,034 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:54:09,034 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 14:54:09,034 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:54:09,034 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 14:54:09,034 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 14:54:09,034 INFO  L87              Difference]: Start difference. First operand 405809 states and 614029 transitions. Second operand  has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 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)