./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label58.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label58.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 58e74a4dd86a124eeee2194e768898c8688a10c1933d2ce8d825a1d945ebd262
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 01:49:53,619 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 01:49:53,674 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 01:49:53,677 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 01:49:53,678 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 01:49:53,691 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 01:49:53,691 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 01:49:53,691 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 01:49:53,692 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 01:49:53,692 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 01:49:53,692 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 01:49:53,692 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 01:49:53,692 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 01:49:53,692 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 01:49:53,692 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 01:49:53,692 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 01:49:53,692 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 01:49:53,692 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 01:49:53,696 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 01:49:53,696 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 01:49:53,696 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 01:49:53,696 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 01:49:53,696 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 01:49:53,696 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 01:49:53,697 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 01:49:53,697 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 01:49:53,697 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 01:49:53,697 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 01:49:53,697 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 01:49:53,697 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 01:49:53,697 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 01:49:53,697 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 01:49:53,698 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 01:49:53,698 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 01:49:53,698 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 01:49:53,698 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 01:49:53,698 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 01:49:53,698 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 01:49:53,698 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 01:49:53,698 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 01:49:53,698 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 01:49:53,698 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 01:49:53,698 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 01:49:53,698 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 -> 58e74a4dd86a124eeee2194e768898c8688a10c1933d2ce8d825a1d945ebd262
[2025-03-08 01:49:53,919 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 01:49:53,927 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 01:49:53,928 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 01:49:53,929 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 01:49:53,929 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 01:49:53,930 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label58.c
[2025-03-08 01:49:55,098 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f81647340/aa161c9b18dc4bcc93c8d5f87d1f01fa/FLAG5ad998574
[2025-03-08 01:49:55,591 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 01:49:55,592 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label58.c
[2025-03-08 01:49:55,620 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f81647340/aa161c9b18dc4bcc93c8d5f87d1f01fa/FLAG5ad998574
[2025-03-08 01:49:55,672 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f81647340/aa161c9b18dc4bcc93c8d5f87d1f01fa
[2025-03-08 01:49:55,674 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 01:49:55,676 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 01:49:55,678 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 01:49:55,678 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 01:49:55,681 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 01:49:55,682 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:49:55" (1/1) ...
[2025-03-08 01:49:55,683 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ef33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:49:55, skipping insertion in model container
[2025-03-08 01:49:55,683 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:49:55" (1/1) ...
[2025-03-08 01:49:55,745 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 01:49:55,924 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/eca-rers2012/Problem12_label58.c[4474,4487]
[2025-03-08 01:49:56,386 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 01:49:56,401 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 01:49:56,419 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/eca-rers2012/Problem12_label58.c[4474,4487]
[2025-03-08 01:49:56,653 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 01:49:56,670 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 01:49:56,671 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:49:56 WrapperNode
[2025-03-08 01:49:56,671 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 01:49:56,673 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 01:49:56,673 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 01:49:56,673 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 01:49:56,678 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:49:56" (1/1) ...
[2025-03-08 01:49:56,719 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:49:56" (1/1) ...
[2025-03-08 01:49:57,007 INFO  L138                Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758
[2025-03-08 01:49:57,007 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 01:49:57,008 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 01:49:57,008 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 01:49:57,008 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 01:49:57,015 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:49:56" (1/1) ...
[2025-03-08 01:49:57,016 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:49:56" (1/1) ...
[2025-03-08 01:49:57,062 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:49:56" (1/1) ...
[2025-03-08 01:49:57,243 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-08 01:49:57,243 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:49:56" (1/1) ...
[2025-03-08 01:49:57,244 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:49:56" (1/1) ...
[2025-03-08 01:49:57,363 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:49:56" (1/1) ...
[2025-03-08 01:49:57,374 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:49:56" (1/1) ...
[2025-03-08 01:49:57,396 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:49:56" (1/1) ...
[2025-03-08 01:49:57,412 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:49:56" (1/1) ...
[2025-03-08 01:49:57,474 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 01:49:57,476 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 01:49:57,476 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 01:49:57,476 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 01:49:57,477 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:49:56" (1/1) ...
[2025-03-08 01:49:57,481 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 01:49:57,490 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:49:57,501 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 01:49:57,504 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 01:49:57,521 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 01:49:57,521 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 01:49:57,521 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 01:49:57,521 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 01:49:57,574 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 01:49:57,575 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 01:50:00,907 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1;
[2025-03-08 01:50:00,907 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1;
[2025-03-08 01:50:00,908 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1;
[2025-03-08 01:50:01,079 INFO  L?                        ?]: Removed 702 outVars from TransFormulas that were not future-live.
[2025-03-08 01:50:01,079 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 01:50:01,110 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 01:50:01,114 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 01:50:01,115 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:50:01 BoogieIcfgContainer
[2025-03-08 01:50:01,115 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 01:50:01,116 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 01:50:01,117 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 01:50:01,120 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 01:50:01,121 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:49:55" (1/3) ...
[2025-03-08 01:50:01,122 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395fdf4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:50:01, skipping insertion in model container
[2025-03-08 01:50:01,122 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:49:56" (2/3) ...
[2025-03-08 01:50:01,122 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395fdf4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:50:01, skipping insertion in model container
[2025-03-08 01:50:01,122 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:50:01" (3/3) ...
[2025-03-08 01:50:01,123 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem12_label58.c
[2025-03-08 01:50:01,136 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 01:50:01,137 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label58.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 01:50:01,210 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 01:50:01,219 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;@13695c5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 01:50:01,219 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 01:50:01,225 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 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-08 01:50:01,230 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2025-03-08 01:50:01,230 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:50:01,231 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]
[2025-03-08 01:50:01,231 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:50:01,235 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:50:01,236 INFO  L85        PathProgramCache]: Analyzing trace with hash 1794177268, now seen corresponding path program 1 times
[2025-03-08 01:50:01,241 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:50:01,242 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474874061]
[2025-03-08 01:50:01,242 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:50:01,243 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:50:01,301 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes.
[2025-03-08 01:50:01,336 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements.
[2025-03-08 01:50:01,337 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:50:01,337 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:50:01,478 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-08 01:50:01,478 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:50:01,479 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474874061]
[2025-03-08 01:50:01,479 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474874061] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:50:01,479 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:50:01,479 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:50:01,480 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897470809]
[2025-03-08 01:50:01,481 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:50:01,483 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:50:01,483 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:50:01,494 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:50:01,494 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:01,497 INFO  L87              Difference]: Start difference. First operand  has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 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 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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-08 01:50:04,565 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:50:04,565 INFO  L93              Difference]: Finished difference Result 2404 states and 4642 transitions.
[2025-03-08 01:50:04,566 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:50:04,567 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34
[2025-03-08 01:50:04,567 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:50:04,580 INFO  L225             Difference]: With dead ends: 2404
[2025-03-08 01:50:04,580 INFO  L226             Difference]: Without dead ends: 1506
[2025-03-08 01:50:04,585 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:04,587 INFO  L435           NwaCegarLoop]: 515 mSDtfsCounter, 786 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2025-03-08 01:50:04,588 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 525 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2025-03-08 01:50:04,600 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1506 states.
[2025-03-08 01:50:04,667 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506.
[2025-03-08 01:50:04,670 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1506 states, 1505 states have (on average 1.6066445182724252) internal successors, (2418), 1505 states have internal predecessors, (2418), 0 states have call successors, (0), 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-08 01:50:04,679 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2418 transitions.
[2025-03-08 01:50:04,682 INFO  L78                 Accepts]: Start accepts. Automaton has 1506 states and 2418 transitions. Word has length 34
[2025-03-08 01:50:04,682 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:50:04,682 INFO  L471      AbstractCegarLoop]: Abstraction has 1506 states and 2418 transitions.
[2025-03-08 01:50:04,682 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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-08 01:50:04,683 INFO  L276                IsEmpty]: Start isEmpty. Operand 1506 states and 2418 transitions.
[2025-03-08 01:50:04,685 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-03-08 01:50:04,685 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:50:04,685 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 01:50:04,685 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-08 01:50:04,686 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:50:04,687 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:50:04,687 INFO  L85        PathProgramCache]: Analyzing trace with hash 2129554318, now seen corresponding path program 1 times
[2025-03-08 01:50:04,688 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:50:04,688 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985037399]
[2025-03-08 01:50:04,688 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:50:04,688 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:50:04,708 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-03-08 01:50:04,743 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-03-08 01:50:04,743 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:50:04,743 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:50:04,904 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:50:04,905 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:50:04,905 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985037399]
[2025-03-08 01:50:04,905 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985037399] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:50:04,905 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:50:04,905 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:50:04,905 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189532620]
[2025-03-08 01:50:04,905 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:50:04,906 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:50:04,906 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:50:04,906 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:50:04,906 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:04,907 INFO  L87              Difference]: Start difference. First operand 1506 states and 2418 transitions. Second operand  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 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-08 01:50:07,527 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:50:07,527 INFO  L93              Difference]: Finished difference Result 4514 states and 7250 transitions.
[2025-03-08 01:50:07,527 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:50:07,528 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109
[2025-03-08 01:50:07,528 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:50:07,538 INFO  L225             Difference]: With dead ends: 4514
[2025-03-08 01:50:07,538 INFO  L226             Difference]: Without dead ends: 3010
[2025-03-08 01:50:07,542 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:07,543 INFO  L435           NwaCegarLoop]: 576 mSDtfsCounter, 916 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-03-08 01:50:07,544 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 583 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-03-08 01:50:07,547 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3010 states.
[2025-03-08 01:50:07,584 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 3008.
[2025-03-08 01:50:07,589 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3008 states, 3007 states have (on average 1.4595942800133024) internal successors, (4389), 3007 states have internal predecessors, (4389), 0 states have call successors, (0), 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-08 01:50:07,595 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4389 transitions.
[2025-03-08 01:50:07,595 INFO  L78                 Accepts]: Start accepts. Automaton has 3008 states and 4389 transitions. Word has length 109
[2025-03-08 01:50:07,595 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:50:07,595 INFO  L471      AbstractCegarLoop]: Abstraction has 3008 states and 4389 transitions.
[2025-03-08 01:50:07,595 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 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-08 01:50:07,596 INFO  L276                IsEmpty]: Start isEmpty. Operand 3008 states and 4389 transitions.
[2025-03-08 01:50:07,598 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2025-03-08 01:50:07,598 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:50:07,598 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:50:07,598 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 01:50:07,598 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:50:07,599 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:50:07,599 INFO  L85        PathProgramCache]: Analyzing trace with hash 387058192, now seen corresponding path program 1 times
[2025-03-08 01:50:07,599 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:50:07,599 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763941736]
[2025-03-08 01:50:07,599 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:50:07,599 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:50:07,621 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes.
[2025-03-08 01:50:07,644 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements.
[2025-03-08 01:50:07,644 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:50:07,644 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:50:07,808 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:50:07,809 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:50:07,809 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763941736]
[2025-03-08 01:50:07,809 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763941736] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:50:07,809 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:50:07,809 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:50:07,809 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603405564]
[2025-03-08 01:50:07,809 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:50:07,810 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:50:07,810 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:50:07,811 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:50:07,811 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:07,811 INFO  L87              Difference]: Start difference. First operand 3008 states and 4389 transitions. Second operand  has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 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-08 01:50:09,972 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:50:09,973 INFO  L93              Difference]: Finished difference Result 9018 states and 13162 transitions.
[2025-03-08 01:50:09,974 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:50:09,974 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 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 138
[2025-03-08 01:50:09,974 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:50:09,993 INFO  L225             Difference]: With dead ends: 9018
[2025-03-08 01:50:09,993 INFO  L226             Difference]: Without dead ends: 6012
[2025-03-08 01:50:09,997 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:09,999 INFO  L435           NwaCegarLoop]: 441 mSDtfsCounter, 745 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-03-08 01:50:10,000 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 447 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-03-08 01:50:10,006 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6012 states.
[2025-03-08 01:50:10,072 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 6012.
[2025-03-08 01:50:10,080 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6012 states, 6011 states have (on average 1.2951256030610547) internal successors, (7785), 6011 states have internal predecessors, (7785), 0 states have call successors, (0), 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-08 01:50:10,090 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 7785 transitions.
[2025-03-08 01:50:10,090 INFO  L78                 Accepts]: Start accepts. Automaton has 6012 states and 7785 transitions. Word has length 138
[2025-03-08 01:50:10,090 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:50:10,090 INFO  L471      AbstractCegarLoop]: Abstraction has 6012 states and 7785 transitions.
[2025-03-08 01:50:10,091 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 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-08 01:50:10,091 INFO  L276                IsEmpty]: Start isEmpty. Operand 6012 states and 7785 transitions.
[2025-03-08 01:50:10,092 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 176
[2025-03-08 01:50:10,092 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:50:10,092 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:50:10,092 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 01:50:10,093 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:50:10,093 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:50:10,093 INFO  L85        PathProgramCache]: Analyzing trace with hash 958211305, now seen corresponding path program 1 times
[2025-03-08 01:50:10,093 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:50:10,093 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066855584]
[2025-03-08 01:50:10,093 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:50:10,093 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:50:10,110 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes.
[2025-03-08 01:50:10,129 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements.
[2025-03-08 01:50:10,130 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:50:10,130 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:50:10,432 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2025-03-08 01:50:10,433 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:50:10,433 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066855584]
[2025-03-08 01:50:10,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066855584] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 01:50:10,433 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40160944]
[2025-03-08 01:50:10,433 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:50:10,433 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:50:10,434 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:50:10,436 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 01:50:10,437 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-08 01:50:10,478 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes.
[2025-03-08 01:50:10,508 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements.
[2025-03-08 01:50:10,508 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:50:10,508 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:50:10,510 INFO  L256         TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 01:50:10,514 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 01:50:10,696 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2025-03-08 01:50:10,696 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 01:50:10,696 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [40160944] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:50:10,696 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 01:50:10,696 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-03-08 01:50:10,698 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471317798]
[2025-03-08 01:50:10,698 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:50:10,698 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:50:10,698 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:50:10,698 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:50:10,698 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 01:50:10,699 INFO  L87              Difference]: Start difference. First operand 6012 states and 7785 transitions. Second operand  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 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-08 01:50:13,031 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:50:13,031 INFO  L93              Difference]: Finished difference Result 18030 states and 23350 transitions.
[2025-03-08 01:50:13,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:50:13,032 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 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 175
[2025-03-08 01:50:13,032 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:50:13,064 INFO  L225             Difference]: With dead ends: 18030
[2025-03-08 01:50:13,065 INFO  L226             Difference]: Without dead ends: 12020
[2025-03-08 01:50:13,073 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 01:50:13,075 INFO  L435           NwaCegarLoop]: 655 mSDtfsCounter, 623 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 585 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 3037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 585 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-03-08 01:50:13,076 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 662 Invalid, 3037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [585 Valid, 2452 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-03-08 01:50:13,087 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12020 states.
[2025-03-08 01:50:13,236 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12020 to 11269.
[2025-03-08 01:50:13,250 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11269 states, 11268 states have (on average 1.2277245296414625) internal successors, (13834), 11268 states have internal predecessors, (13834), 0 states have call successors, (0), 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-08 01:50:13,269 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 13834 transitions.
[2025-03-08 01:50:13,269 INFO  L78                 Accepts]: Start accepts. Automaton has 11269 states and 13834 transitions. Word has length 175
[2025-03-08 01:50:13,270 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:50:13,270 INFO  L471      AbstractCegarLoop]: Abstraction has 11269 states and 13834 transitions.
[2025-03-08 01:50:13,270 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 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-08 01:50:13,270 INFO  L276                IsEmpty]: Start isEmpty. Operand 11269 states and 13834 transitions.
[2025-03-08 01:50:13,271 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 179
[2025-03-08 01:50:13,273 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:50:13,274 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:50:13,281 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-08 01:50:13,476 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:50:13,477 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:50:13,477 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:50:13,477 INFO  L85        PathProgramCache]: Analyzing trace with hash -1931537108, now seen corresponding path program 1 times
[2025-03-08 01:50:13,477 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:50:13,477 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751847172]
[2025-03-08 01:50:13,477 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:50:13,478 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:50:13,492 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes.
[2025-03-08 01:50:13,512 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements.
[2025-03-08 01:50:13,512 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:50:13,512 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:50:13,919 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:50:13,919 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:50:13,919 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751847172]
[2025-03-08 01:50:13,919 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751847172] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:50:13,920 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:50:13,920 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 01:50:13,920 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214127378]
[2025-03-08 01:50:13,920 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:50:13,920 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 01:50:13,920 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:50:13,921 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 01:50:13,921 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 01:50:13,921 INFO  L87              Difference]: Start difference. First operand 11269 states and 13834 transitions. Second operand  has 5 states, 5 states have (on average 35.6) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 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-08 01:50:18,096 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:50:18,096 INFO  L93              Difference]: Finished difference Result 29295 states and 35079 transitions.
[2025-03-08 01:50:18,097 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 01:50:18,097 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 35.6) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 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 178
[2025-03-08 01:50:18,097 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:50:18,125 INFO  L225             Difference]: With dead ends: 29295
[2025-03-08 01:50:18,125 INFO  L226             Difference]: Without dead ends: 18028
[2025-03-08 01:50:18,129 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-08 01:50:18,130 INFO  L435           NwaCegarLoop]: 694 mSDtfsCounter, 3431 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5369 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3431 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 5528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 5369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time
[2025-03-08 01:50:18,130 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3431 Valid, 720 Invalid, 5528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 5369 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time]
[2025-03-08 01:50:18,138 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18028 states.
[2025-03-08 01:50:18,251 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18028 to 16526.
[2025-03-08 01:50:18,279 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16526 states, 16525 states have (on average 1.1745234493192134) internal successors, (19409), 16525 states have internal predecessors, (19409), 0 states have call successors, (0), 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-08 01:50:18,298 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16526 states to 16526 states and 19409 transitions.
[2025-03-08 01:50:18,300 INFO  L78                 Accepts]: Start accepts. Automaton has 16526 states and 19409 transitions. Word has length 178
[2025-03-08 01:50:18,300 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:50:18,301 INFO  L471      AbstractCegarLoop]: Abstraction has 16526 states and 19409 transitions.
[2025-03-08 01:50:18,301 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 35.6) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 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-08 01:50:18,301 INFO  L276                IsEmpty]: Start isEmpty. Operand 16526 states and 19409 transitions.
[2025-03-08 01:50:18,303 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 247
[2025-03-08 01:50:18,303 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:50:18,304 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:50:18,304 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 01:50:18,306 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:50:18,306 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:50:18,306 INFO  L85        PathProgramCache]: Analyzing trace with hash -1761048061, now seen corresponding path program 1 times
[2025-03-08 01:50:18,306 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:50:18,306 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504472454]
[2025-03-08 01:50:18,306 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:50:18,306 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:50:18,324 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes.
[2025-03-08 01:50:18,338 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements.
[2025-03-08 01:50:18,338 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:50:18,338 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:50:18,432 INFO  L134       CoverageAnalysis]: Checked inductivity of 133 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked.
[2025-03-08 01:50:18,432 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:50:18,432 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504472454]
[2025-03-08 01:50:18,432 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504472454] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:50:18,433 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:50:18,433 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:50:18,433 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767459071]
[2025-03-08 01:50:18,433 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:50:18,433 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:50:18,433 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:50:18,434 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:50:18,434 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:18,434 INFO  L87              Difference]: Start difference. First operand 16526 states and 19409 transitions. Second operand  has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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-08 01:50:20,937 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:50:20,937 INFO  L93              Difference]: Finished difference Result 39058 states and 46760 transitions.
[2025-03-08 01:50:20,937 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:50:20,937 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 246
[2025-03-08 01:50:20,937 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:50:20,974 INFO  L225             Difference]: With dead ends: 39058
[2025-03-08 01:50:20,974 INFO  L226             Difference]: Without dead ends: 22534
[2025-03-08 01:50:20,990 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:20,991 INFO  L435           NwaCegarLoop]: 683 mSDtfsCounter, 721 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 2990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-03-08 01:50:20,991 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 690 Invalid, 2990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-03-08 01:50:21,009 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22534 states.
[2025-03-08 01:50:21,215 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22534 to 16526.
[2025-03-08 01:50:21,253 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16526 states, 16525 states have (on average 1.1745234493192134) internal successors, (19409), 16525 states have internal predecessors, (19409), 0 states have call successors, (0), 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-08 01:50:21,269 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16526 states to 16526 states and 19409 transitions.
[2025-03-08 01:50:21,270 INFO  L78                 Accepts]: Start accepts. Automaton has 16526 states and 19409 transitions. Word has length 246
[2025-03-08 01:50:21,270 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:50:21,270 INFO  L471      AbstractCegarLoop]: Abstraction has 16526 states and 19409 transitions.
[2025-03-08 01:50:21,271 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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-08 01:50:21,271 INFO  L276                IsEmpty]: Start isEmpty. Operand 16526 states and 19409 transitions.
[2025-03-08 01:50:21,272 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 250
[2025-03-08 01:50:21,273 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:50:21,273 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:50:21,273 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 01:50:21,273 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:50:21,273 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:50:21,273 INFO  L85        PathProgramCache]: Analyzing trace with hash -436072496, now seen corresponding path program 1 times
[2025-03-08 01:50:21,273 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:50:21,274 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035474821]
[2025-03-08 01:50:21,274 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:50:21,274 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:50:21,309 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes.
[2025-03-08 01:50:21,319 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements.
[2025-03-08 01:50:21,319 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:50:21,319 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:50:21,630 INFO  L134       CoverageAnalysis]: Checked inductivity of 133 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:50:21,630 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:50:21,631 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035474821]
[2025-03-08 01:50:21,631 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035474821] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:50:21,631 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:50:21,631 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:50:21,631 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841523985]
[2025-03-08 01:50:21,631 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:50:21,631 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 01:50:21,631 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:50:21,632 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 01:50:21,632 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 01:50:21,632 INFO  L87              Difference]: Start difference. First operand 16526 states and 19409 transitions. Second operand  has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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-08 01:50:23,885 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:50:23,885 INFO  L93              Difference]: Finished difference Result 37593 states and 43653 transitions.
[2025-03-08 01:50:23,888 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 01:50:23,888 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 249
[2025-03-08 01:50:23,888 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:50:23,924 INFO  L225             Difference]: With dead ends: 37593
[2025-03-08 01:50:23,924 INFO  L226             Difference]: Without dead ends: 21032
[2025-03-08 01:50:23,940 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 01:50:23,941 INFO  L435           NwaCegarLoop]: 694 mSDtfsCounter, 702 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-03-08 01:50:23,942 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 708 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-03-08 01:50:23,959 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21032 states.
[2025-03-08 01:50:24,132 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21032 to 21032.
[2025-03-08 01:50:24,152 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21032 states, 21031 states have (on average 1.140554419666207) internal successors, (23987), 21031 states have internal predecessors, (23987), 0 states have call successors, (0), 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-08 01:50:24,262 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21032 states to 21032 states and 23987 transitions.
[2025-03-08 01:50:24,263 INFO  L78                 Accepts]: Start accepts. Automaton has 21032 states and 23987 transitions. Word has length 249
[2025-03-08 01:50:24,263 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:50:24,263 INFO  L471      AbstractCegarLoop]: Abstraction has 21032 states and 23987 transitions.
[2025-03-08 01:50:24,263 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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-08 01:50:24,264 INFO  L276                IsEmpty]: Start isEmpty. Operand 21032 states and 23987 transitions.
[2025-03-08 01:50:24,266 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 261
[2025-03-08 01:50:24,268 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:50:24,268 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 01:50:24,268 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 01:50:24,269 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:50:24,269 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:50:24,269 INFO  L85        PathProgramCache]: Analyzing trace with hash -965329760, now seen corresponding path program 1 times
[2025-03-08 01:50:24,269 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:50:24,269 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763660280]
[2025-03-08 01:50:24,269 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:50:24,270 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:50:24,286 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes.
[2025-03-08 01:50:24,296 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements.
[2025-03-08 01:50:24,296 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:50:24,297 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:50:24,384 INFO  L134       CoverageAnalysis]: Checked inductivity of 147 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:50:24,384 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:50:24,384 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763660280]
[2025-03-08 01:50:24,384 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763660280] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:50:24,384 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:50:24,384 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:50:24,384 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459933666]
[2025-03-08 01:50:24,384 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:50:24,385 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:50:24,385 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:50:24,385 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:50:24,385 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:24,385 INFO  L87              Difference]: Start difference. First operand 21032 states and 23987 transitions. Second operand  has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 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-08 01:50:26,939 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:50:26,939 INFO  L93              Difference]: Finished difference Result 60086 states and 68807 transitions.
[2025-03-08 01:50:26,940 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:50:26,940 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 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 260
[2025-03-08 01:50:26,940 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:50:26,981 INFO  L225             Difference]: With dead ends: 60086
[2025-03-08 01:50:26,982 INFO  L226             Difference]: Without dead ends: 39056
[2025-03-08 01:50:26,997 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:26,998 INFO  L435           NwaCegarLoop]: 1383 mSDtfsCounter, 668 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2739 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 3104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 2739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-03-08 01:50:26,998 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1390 Invalid, 3104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 2739 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-03-08 01:50:27,021 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39056 states.
[2025-03-08 01:50:27,285 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39056 to 36052.
[2025-03-08 01:50:27,316 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 36052 states, 36051 states have (on average 1.1352805747413386) internal successors, (40928), 36051 states have internal predecessors, (40928), 0 states have call successors, (0), 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-08 01:50:27,356 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36052 states to 36052 states and 40928 transitions.
[2025-03-08 01:50:27,356 INFO  L78                 Accepts]: Start accepts. Automaton has 36052 states and 40928 transitions. Word has length 260
[2025-03-08 01:50:27,357 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:50:27,357 INFO  L471      AbstractCegarLoop]: Abstraction has 36052 states and 40928 transitions.
[2025-03-08 01:50:27,357 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 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-08 01:50:27,357 INFO  L276                IsEmpty]: Start isEmpty. Operand 36052 states and 40928 transitions.
[2025-03-08 01:50:27,360 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 265
[2025-03-08 01:50:27,360 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:50:27,361 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 01:50:27,361 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 01:50:27,361 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:50:27,362 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:50:27,362 INFO  L85        PathProgramCache]: Analyzing trace with hash 65546858, now seen corresponding path program 1 times
[2025-03-08 01:50:27,362 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:50:27,362 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466539148]
[2025-03-08 01:50:27,362 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:50:27,362 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:50:27,386 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes.
[2025-03-08 01:50:27,403 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements.
[2025-03-08 01:50:27,403 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:50:27,403 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:50:27,507 INFO  L134       CoverageAnalysis]: Checked inductivity of 147 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-03-08 01:50:27,508 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:50:27,508 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466539148]
[2025-03-08 01:50:27,508 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466539148] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:50:27,508 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:50:27,508 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:50:27,508 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199026738]
[2025-03-08 01:50:27,508 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:50:27,509 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:50:27,509 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:50:27,509 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:50:27,509 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:27,509 INFO  L87              Difference]: Start difference. First operand 36052 states and 40928 transitions. Second operand  has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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-08 01:50:30,174 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:50:30,174 INFO  L93              Difference]: Finished difference Result 84118 states and 96936 transitions.
[2025-03-08 01:50:30,174 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:50:30,175 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 264
[2025-03-08 01:50:30,175 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:50:30,225 INFO  L225             Difference]: With dead ends: 84118
[2025-03-08 01:50:30,226 INFO  L226             Difference]: Without dead ends: 48068
[2025-03-08 01:50:30,251 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:30,253 INFO  L435           NwaCegarLoop]: 453 mSDtfsCounter, 755 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2272 mSolverCounterSat, 694 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 2966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 694 IncrementalHoareTripleChecker+Valid, 2272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-03-08 01:50:30,255 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 460 Invalid, 2966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [694 Valid, 2272 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-03-08 01:50:30,291 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48068 states.
[2025-03-08 01:50:30,622 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48068 to 46566.
[2025-03-08 01:50:30,653 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 46566 states, 46565 states have (on average 1.1438634167293031) internal successors, (53264), 46565 states have internal predecessors, (53264), 0 states have call successors, (0), 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-08 01:50:30,690 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 46566 states to 46566 states and 53264 transitions.
[2025-03-08 01:50:30,691 INFO  L78                 Accepts]: Start accepts. Automaton has 46566 states and 53264 transitions. Word has length 264
[2025-03-08 01:50:30,691 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:50:30,691 INFO  L471      AbstractCegarLoop]: Abstraction has 46566 states and 53264 transitions.
[2025-03-08 01:50:30,691 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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-08 01:50:30,691 INFO  L276                IsEmpty]: Start isEmpty. Operand 46566 states and 53264 transitions.
[2025-03-08 01:50:30,693 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 297
[2025-03-08 01:50:30,693 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:50:30,693 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 01:50:30,693 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 01:50:30,693 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:50:30,693 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:50:30,694 INFO  L85        PathProgramCache]: Analyzing trace with hash 167843354, now seen corresponding path program 1 times
[2025-03-08 01:50:30,694 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:50:30,694 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13574002]
[2025-03-08 01:50:30,694 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:50:30,694 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:50:30,720 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes.
[2025-03-08 01:50:30,733 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements.
[2025-03-08 01:50:30,734 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:50:30,734 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:50:30,845 INFO  L134       CoverageAnalysis]: Checked inductivity of 179 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked.
[2025-03-08 01:50:30,846 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:50:30,846 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13574002]
[2025-03-08 01:50:30,847 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13574002] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:50:30,847 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:50:30,847 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:50:30,847 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807886905]
[2025-03-08 01:50:30,847 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:50:30,847 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:50:30,847 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:50:30,848 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:50:30,848 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:30,848 INFO  L87              Difference]: Start difference. First operand 46566 states and 53264 transitions. Second operand  has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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-08 01:50:33,421 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:50:33,422 INFO  L93              Difference]: Finished difference Result 112656 states and 130539 transitions.
[2025-03-08 01:50:33,422 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:50:33,422 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 296
[2025-03-08 01:50:33,423 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:50:33,488 INFO  L225             Difference]: With dead ends: 112656
[2025-03-08 01:50:33,488 INFO  L226             Difference]: Without dead ends: 66092
[2025-03-08 01:50:33,506 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:33,507 INFO  L435           NwaCegarLoop]: 1385 mSDtfsCounter, 722 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 2877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-03-08 01:50:33,507 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1393 Invalid, 2877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-03-08 01:50:33,546 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 66092 states.
[2025-03-08 01:50:33,990 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 66092 to 66092.
[2025-03-08 01:50:34,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 66092 states, 66091 states have (on average 1.1172776928780015) internal successors, (73842), 66091 states have internal predecessors, (73842), 0 states have call successors, (0), 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-08 01:50:34,091 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 66092 states to 66092 states and 73842 transitions.
[2025-03-08 01:50:34,092 INFO  L78                 Accepts]: Start accepts. Automaton has 66092 states and 73842 transitions. Word has length 296
[2025-03-08 01:50:34,092 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:50:34,092 INFO  L471      AbstractCegarLoop]: Abstraction has 66092 states and 73842 transitions.
[2025-03-08 01:50:34,092 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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-08 01:50:34,092 INFO  L276                IsEmpty]: Start isEmpty. Operand 66092 states and 73842 transitions.
[2025-03-08 01:50:34,094 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 312
[2025-03-08 01:50:34,094 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:50:34,095 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 01:50:34,095 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 01:50:34,095 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:50:34,095 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:50:34,095 INFO  L85        PathProgramCache]: Analyzing trace with hash -1668057419, now seen corresponding path program 1 times
[2025-03-08 01:50:34,095 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:50:34,095 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349430456]
[2025-03-08 01:50:34,095 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:50:34,095 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:50:34,116 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes.
[2025-03-08 01:50:34,129 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements.
[2025-03-08 01:50:34,129 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:50:34,129 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:50:34,205 INFO  L134       CoverageAnalysis]: Checked inductivity of 198 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked.
[2025-03-08 01:50:34,206 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:50:34,206 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349430456]
[2025-03-08 01:50:34,206 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349430456] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:50:34,206 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:50:34,206 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:50:34,206 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398301830]
[2025-03-08 01:50:34,206 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:50:34,207 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:50:34,208 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:50:34,208 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:50:34,208 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:34,208 INFO  L87              Difference]: Start difference. First operand 66092 states and 73842 transitions. Second operand  has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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-08 01:50:36,686 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:50:36,687 INFO  L93              Difference]: Finished difference Result 132182 states and 147682 transitions.
[2025-03-08 01:50:36,687 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:50:36,687 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 311
[2025-03-08 01:50:36,688 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:50:36,760 INFO  L225             Difference]: With dead ends: 132182
[2025-03-08 01:50:36,760 INFO  L226             Difference]: Without dead ends: 66092
[2025-03-08 01:50:36,804 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:36,804 INFO  L435           NwaCegarLoop]: 991 mSDtfsCounter, 793 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 2709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-03-08 01:50:36,804 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 999 Invalid, 2709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-03-08 01:50:36,855 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 66092 states.
[2025-03-08 01:50:37,666 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 66092 to 66092.
[2025-03-08 01:50:37,703 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 66092 states, 66091 states have (on average 1.0977288889561363) internal successors, (72550), 66091 states have internal predecessors, (72550), 0 states have call successors, (0), 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-08 01:50:37,765 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 66092 states to 66092 states and 72550 transitions.
[2025-03-08 01:50:37,765 INFO  L78                 Accepts]: Start accepts. Automaton has 66092 states and 72550 transitions. Word has length 311
[2025-03-08 01:50:37,766 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:50:37,766 INFO  L471      AbstractCegarLoop]: Abstraction has 66092 states and 72550 transitions.
[2025-03-08 01:50:37,766 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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-08 01:50:37,766 INFO  L276                IsEmpty]: Start isEmpty. Operand 66092 states and 72550 transitions.
[2025-03-08 01:50:37,769 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 366
[2025-03-08 01:50:37,769 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:50:37,769 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 01:50:37,770 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 01:50:37,770 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:50:37,770 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:50:37,770 INFO  L85        PathProgramCache]: Analyzing trace with hash -82534345, now seen corresponding path program 1 times
[2025-03-08 01:50:37,770 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:50:37,770 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951044276]
[2025-03-08 01:50:37,770 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:50:37,771 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:50:37,789 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes.
[2025-03-08 01:50:37,803 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements.
[2025-03-08 01:50:37,804 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:50:37,804 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:50:38,168 INFO  L134       CoverageAnalysis]: Checked inductivity of 348 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked.
[2025-03-08 01:50:38,168 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:50:38,168 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951044276]
[2025-03-08 01:50:38,168 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951044276] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:50:38,168 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:50:38,168 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:50:38,169 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626613827]
[2025-03-08 01:50:38,169 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:50:38,169 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:50:38,169 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:50:38,169 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:50:38,169 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:38,170 INFO  L87              Difference]: Start difference. First operand 66092 states and 72550 transitions. Second operand  has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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-08 01:50:40,404 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:50:40,404 INFO  L93              Difference]: Finished difference Result 149455 states and 163733 transitions.
[2025-03-08 01:50:40,404 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:50:40,404 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 365
[2025-03-08 01:50:40,405 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:50:40,491 INFO  L225             Difference]: With dead ends: 149455
[2025-03-08 01:50:40,491 INFO  L226             Difference]: Without dead ends: 81863
[2025-03-08 01:50:40,519 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:40,519 INFO  L435           NwaCegarLoop]: 898 mSDtfsCounter, 837 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2137 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 2732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-08 01:50:40,519 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 906 Invalid, 2732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2137 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-08 01:50:40,580 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81863 states.
[2025-03-08 01:50:41,055 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81863 to 76606.
[2025-03-08 01:50:41,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 76606 states, 76605 states have (on average 1.0915214411591934) internal successors, (83616), 76605 states have internal predecessors, (83616), 0 states have call successors, (0), 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-08 01:50:41,370 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 76606 states to 76606 states and 83616 transitions.
[2025-03-08 01:50:41,371 INFO  L78                 Accepts]: Start accepts. Automaton has 76606 states and 83616 transitions. Word has length 365
[2025-03-08 01:50:41,371 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:50:41,371 INFO  L471      AbstractCegarLoop]: Abstraction has 76606 states and 83616 transitions.
[2025-03-08 01:50:41,371 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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-08 01:50:41,372 INFO  L276                IsEmpty]: Start isEmpty. Operand 76606 states and 83616 transitions.
[2025-03-08 01:50:41,380 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 443
[2025-03-08 01:50:41,380 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:50:41,380 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 01:50:41,380 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-08 01:50:41,381 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:50:41,381 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:50:41,381 INFO  L85        PathProgramCache]: Analyzing trace with hash -1362806003, now seen corresponding path program 1 times
[2025-03-08 01:50:41,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:50:41,381 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009222850]
[2025-03-08 01:50:41,383 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:50:41,383 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:50:41,418 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes.
[2025-03-08 01:50:41,439 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements.
[2025-03-08 01:50:41,439 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:50:41,440 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:50:41,886 INFO  L134       CoverageAnalysis]: Checked inductivity of 611 backedges. 168 proven. 303 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked.
[2025-03-08 01:50:41,886 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:50:41,886 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009222850]
[2025-03-08 01:50:41,886 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009222850] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 01:50:41,886 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338875842]
[2025-03-08 01:50:41,886 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:50:41,887 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:50:41,887 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:50:41,889 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 01:50:41,891 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-08 01:50:41,933 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes.
[2025-03-08 01:50:41,991 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements.
[2025-03-08 01:50:41,991 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:50:41,991 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:50:41,993 INFO  L256         TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 01:50:42,003 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 01:50:42,061 INFO  L134       CoverageAnalysis]: Checked inductivity of 611 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked.
[2025-03-08 01:50:42,062 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 01:50:42,062 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [338875842] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:50:42,062 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 01:50:42,062 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-08 01:50:42,062 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584557731]
[2025-03-08 01:50:42,062 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:50:42,062 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:50:42,063 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:50:42,063 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:50:42,063 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 01:50:42,063 INFO  L87              Difference]: Start difference. First operand 76606 states and 83616 transitions. Second operand  has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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-08 01:50:44,388 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:50:44,388 INFO  L93              Difference]: Finished difference Result 170483 states and 187142 transitions.
[2025-03-08 01:50:44,389 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:50:44,389 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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 442
[2025-03-08 01:50:44,389 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:50:44,500 INFO  L225             Difference]: With dead ends: 170483
[2025-03-08 01:50:44,500 INFO  L226             Difference]: Without dead ends: 93879
[2025-03-08 01:50:44,685 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 01:50:44,686 INFO  L435           NwaCegarLoop]: 1109 mSDtfsCounter, 840 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-03-08 01:50:44,686 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1117 Invalid, 2763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-03-08 01:50:44,734 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 93879 states.
[2025-03-08 01:50:45,358 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 93879 to 93128.
[2025-03-08 01:50:45,422 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 93128 states, 93127 states have (on average 1.0823069571660207) internal successors, (100792), 93127 states have internal predecessors, (100792), 0 states have call successors, (0), 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-08 01:50:45,511 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 93128 states to 93128 states and 100792 transitions.
[2025-03-08 01:50:45,511 INFO  L78                 Accepts]: Start accepts. Automaton has 93128 states and 100792 transitions. Word has length 442
[2025-03-08 01:50:45,512 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:50:45,512 INFO  L471      AbstractCegarLoop]: Abstraction has 93128 states and 100792 transitions.
[2025-03-08 01:50:45,512 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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-08 01:50:45,512 INFO  L276                IsEmpty]: Start isEmpty. Operand 93128 states and 100792 transitions.
[2025-03-08 01:50:45,565 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 952
[2025-03-08 01:50:45,565 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:50:45,565 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:50:45,575 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-03-08 01:50:45,766 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2025-03-08 01:50:45,766 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:50:45,767 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:50:45,767 INFO  L85        PathProgramCache]: Analyzing trace with hash -1942017152, now seen corresponding path program 1 times
[2025-03-08 01:50:45,767 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:50:45,767 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402799403]
[2025-03-08 01:50:45,767 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:50:45,767 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:50:45,829 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 951 statements into 1 equivalence classes.
[2025-03-08 01:50:45,849 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 951 of 951 statements.
[2025-03-08 01:50:45,849 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:50:45,849 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:50:46,312 INFO  L134       CoverageAnalysis]: Checked inductivity of 799 backedges. 689 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked.
[2025-03-08 01:50:46,312 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:50:46,312 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402799403]
[2025-03-08 01:50:46,313 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402799403] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:50:46,313 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:50:46,313 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:50:46,313 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617625943]
[2025-03-08 01:50:46,313 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:50:46,314 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:50:46,314 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:50:46,315 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:50:46,315 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:46,315 INFO  L87              Difference]: Start difference. First operand 93128 states and 100792 transitions. Second operand  has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 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-08 01:50:49,106 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:50:49,106 INFO  L93              Difference]: Finished difference Result 220049 states and 239242 transitions.
[2025-03-08 01:50:49,107 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:50:49,107 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 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 951
[2025-03-08 01:50:49,107 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:50:49,262 INFO  L225             Difference]: With dead ends: 220049
[2025-03-08 01:50:49,262 INFO  L226             Difference]: Without dead ends: 126923
[2025-03-08 01:50:49,314 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:49,315 INFO  L435           NwaCegarLoop]: 432 mSDtfsCounter, 618 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2557 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 2557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-03-08 01:50:49,315 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 439 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 2557 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-03-08 01:50:49,404 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 126923 states.
[2025-03-08 01:50:50,374 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 126923 to 122417.
[2025-03-08 01:50:50,448 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 122417 states, 122416 states have (on average 1.0834939877140244) internal successors, (132637), 122416 states have internal predecessors, (132637), 0 states have call successors, (0), 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-08 01:50:50,559 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 122417 states to 122417 states and 132637 transitions.
[2025-03-08 01:50:50,560 INFO  L78                 Accepts]: Start accepts. Automaton has 122417 states and 132637 transitions. Word has length 951
[2025-03-08 01:50:50,560 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:50:50,560 INFO  L471      AbstractCegarLoop]: Abstraction has 122417 states and 132637 transitions.
[2025-03-08 01:50:50,560 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 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-08 01:50:50,560 INFO  L276                IsEmpty]: Start isEmpty. Operand 122417 states and 132637 transitions.
[2025-03-08 01:50:50,838 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1015
[2025-03-08 01:50:50,838 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:50:50,838 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:50:50,838 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-08 01:50:50,838 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:50:50,839 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:50:50,839 INFO  L85        PathProgramCache]: Analyzing trace with hash 899662351, now seen corresponding path program 1 times
[2025-03-08 01:50:50,839 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:50:50,839 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259630040]
[2025-03-08 01:50:50,839 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:50:50,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:50:50,902 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1014 statements into 1 equivalence classes.
[2025-03-08 01:50:50,943 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1014 of 1014 statements.
[2025-03-08 01:50:50,944 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:50:50,944 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:50:51,326 INFO  L134       CoverageAnalysis]: Checked inductivity of 717 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked.
[2025-03-08 01:50:51,326 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:50:51,327 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259630040]
[2025-03-08 01:50:51,327 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259630040] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:50:51,327 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:50:51,327 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:50:51,327 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323640649]
[2025-03-08 01:50:51,327 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:50:51,328 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:50:51,328 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:50:51,328 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:50:51,328 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:51,328 INFO  L87              Difference]: Start difference. First operand 122417 states and 132637 transitions. Second operand  has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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-08 01:50:53,927 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:50:53,927 INFO  L93              Difference]: Finished difference Result 245583 states and 266029 transitions.
[2025-03-08 01:50:53,927 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:50:53,927 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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 1014
[2025-03-08 01:50:53,928 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:50:54,084 INFO  L225             Difference]: With dead ends: 245583
[2025-03-08 01:50:54,084 INFO  L226             Difference]: Without dead ends: 123168
[2025-03-08 01:50:54,163 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:50:54,163 INFO  L435           NwaCegarLoop]: 1179 mSDtfsCounter, 750 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 536 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 2951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 536 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-03-08 01:50:54,163 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1187 Invalid, 2951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [536 Valid, 2415 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-03-08 01:50:54,248 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 123168 states.
[2025-03-08 01:50:55,478 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 123168 to 119413.
[2025-03-08 01:50:55,552 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 119413 states, 119412 states have (on average 1.0750427092754498) internal successors, (128373), 119412 states have internal predecessors, (128373), 0 states have call successors, (0), 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-08 01:50:55,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 119413 states to 119413 states and 128373 transitions.
[2025-03-08 01:50:55,675 INFO  L78                 Accepts]: Start accepts. Automaton has 119413 states and 128373 transitions. Word has length 1014
[2025-03-08 01:50:55,676 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:50:55,676 INFO  L471      AbstractCegarLoop]: Abstraction has 119413 states and 128373 transitions.
[2025-03-08 01:50:55,676 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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-08 01:50:55,677 INFO  L276                IsEmpty]: Start isEmpty. Operand 119413 states and 128373 transitions.
[2025-03-08 01:50:55,763 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1030
[2025-03-08 01:50:55,764 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:50:55,764 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:50:55,764 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-08 01:50:55,764 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:50:55,765 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:50:55,765 INFO  L85        PathProgramCache]: Analyzing trace with hash -461790095, now seen corresponding path program 1 times
[2025-03-08 01:50:55,765 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:50:55,765 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017446417]
[2025-03-08 01:50:55,765 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:50:55,765 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:50:55,851 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1029 statements into 1 equivalence classes.
[2025-03-08 01:50:55,878 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1029 of 1029 statements.
[2025-03-08 01:50:55,878 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:50:55,879 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:50:56,787 INFO  L134       CoverageAnalysis]: Checked inductivity of 1050 backedges. 575 proven. 303 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked.
[2025-03-08 01:50:56,788 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:50:56,788 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017446417]
[2025-03-08 01:50:56,788 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017446417] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 01:50:56,788 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162158443]
[2025-03-08 01:50:56,788 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:50:56,788 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:50:56,788 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:50:56,790 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 01:50:56,791 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-08 01:50:56,872 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1029 statements into 1 equivalence classes.
[2025-03-08 01:50:57,003 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1029 of 1029 statements.
[2025-03-08 01:50:57,004 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:50:57,004 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:50:57,007 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 01:50:57,017 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 01:50:57,156 INFO  L134       CoverageAnalysis]: Checked inductivity of 1050 backedges. 832 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked.
[2025-03-08 01:50:57,156 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 01:50:57,157 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162158443] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:50:57,157 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 01:50:57,157 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-08 01:50:57,157 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714031086]
[2025-03-08 01:50:57,157 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:50:57,158 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:50:57,158 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:50:57,159 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:50:57,159 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-08 01:50:57,159 INFO  L87              Difference]: Start difference. First operand 119413 states and 128373 transitions. Second operand  has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 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-08 01:50:59,476 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:50:59,476 INFO  L93              Difference]: Finished difference Result 259852 states and 281269 transitions.
[2025-03-08 01:50:59,476 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:50:59,477 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 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 1029
[2025-03-08 01:50:59,477 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:50:59,622 INFO  L225             Difference]: With dead ends: 259852
[2025-03-08 01:50:59,622 INFO  L226             Difference]: Without dead ends: 140441
[2025-03-08 01:50:59,697 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1032 GetRequests, 1028 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-08 01:50:59,698 INFO  L435           NwaCegarLoop]: 238 mSDtfsCounter, 783 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2077 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 2806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 2077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-08 01:50:59,698 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 244 Invalid, 2806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 2077 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-08 01:50:59,815 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 140441 states.
[2025-03-08 01:51:01,153 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 140441 to 138188.
[2025-03-08 01:51:01,235 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 138188 states, 138187 states have (on average 1.07259727760209) internal successors, (148219), 138187 states have internal predecessors, (148219), 0 states have call successors, (0), 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-08 01:51:01,356 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 138188 states to 138188 states and 148219 transitions.
[2025-03-08 01:51:01,357 INFO  L78                 Accepts]: Start accepts. Automaton has 138188 states and 148219 transitions. Word has length 1029
[2025-03-08 01:51:01,357 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:51:01,357 INFO  L471      AbstractCegarLoop]: Abstraction has 138188 states and 148219 transitions.
[2025-03-08 01:51:01,357 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 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-08 01:51:01,357 INFO  L276                IsEmpty]: Start isEmpty. Operand 138188 states and 148219 transitions.
[2025-03-08 01:51:01,403 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1060
[2025-03-08 01:51:01,403 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:51:01,403 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:51:01,409 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-03-08 01:51:01,603 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:51:01,604 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:51:01,604 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:51:01,604 INFO  L85        PathProgramCache]: Analyzing trace with hash 638932284, now seen corresponding path program 1 times
[2025-03-08 01:51:01,604 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:51:01,604 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55147137]
[2025-03-08 01:51:01,605 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:51:01,605 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:51:01,657 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1059 statements into 1 equivalence classes.
[2025-03-08 01:51:01,674 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1059 of 1059 statements.
[2025-03-08 01:51:01,674 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:51:01,674 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:51:02,700 INFO  L134       CoverageAnalysis]: Checked inductivity of 1140 backedges. 605 proven. 333 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked.
[2025-03-08 01:51:02,701 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:51:02,701 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55147137]
[2025-03-08 01:51:02,701 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55147137] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 01:51:02,701 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716052794]
[2025-03-08 01:51:02,701 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:51:02,701 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:51:02,701 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:51:02,703 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 01:51:02,815 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-08 01:51:02,897 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1059 statements into 1 equivalence classes.
[2025-03-08 01:51:03,039 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1059 of 1059 statements.
[2025-03-08 01:51:03,039 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:51:03,039 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:51:03,044 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 01:51:03,051 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 01:51:03,223 INFO  L134       CoverageAnalysis]: Checked inductivity of 1140 backedges. 922 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked.
[2025-03-08 01:51:03,223 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 01:51:03,223 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716052794] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:51:03,223 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 01:51:03,223 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-08 01:51:03,224 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488637461]
[2025-03-08 01:51:03,224 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:51:03,224 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:51:03,225 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:51:03,225 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:51:03,225 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-08 01:51:03,225 INFO  L87              Difference]: Start difference. First operand 138188 states and 148219 transitions. Second operand  has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 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-08 01:51:06,080 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:51:06,080 INFO  L93              Difference]: Finished difference Result 307165 states and 331334 transitions.
[2025-03-08 01:51:06,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:51:06,080 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 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 1059
[2025-03-08 01:51:06,081 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:51:06,306 INFO  L225             Difference]: With dead ends: 307165
[2025-03-08 01:51:06,306 INFO  L226             Difference]: Without dead ends: 168979
[2025-03-08 01:51:06,372 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1062 GetRequests, 1058 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-08 01:51:06,372 INFO  L435           NwaCegarLoop]: 1300 mSDtfsCounter, 660 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 2880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-03-08 01:51:06,372 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1307 Invalid, 2880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-03-08 01:51:06,490 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 168979 states.
[2025-03-08 01:51:07,866 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 168979 to 165224.
[2025-03-08 01:51:07,947 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 165224 states, 165223 states have (on average 1.0690823916767036) internal successors, (176637), 165223 states have internal predecessors, (176637), 0 states have call successors, (0), 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-08 01:51:08,090 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 165224 states to 165224 states and 176637 transitions.
[2025-03-08 01:51:08,091 INFO  L78                 Accepts]: Start accepts. Automaton has 165224 states and 176637 transitions. Word has length 1059
[2025-03-08 01:51:08,092 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:51:08,092 INFO  L471      AbstractCegarLoop]: Abstraction has 165224 states and 176637 transitions.
[2025-03-08 01:51:08,092 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 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-08 01:51:08,092 INFO  L276                IsEmpty]: Start isEmpty. Operand 165224 states and 176637 transitions.
[2025-03-08 01:51:08,144 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1119
[2025-03-08 01:51:08,144 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:51:08,145 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:51:08,151 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-03-08 01:51:08,345 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2025-03-08 01:51:08,345 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:51:08,346 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:51:08,346 INFO  L85        PathProgramCache]: Analyzing trace with hash -1151458650, now seen corresponding path program 1 times
[2025-03-08 01:51:08,346 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:51:08,346 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374849016]
[2025-03-08 01:51:08,346 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:51:08,346 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:51:08,402 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1118 statements into 1 equivalence classes.
[2025-03-08 01:51:08,436 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1118 of 1118 statements.
[2025-03-08 01:51:08,437 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:51:08,437 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:51:09,240 INFO  L134       CoverageAnalysis]: Checked inductivity of 1259 backedges. 655 proven. 0 refuted. 0 times theorem prover too weak. 604 trivial. 0 not checked.
[2025-03-08 01:51:09,240 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:51:09,240 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374849016]
[2025-03-08 01:51:09,241 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374849016] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:51:09,241 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:51:09,241 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:51:09,241 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099603723]
[2025-03-08 01:51:09,241 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:51:09,242 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:51:09,242 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:51:09,243 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:51:09,243 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:51:09,243 INFO  L87              Difference]: Start difference. First operand 165224 states and 176637 transitions. Second operand  has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 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-08 01:51:12,094 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:51:12,094 INFO  L93              Difference]: Finished difference Result 380763 states and 409469 transitions.
[2025-03-08 01:51:12,094 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:51:12,095 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 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 1118
[2025-03-08 01:51:12,095 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:51:12,366 INFO  L225             Difference]: With dead ends: 380763
[2025-03-08 01:51:12,366 INFO  L226             Difference]: Without dead ends: 211786
[2025-03-08 01:51:12,703 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:51:12,703 INFO  L435           NwaCegarLoop]: 1313 mSDtfsCounter, 196 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2229 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 2229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-03-08 01:51:12,703 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1320 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 2229 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-03-08 01:51:12,809 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 211786 states.
[2025-03-08 01:51:14,506 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 211786 to 202023.
[2025-03-08 01:51:14,602 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 202023 states, 202022 states have (on average 1.0616220015641862) internal successors, (214471), 202022 states have internal predecessors, (214471), 0 states have call successors, (0), 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-08 01:51:14,791 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 202023 states to 202023 states and 214471 transitions.
[2025-03-08 01:51:14,793 INFO  L78                 Accepts]: Start accepts. Automaton has 202023 states and 214471 transitions. Word has length 1118
[2025-03-08 01:51:14,793 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:51:14,793 INFO  L471      AbstractCegarLoop]: Abstraction has 202023 states and 214471 transitions.
[2025-03-08 01:51:14,793 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 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-08 01:51:14,793 INFO  L276                IsEmpty]: Start isEmpty. Operand 202023 states and 214471 transitions.
[2025-03-08 01:51:14,854 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1187
[2025-03-08 01:51:14,854 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:51:14,855 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:51:14,855 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-08 01:51:14,855 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:51:14,856 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:51:14,856 INFO  L85        PathProgramCache]: Analyzing trace with hash -270979619, now seen corresponding path program 1 times
[2025-03-08 01:51:14,856 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:51:14,856 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545561978]
[2025-03-08 01:51:14,856 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:51:14,856 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:51:14,946 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1186 statements into 1 equivalence classes.
[2025-03-08 01:51:14,978 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1186 of 1186 statements.
[2025-03-08 01:51:14,978 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:51:14,978 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:51:15,578 INFO  L134       CoverageAnalysis]: Checked inductivity of 1102 backedges. 934 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked.
[2025-03-08 01:51:15,578 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:51:15,578 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545561978]
[2025-03-08 01:51:15,578 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545561978] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:51:15,578 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:51:15,578 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:51:15,578 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644290317]
[2025-03-08 01:51:15,578 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:51:15,580 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:51:15,580 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:51:15,581 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:51:15,581 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:51:15,581 INFO  L87              Difference]: Start difference. First operand 202023 states and 214471 transitions. Second operand  has 3 states, 3 states have (on average 340.0) internal successors, (1020), 3 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)