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


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 80a9d77596eed268b316c6bc5991cccbe6552bee72fbd476389165b1c4f714b5
[2025-02-05 12:18:49,125 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 12:18:49,134 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 12:18:49,135 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 12:18:49,136 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 12:18:49,136 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 12:18:49,137 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label45.c
[2025-02-05 12:18:50,376 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9e9275a0/18965c97e7d3446d8c3b9be84ddec330/FLAG1bf09feed
[2025-02-05 12:18:50,894 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 12:18:50,895 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label45.c
[2025-02-05 12:18:50,933 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9e9275a0/18965c97e7d3446d8c3b9be84ddec330/FLAG1bf09feed
[2025-02-05 12:18:50,977 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9e9275a0/18965c97e7d3446d8c3b9be84ddec330
[2025-02-05 12:18:50,978 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 12:18:50,979 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 12:18:50,980 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 12:18:50,980 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 12:18:50,983 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 12:18:50,983 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:18:50" (1/1) ...
[2025-02-05 12:18:50,984 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e612c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:50, skipping insertion in model container
[2025-02-05 12:18:50,984 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:18:50" (1/1) ...
[2025-02-05 12:18:51,148 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 12:18:51,418 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label45.c[6276,6289]
[2025-02-05 12:18:52,107 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 12:18:52,115 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 12:18:52,131 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label45.c[6276,6289]
[2025-02-05 12:18:52,670 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 12:18:52,696 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 12:18:52,697 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:52 WrapperNode
[2025-02-05 12:18:52,698 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 12:18:52,699 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 12:18:52,699 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 12:18:52,699 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 12:18:52,703 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:52" (1/1) ...
[2025-02-05 12:18:52,781 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:52" (1/1) ...
[2025-02-05 12:18:53,616 INFO  L138                Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428
[2025-02-05 12:18:53,616 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 12:18:53,617 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 12:18:53,617 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 12:18:53,618 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 12:18:53,625 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:52" (1/1) ...
[2025-02-05 12:18:53,626 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:52" (1/1) ...
[2025-02-05 12:18:53,740 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:52" (1/1) ...
[2025-02-05 12:18:54,030 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-05 12:18:54,030 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:52" (1/1) ...
[2025-02-05 12:18:54,030 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:52" (1/1) ...
[2025-02-05 12:18:54,201 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:52" (1/1) ...
[2025-02-05 12:18:54,236 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:52" (1/1) ...
[2025-02-05 12:18:54,262 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:52" (1/1) ...
[2025-02-05 12:18:54,285 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:52" (1/1) ...
[2025-02-05 12:18:54,374 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 12:18:54,375 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 12:18:54,376 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 12:18:54,376 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 12:18:54,377 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:52" (1/1) ...
[2025-02-05 12:18:54,382 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 12:18:54,393 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:18:54,406 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 12:18:54,412 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 12:18:54,431 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 12:18:54,431 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 12:18:54,431 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 12:18:54,431 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 12:18:54,623 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 12:18:54,628 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 12:19:00,429 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1;
[2025-02-05 12:19:00,429 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1;
[2025-02-05 12:19:00,429 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1;
[2025-02-05 12:19:00,430 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1;
[2025-02-05 12:19:00,430 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1;
[2025-02-05 12:19:00,815 INFO  L?                        ?]: Removed 1320 outVars from TransFormulas that were not future-live.
[2025-02-05 12:19:00,815 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 12:19:00,858 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 12:19:00,861 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 12:19:00,862 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:19:00 BoogieIcfgContainer
[2025-02-05 12:19:00,863 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 12:19:00,865 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 12:19:00,865 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 12:19:00,869 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 12:19:00,869 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:18:50" (1/3) ...
[2025-02-05 12:19:00,869 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e88c74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:19:00, skipping insertion in model container
[2025-02-05 12:19:00,869 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:52" (2/3) ...
[2025-02-05 12:19:00,869 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e88c74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:19:00, skipping insertion in model container
[2025-02-05 12:19:00,870 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:19:00" (3/3) ...
[2025-02-05 12:19:00,871 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem19_label45.c
[2025-02-05 12:19:00,882 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 12:19:00,883 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label45.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 12:19:00,968 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 12:19:00,978 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;@74ecf22c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 12:19:00,979 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 12:19:00,988 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:00,993 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2025-02-05 12:19:00,994 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:19:00,994 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:19:00,995 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:19:00,998 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:19:00,999 INFO  L85        PathProgramCache]: Analyzing trace with hash -628932221, now seen corresponding path program 1 times
[2025-02-05 12:19:01,004 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:19:01,005 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193516123]
[2025-02-05 12:19:01,006 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:19:01,006 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:19:01,088 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes.
[2025-02-05 12:19:01,129 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements.
[2025-02-05 12:19:01,129 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:19:01,129 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:19:01,329 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:19:01,329 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:19:01,329 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193516123]
[2025-02-05 12:19:01,330 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193516123] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:19:01,330 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:19:01,330 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:19:01,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195652258]
[2025-02-05 12:19:01,331 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:19:01,334 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:19:01,334 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:19:01,347 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:19:01,347 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:19:01,353 INFO  L87              Difference]: Start difference. First operand  has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 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 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:07,145 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:19:07,145 INFO  L93              Difference]: Finished difference Result 4957 states and 9395 transitions.
[2025-02-05 12:19:07,146 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:19:07,147 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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 47
[2025-02-05 12:19:07,147 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:19:07,165 INFO  L225             Difference]: With dead ends: 4957
[2025-02-05 12:19:07,165 INFO  L226             Difference]: Without dead ends: 3129
[2025-02-05 12:19:07,170 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-02-05 12:19:07,172 INFO  L435           NwaCegarLoop]: 1376 mSDtfsCounter, 1579 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 4344 mSolverCounterSat, 1517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1579 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 5861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1517 IncrementalHoareTripleChecker+Valid, 4344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time
[2025-02-05 12:19:07,172 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1579 Valid, 1598 Invalid, 5861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1517 Valid, 4344 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time]
[2025-02-05 12:19:07,187 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3129 states.
[2025-02-05 12:19:07,262 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3129 to 3108.
[2025-02-05 12:19:07,267 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3108 states, 3107 states have (on average 1.6012230447376892) internal successors, (4975), 3107 states have internal predecessors, (4975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:07,277 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 4975 transitions.
[2025-02-05 12:19:07,279 INFO  L78                 Accepts]: Start accepts. Automaton has 3108 states and 4975 transitions. Word has length 47
[2025-02-05 12:19:07,279 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:19:07,279 INFO  L471      AbstractCegarLoop]: Abstraction has 3108 states and 4975 transitions.
[2025-02-05 12:19:07,279 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:07,280 INFO  L276                IsEmpty]: Start isEmpty. Operand 3108 states and 4975 transitions.
[2025-02-05 12:19:07,284 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 115
[2025-02-05 12:19:07,284 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:19:07,284 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, 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]
[2025-02-05 12:19:07,284 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 12:19:07,284 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:19:07,285 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:19:07,285 INFO  L85        PathProgramCache]: Analyzing trace with hash 1473916161, now seen corresponding path program 1 times
[2025-02-05 12:19:07,285 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:19:07,285 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052079620]
[2025-02-05 12:19:07,285 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:19:07,286 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:19:07,307 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes.
[2025-02-05 12:19:07,344 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements.
[2025-02-05 12:19:07,347 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:19:07,348 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:19:07,702 INFO  L134       CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:19:07,703 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:19:07,703 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052079620]
[2025-02-05 12:19:07,703 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052079620] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:19:07,704 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:19:07,704 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:19:07,704 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221596122]
[2025-02-05 12:19:07,704 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:19:07,705 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:19:07,705 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:19:07,706 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:19:07,706 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:19:07,706 INFO  L87              Difference]: Start difference. First operand 3108 states and 4975 transitions. Second operand  has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:15,522 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:19:15,522 INFO  L93              Difference]: Finished difference Result 10359 states and 16187 transitions.
[2025-02-05 12:19:15,522 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:19:15,523 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 114
[2025-02-05 12:19:15,523 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:19:15,544 INFO  L225             Difference]: With dead ends: 10359
[2025-02-05 12:19:15,545 INFO  L226             Difference]: Without dead ends: 7253
[2025-02-05 12:19:15,548 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 12:19:15,549 INFO  L435           NwaCegarLoop]: 1026 mSDtfsCounter, 4323 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 9504 mSolverCounterSat, 1498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4323 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 11002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1498 IncrementalHoareTripleChecker+Valid, 9504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time
[2025-02-05 12:19:15,549 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4323 Valid, 1296 Invalid, 11002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1498 Valid, 9504 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time]
[2025-02-05 12:19:15,554 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7253 states.
[2025-02-05 12:19:15,627 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7253 to 7249.
[2025-02-05 12:19:15,636 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7249 states, 7248 states have (on average 1.4503311258278146) internal successors, (10512), 7248 states have internal predecessors, (10512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:15,644 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7249 states to 7249 states and 10512 transitions.
[2025-02-05 12:19:15,645 INFO  L78                 Accepts]: Start accepts. Automaton has 7249 states and 10512 transitions. Word has length 114
[2025-02-05 12:19:15,645 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:19:15,645 INFO  L471      AbstractCegarLoop]: Abstraction has 7249 states and 10512 transitions.
[2025-02-05 12:19:15,645 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:15,645 INFO  L276                IsEmpty]: Start isEmpty. Operand 7249 states and 10512 transitions.
[2025-02-05 12:19:15,649 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 322
[2025-02-05 12:19:15,649 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:19:15,649 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:19:15,649 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 12:19:15,649 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:19:15,650 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:19:15,650 INFO  L85        PathProgramCache]: Analyzing trace with hash -1866177033, now seen corresponding path program 1 times
[2025-02-05 12:19:15,650 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:19:15,650 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96035757]
[2025-02-05 12:19:15,650 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:19:15,650 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:19:15,679 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes.
[2025-02-05 12:19:15,745 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements.
[2025-02-05 12:19:15,745 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:19:15,745 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:19:16,436 INFO  L134       CoverageAnalysis]: Checked inductivity of 153 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2025-02-05 12:19:16,436 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:19:16,436 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96035757]
[2025-02-05 12:19:16,436 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96035757] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:19:16,436 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:19:16,437 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:19:16,437 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603089949]
[2025-02-05 12:19:16,437 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:19:16,437 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:19:16,437 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:19:16,438 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:19:16,438 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:19:16,438 INFO  L87              Difference]: Start difference. First operand 7249 states and 10512 transitions. Second operand  has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:23,585 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:19:23,586 INFO  L93              Difference]: Finished difference Result 17269 states and 24867 transitions.
[2025-02-05 12:19:23,586 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:19:23,586 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 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 321
[2025-02-05 12:19:23,588 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:19:23,614 INFO  L225             Difference]: With dead ends: 17269
[2025-02-05 12:19:23,615 INFO  L226             Difference]: Without dead ends: 11387
[2025-02-05 12:19:23,621 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 12:19:23,623 INFO  L435           NwaCegarLoop]: 1804 mSDtfsCounter, 3756 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 9455 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 9885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 9455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time
[2025-02-05 12:19:23,624 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 2159 Invalid, 9885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 9455 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time]
[2025-02-05 12:19:23,633 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11387 states.
[2025-02-05 12:19:23,738 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11387 to 11367.
[2025-02-05 12:19:23,752 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11367 states, 11366 states have (on average 1.3286116487770543) internal successors, (15101), 11366 states have internal predecessors, (15101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:23,766 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11367 states to 11367 states and 15101 transitions.
[2025-02-05 12:19:23,766 INFO  L78                 Accepts]: Start accepts. Automaton has 11367 states and 15101 transitions. Word has length 321
[2025-02-05 12:19:23,767 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:19:23,767 INFO  L471      AbstractCegarLoop]: Abstraction has 11367 states and 15101 transitions.
[2025-02-05 12:19:23,768 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:23,768 INFO  L276                IsEmpty]: Start isEmpty. Operand 11367 states and 15101 transitions.
[2025-02-05 12:19:23,770 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 350
[2025-02-05 12:19:23,770 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:19:23,771 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:19:23,771 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 12:19:23,772 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:19:23,772 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:19:23,772 INFO  L85        PathProgramCache]: Analyzing trace with hash -387090551, now seen corresponding path program 1 times
[2025-02-05 12:19:23,774 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:19:23,774 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819415044]
[2025-02-05 12:19:23,774 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:19:23,774 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:19:23,807 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes.
[2025-02-05 12:19:23,828 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements.
[2025-02-05 12:19:23,828 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:19:23,828 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:19:24,293 INFO  L134       CoverageAnalysis]: Checked inductivity of 153 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2025-02-05 12:19:24,293 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:19:24,293 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819415044]
[2025-02-05 12:19:24,293 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819415044] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:19:24,293 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:19:24,293 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:19:24,293 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691201713]
[2025-02-05 12:19:24,294 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:19:24,294 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:19:24,294 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:19:24,294 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:19:24,294 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:19:24,295 INFO  L87              Difference]: Start difference. First operand 11367 states and 15101 transitions. Second operand  has 4 states, 4 states have (on average 82.75) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:29,968 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:19:29,968 INFO  L93              Difference]: Finished difference Result 20033 states and 27483 transitions.
[2025-02-05 12:19:29,968 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:19:29,968 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 82.75) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 349
[2025-02-05 12:19:29,973 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:19:30,010 INFO  L225             Difference]: With dead ends: 20033
[2025-02-05 12:19:30,012 INFO  L226             Difference]: Without dead ends: 11367
[2025-02-05 12:19:30,020 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-02-05 12:19:30,021 INFO  L435           NwaCegarLoop]: 1775 mSDtfsCounter, 1138 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 7325 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 7333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time
[2025-02-05 12:19:30,021 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2117 Invalid, 7333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7325 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time]
[2025-02-05 12:19:30,029 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11367 states.
[2025-02-05 12:19:30,118 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11367 to 11367.
[2025-02-05 12:19:30,248 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11367 states, 11366 states have (on average 1.3274678866795706) internal successors, (15088), 11366 states have internal predecessors, (15088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:30,271 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11367 states to 11367 states and 15088 transitions.
[2025-02-05 12:19:30,271 INFO  L78                 Accepts]: Start accepts. Automaton has 11367 states and 15088 transitions. Word has length 349
[2025-02-05 12:19:30,272 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:19:30,272 INFO  L471      AbstractCegarLoop]: Abstraction has 11367 states and 15088 transitions.
[2025-02-05 12:19:30,272 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 82.75) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:30,276 INFO  L276                IsEmpty]: Start isEmpty. Operand 11367 states and 15088 transitions.
[2025-02-05 12:19:30,285 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 535
[2025-02-05 12:19:30,286 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:19:30,286 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, 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]
[2025-02-05 12:19:30,286 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 12:19:30,287 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:19:30,288 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:19:30,292 INFO  L85        PathProgramCache]: Analyzing trace with hash 1868556236, now seen corresponding path program 1 times
[2025-02-05 12:19:30,292 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:19:30,292 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324378242]
[2025-02-05 12:19:30,292 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:19:30,292 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:19:30,388 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes.
[2025-02-05 12:19:30,449 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements.
[2025-02-05 12:19:30,449 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:19:30,449 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:19:31,455 INFO  L134       CoverageAnalysis]: Checked inductivity of 44 backedges. 22 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:19:31,455 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:19:31,455 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324378242]
[2025-02-05 12:19:31,455 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324378242] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:19:31,455 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962493562]
[2025-02-05 12:19:31,455 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:19:31,456 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:19:31,456 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:19:31,459 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 12:19:31,463 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-05 12:19:31,526 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes.
[2025-02-05 12:19:31,607 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements.
[2025-02-05 12:19:31,607 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:19:31,607 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:19:31,610 INFO  L256         TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 12:19:31,624 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:19:32,160 INFO  L134       CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked.
[2025-02-05 12:19:32,160 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 12:19:32,161 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962493562] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:19:32,161 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 12:19:32,161 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5
[2025-02-05 12:19:32,161 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553112337]
[2025-02-05 12:19:32,161 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:19:32,162 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:19:32,162 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:19:32,162 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:19:32,162 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 12:19:32,162 INFO  L87              Difference]: Start difference. First operand 11367 states and 15088 transitions. Second operand  has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 2 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:36,874 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:19:36,875 INFO  L93              Difference]: Finished difference Result 24133 states and 33157 transitions.
[2025-02-05 12:19:36,875 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:19:36,875 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 2 states have internal predecessors, (491), 0 states have call successors, (0), 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 534
[2025-02-05 12:19:36,876 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:19:36,898 INFO  L225             Difference]: With dead ends: 24133
[2025-02-05 12:19:36,899 INFO  L226             Difference]: Without dead ends: 15498
[2025-02-05 12:19:36,906 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 534 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-02-05 12:19:36,908 INFO  L435           NwaCegarLoop]: 1208 mSDtfsCounter, 1058 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 4576 mSolverCounterSat, 809 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 5385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 809 IncrementalHoareTripleChecker+Valid, 4576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time
[2025-02-05 12:19:36,908 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 1385 Invalid, 5385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [809 Valid, 4576 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time]
[2025-02-05 12:19:36,917 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15498 states.
[2025-02-05 12:19:37,017 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15498 to 15496.
[2025-02-05 12:19:37,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15496 states, 15495 states have (on average 1.2933849628912553) internal successors, (20041), 15495 states have internal predecessors, (20041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:37,049 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15496 states to 15496 states and 20041 transitions.
[2025-02-05 12:19:37,050 INFO  L78                 Accepts]: Start accepts. Automaton has 15496 states and 20041 transitions. Word has length 534
[2025-02-05 12:19:37,052 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:19:37,052 INFO  L471      AbstractCegarLoop]: Abstraction has 15496 states and 20041 transitions.
[2025-02-05 12:19:37,053 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 2 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:37,053 INFO  L276                IsEmpty]: Start isEmpty. Operand 15496 states and 20041 transitions.
[2025-02-05 12:19:37,062 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 604
[2025-02-05 12:19:37,062 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:19:37,062 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:19:37,074 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-02-05 12:19:37,263 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:19:37,264 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:19:37,264 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:19:37,264 INFO  L85        PathProgramCache]: Analyzing trace with hash -286643369, now seen corresponding path program 1 times
[2025-02-05 12:19:37,264 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:19:37,264 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380317959]
[2025-02-05 12:19:37,265 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:19:37,265 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:19:37,375 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes.
[2025-02-05 12:19:37,432 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements.
[2025-02-05 12:19:37,435 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:19:37,435 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:19:38,048 INFO  L134       CoverageAnalysis]: Checked inductivity of 155 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2025-02-05 12:19:38,050 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:19:38,050 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380317959]
[2025-02-05 12:19:38,050 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380317959] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:19:38,050 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:19:38,050 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:19:38,050 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537051993]
[2025-02-05 12:19:38,050 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:19:38,051 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:19:38,051 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:19:38,052 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:19:38,052 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:19:38,052 INFO  L87              Difference]: Start difference. First operand 15496 states and 20041 transitions. Second operand  has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 2 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:43,546 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:19:43,546 INFO  L93              Difference]: Finished difference Result 40736 states and 54258 transitions.
[2025-02-05 12:19:43,546 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:19:43,547 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 2 states have internal predecessors, (538), 0 states have call successors, (0), 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 603
[2025-02-05 12:19:43,548 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:19:43,584 INFO  L225             Difference]: With dead ends: 40736
[2025-02-05 12:19:43,584 INFO  L226             Difference]: Without dead ends: 27972
[2025-02-05 12:19:43,595 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-02-05 12:19:43,597 INFO  L435           NwaCegarLoop]: 718 mSDtfsCounter, 2111 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 5119 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2111 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 5553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time
[2025-02-05 12:19:43,597 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2111 Valid, 987 Invalid, 5553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5119 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time]
[2025-02-05 12:19:43,619 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 27972 states.
[2025-02-05 12:19:43,845 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 27972 to 27968.
[2025-02-05 12:19:43,867 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 27968 states, 27967 states have (on average 1.2921300103693638) internal successors, (36137), 27967 states have internal predecessors, (36137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:43,892 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27968 states to 27968 states and 36137 transitions.
[2025-02-05 12:19:43,893 INFO  L78                 Accepts]: Start accepts. Automaton has 27968 states and 36137 transitions. Word has length 603
[2025-02-05 12:19:43,893 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:19:43,894 INFO  L471      AbstractCegarLoop]: Abstraction has 27968 states and 36137 transitions.
[2025-02-05 12:19:43,894 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 2 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:43,894 INFO  L276                IsEmpty]: Start isEmpty. Operand 27968 states and 36137 transitions.
[2025-02-05 12:19:43,901 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 609
[2025-02-05 12:19:43,901 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:19:43,902 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:19:43,902 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 12:19:43,902 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:19:43,903 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:19:43,903 INFO  L85        PathProgramCache]: Analyzing trace with hash 70390305, now seen corresponding path program 1 times
[2025-02-05 12:19:43,903 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:19:43,903 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462966689]
[2025-02-05 12:19:43,903 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:19:43,903 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:19:43,940 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes.
[2025-02-05 12:19:43,961 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements.
[2025-02-05 12:19:43,962 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:19:43,962 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:19:44,166 INFO  L134       CoverageAnalysis]: Checked inductivity of 162 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:19:44,166 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:19:44,166 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462966689]
[2025-02-05 12:19:44,166 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462966689] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:19:44,166 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:19:44,166 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:19:44,166 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564296392]
[2025-02-05 12:19:44,166 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:19:44,167 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:19:44,167 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:19:44,167 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:19:44,167 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:19:44,168 INFO  L87              Difference]: Start difference. First operand 27968 states and 36137 transitions. Second operand  has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:49,674 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:19:49,674 INFO  L93              Difference]: Finished difference Result 69703 states and 93128 transitions.
[2025-02-05 12:19:49,675 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:19:49,676 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 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 608
[2025-02-05 12:19:49,676 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:19:49,734 INFO  L225             Difference]: With dead ends: 69703
[2025-02-05 12:19:49,734 INFO  L226             Difference]: Without dead ends: 44467
[2025-02-05 12:19:49,750 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:19:49,752 INFO  L435           NwaCegarLoop]: 2817 mSDtfsCounter, 1449 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 4092 mSolverCounterSat, 1785 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 2994 SdHoareTripleChecker+Invalid, 5877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1785 IncrementalHoareTripleChecker+Valid, 4092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time
[2025-02-05 12:19:49,752 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 2994 Invalid, 5877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1785 Valid, 4092 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time]
[2025-02-05 12:19:49,781 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 44467 states.
[2025-02-05 12:19:50,066 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 44467 to 44398.
[2025-02-05 12:19:50,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 44398 states, 44397 states have (on average 1.2490258350789467) internal successors, (55453), 44397 states have internal predecessors, (55453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:50,144 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 44398 states to 44398 states and 55453 transitions.
[2025-02-05 12:19:50,144 INFO  L78                 Accepts]: Start accepts. Automaton has 44398 states and 55453 transitions. Word has length 608
[2025-02-05 12:19:50,146 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:19:50,146 INFO  L471      AbstractCegarLoop]: Abstraction has 44398 states and 55453 transitions.
[2025-02-05 12:19:50,146 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:50,146 INFO  L276                IsEmpty]: Start isEmpty. Operand 44398 states and 55453 transitions.
[2025-02-05 12:19:50,149 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 658
[2025-02-05 12:19:50,150 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:19:50,150 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:19:50,150 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 12:19:50,150 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:19:50,151 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:19:50,151 INFO  L85        PathProgramCache]: Analyzing trace with hash -204620809, now seen corresponding path program 1 times
[2025-02-05 12:19:50,151 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:19:50,151 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723886772]
[2025-02-05 12:19:50,151 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:19:50,151 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:19:50,364 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 657 statements into 1 equivalence classes.
[2025-02-05 12:19:50,386 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 657 of 657 statements.
[2025-02-05 12:19:50,386 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:19:50,386 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:19:50,586 INFO  L134       CoverageAnalysis]: Checked inductivity of 211 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked.
[2025-02-05 12:19:50,587 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:19:50,587 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723886772]
[2025-02-05 12:19:50,587 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723886772] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:19:50,587 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:19:50,587 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:19:50,587 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935994735]
[2025-02-05 12:19:50,587 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:19:50,588 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:19:50,588 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:19:50,589 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:19:50,589 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:19:50,590 INFO  L87              Difference]: Start difference. First operand 44398 states and 55453 transitions. Second operand  has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 2 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:55,809 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:19:55,810 INFO  L93              Difference]: Finished difference Result 123168 states and 155290 transitions.
[2025-02-05 12:19:55,810 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:19:55,811 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 2 states have internal predecessors, (536), 0 states have call successors, (0), 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 657
[2025-02-05 12:19:55,811 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:19:55,892 INFO  L225             Difference]: With dead ends: 123168
[2025-02-05 12:19:55,892 INFO  L226             Difference]: Without dead ends: 81502
[2025-02-05 12:19:55,928 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-02-05 12:19:55,929 INFO  L435           NwaCegarLoop]: 1802 mSDtfsCounter, 1354 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 4313 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 2073 SdHoareTripleChecker+Invalid, 5743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time
[2025-02-05 12:19:55,929 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 2073 Invalid, 5743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4313 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time]
[2025-02-05 12:19:55,984 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81502 states.
[2025-02-05 12:19:56,519 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81502 to 70554.
[2025-02-05 12:19:56,568 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 70554 states, 70553 states have (on average 1.1858744489957904) internal successors, (83667), 70553 states have internal predecessors, (83667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:56,632 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 70554 states to 70554 states and 83667 transitions.
[2025-02-05 12:19:56,632 INFO  L78                 Accepts]: Start accepts. Automaton has 70554 states and 83667 transitions. Word has length 657
[2025-02-05 12:19:56,633 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:19:56,633 INFO  L471      AbstractCegarLoop]: Abstraction has 70554 states and 83667 transitions.
[2025-02-05 12:19:56,633 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 2 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:19:56,633 INFO  L276                IsEmpty]: Start isEmpty. Operand 70554 states and 83667 transitions.
[2025-02-05 12:19:56,637 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 754
[2025-02-05 12:19:56,637 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:19:56,638 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:19:56,638 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 12:19:56,638 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:19:56,639 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:19:56,639 INFO  L85        PathProgramCache]: Analyzing trace with hash -1139862552, now seen corresponding path program 1 times
[2025-02-05 12:19:56,639 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:19:56,639 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184189166]
[2025-02-05 12:19:56,639 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:19:56,639 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:19:56,686 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 753 statements into 1 equivalence classes.
[2025-02-05 12:19:56,710 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 753 of 753 statements.
[2025-02-05 12:19:56,711 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:19:56,711 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:19:58,371 INFO  L134       CoverageAnalysis]: Checked inductivity of 307 backedges. 89 proven. 218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:19:58,371 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:19:58,371 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184189166]
[2025-02-05 12:19:58,371 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184189166] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:19:58,371 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435978848]
[2025-02-05 12:19:58,371 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:19:58,372 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:19:58,372 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:19:58,374 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 12:19:58,378 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-02-05 12:19:58,450 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 753 statements into 1 equivalence classes.
[2025-02-05 12:19:58,544 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 753 of 753 statements.
[2025-02-05 12:19:58,544 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:19:58,544 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:19:58,546 INFO  L256         TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 12:19:58,554 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:19:58,612 INFO  L134       CoverageAnalysis]: Checked inductivity of 307 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked.
[2025-02-05 12:19:58,612 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 12:19:58,612 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435978848] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:19:58,612 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 12:19:58,612 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8
[2025-02-05 12:19:58,612 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034217237]
[2025-02-05 12:19:58,613 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:19:58,613 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:19:58,613 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:19:58,614 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:19:58,614 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-02-05 12:19:58,615 INFO  L87              Difference]: Start difference. First operand 70554 states and 83667 transitions. Second operand  has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:20:04,001 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:20:04,002 INFO  L93              Difference]: Finished difference Result 178129 states and 213819 transitions.
[2025-02-05 12:20:04,002 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:20:04,002 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 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 753
[2025-02-05 12:20:04,003 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:20:04,125 INFO  L225             Difference]: With dead ends: 178129
[2025-02-05 12:20:04,125 INFO  L226             Difference]: Without dead ends: 110307
[2025-02-05 12:20:04,174 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 752 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-02-05 12:20:04,177 INFO  L435           NwaCegarLoop]: 3158 mSDtfsCounter, 1438 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 5059 mSolverCounterSat, 993 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 3333 SdHoareTripleChecker+Invalid, 6052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 993 IncrementalHoareTripleChecker+Valid, 5059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time
[2025-02-05 12:20:04,177 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1438 Valid, 3333 Invalid, 6052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [993 Valid, 5059 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time]
[2025-02-05 12:20:04,409 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 110307 states.
[2025-02-05 12:20:05,306 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 110307 to 108816.
[2025-02-05 12:20:05,374 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 108816 states, 108815 states have (on average 1.1550429628268162) internal successors, (125686), 108815 states have internal predecessors, (125686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:20:05,482 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 108816 states to 108816 states and 125686 transitions.
[2025-02-05 12:20:05,482 INFO  L78                 Accepts]: Start accepts. Automaton has 108816 states and 125686 transitions. Word has length 753
[2025-02-05 12:20:05,483 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:20:05,483 INFO  L471      AbstractCegarLoop]: Abstraction has 108816 states and 125686 transitions.
[2025-02-05 12:20:05,483 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:20:05,483 INFO  L276                IsEmpty]: Start isEmpty. Operand 108816 states and 125686 transitions.
[2025-02-05 12:20:05,488 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 841
[2025-02-05 12:20:05,488 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:20:05,488 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:20:05,498 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-02-05 12:20:05,693 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:20:05,693 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:20:05,693 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:20:05,693 INFO  L85        PathProgramCache]: Analyzing trace with hash -494981173, now seen corresponding path program 1 times
[2025-02-05 12:20:05,694 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:20:05,694 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160014980]
[2025-02-05 12:20:05,694 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:20:05,694 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:20:05,767 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 840 statements into 1 equivalence classes.
[2025-02-05 12:20:05,795 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 840 of 840 statements.
[2025-02-05 12:20:05,796 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:20:05,796 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:20:06,690 INFO  L134       CoverageAnalysis]: Checked inductivity of 530 backedges. 113 proven. 21 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked.
[2025-02-05 12:20:06,690 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:20:06,690 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160014980]
[2025-02-05 12:20:06,690 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160014980] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:20:06,690 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714429814]
[2025-02-05 12:20:06,690 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:20:06,690 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:20:06,691 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:20:06,693 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 12:20:06,697 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-02-05 12:20:06,769 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 840 statements into 1 equivalence classes.
[2025-02-05 12:20:06,884 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 840 of 840 statements.
[2025-02-05 12:20:06,884 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:20:06,884 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:20:06,887 INFO  L256         TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 12:20:06,895 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:20:06,969 INFO  L134       CoverageAnalysis]: Checked inductivity of 530 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked.
[2025-02-05 12:20:06,969 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 12:20:06,969 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [714429814] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:20:06,969 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 12:20:06,969 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-02-05 12:20:06,969 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462180813]
[2025-02-05 12:20:06,970 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:20:06,970 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:20:06,970 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:20:06,971 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:20:06,971 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 12:20:06,971 INFO  L87              Difference]: Start difference. First operand 108816 states and 125686 transitions. Second operand  has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:20:12,780 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:20:12,781 INFO  L93              Difference]: Finished difference Result 253165 states and 297733 transitions.
[2025-02-05 12:20:12,781 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:20:12,781 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 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 840
[2025-02-05 12:20:12,782 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:20:12,990 INFO  L225             Difference]: With dead ends: 253165
[2025-02-05 12:20:12,991 INFO  L226             Difference]: Without dead ends: 147081
[2025-02-05 12:20:13,063 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 843 GetRequests, 839 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-02-05 12:20:13,063 INFO  L435           NwaCegarLoop]: 1488 mSDtfsCounter, 1506 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 4042 mSolverCounterSat, 1704 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 5746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1704 IncrementalHoareTripleChecker+Valid, 4042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time
[2025-02-05 12:20:13,064 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1686 Invalid, 5746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1704 Valid, 4042 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time]
[2025-02-05 12:20:13,181 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 147081 states.
[2025-02-05 12:20:14,164 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 147081 to 110097.
[2025-02-05 12:20:14,233 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 110097 states, 110096 states have (on average 1.1533298212469119) internal successors, (126977), 110096 states have internal predecessors, (126977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:20:14,339 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 110097 states to 110097 states and 126977 transitions.
[2025-02-05 12:20:14,340 INFO  L78                 Accepts]: Start accepts. Automaton has 110097 states and 126977 transitions. Word has length 840
[2025-02-05 12:20:14,340 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:20:14,340 INFO  L471      AbstractCegarLoop]: Abstraction has 110097 states and 126977 transitions.
[2025-02-05 12:20:14,341 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:20:14,341 INFO  L276                IsEmpty]: Start isEmpty. Operand 110097 states and 126977 transitions.
[2025-02-05 12:20:14,347 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 907
[2025-02-05 12:20:14,347 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:20:14,349 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:20:14,359 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-02-05 12:20:14,550 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:20:14,550 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:20:14,551 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:20:14,551 INFO  L85        PathProgramCache]: Analyzing trace with hash 618692255, now seen corresponding path program 1 times
[2025-02-05 12:20:14,551 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:20:14,551 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928962295]
[2025-02-05 12:20:14,551 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:20:14,551 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:20:14,604 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 906 statements into 1 equivalence classes.
[2025-02-05 12:20:14,855 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 906 of 906 statements.
[2025-02-05 12:20:14,855 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:20:14,855 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:20:15,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 662 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked.
[2025-02-05 12:20:15,643 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:20:15,643 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928962295]
[2025-02-05 12:20:15,643 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928962295] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:20:15,644 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:20:15,644 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:20:15,644 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440396270]
[2025-02-05 12:20:15,644 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:20:15,644 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:20:15,644 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:20:15,645 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:20:15,645 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:20:15,645 INFO  L87              Difference]: Start difference. First operand 110097 states and 126977 transitions. Second operand  has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)