./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekh_ctm.4.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version c00e63dc
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/rekh_ctm.4.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 436e6e57c04bd43264564f478c3aa92ec3799e6c36d71ae9bac6692f2873338f
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 16:25:12,056 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 16:25:12,099 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 16:25:12,102 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 16:25:12,103 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 16:25:12,117 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 16:25:12,117 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 16:25:12,117 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 16:25:12,118 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 16:25:12,118 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 16:25:12,118 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 16:25:12,118 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 16:25:12,118 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 16:25:12,118 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 16:25:12,118 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 16:25:12,118 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 16:25:12,118 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 16:25:12,119 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 16:25:12,119 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 16:25:12,119 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 16:25:12,119 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 16:25:12,119 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 16:25:12,119 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 16:25:12,119 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 16:25:12,119 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 16:25:12,119 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 16:25:12,119 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 16:25:12,119 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 16:25:12,120 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 16:25:12,120 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 16:25:12,120 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 16:25:12,120 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 16:25:12,120 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 16:25:12,120 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 16:25:12,120 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 16:25:12,120 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 16:25:12,120 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 16:25:12,120 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 16:25:12,121 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 16:25:12,121 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 16:25:12,121 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 16:25:12,121 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 16:25:12,121 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 16:25:12,121 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 -> 436e6e57c04bd43264564f478c3aa92ec3799e6c36d71ae9bac6692f2873338f
[2025-02-05 16:25:12,318 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 16:25:12,324 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 16:25:12,325 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 16:25:12,325 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 16:25:12,326 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 16:25:12,326 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekh_ctm.4.c
[2025-02-05 16:25:13,516 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd5ebf448/9b79bc43743d4179a3c48f259d6e3334/FLAG04baf8653
[2025-02-05 16:25:14,072 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 16:25:14,076 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_ctm.4.c
[2025-02-05 16:25:14,111 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd5ebf448/9b79bc43743d4179a3c48f259d6e3334/FLAG04baf8653
[2025-02-05 16:25:14,618 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd5ebf448/9b79bc43743d4179a3c48f259d6e3334
[2025-02-05 16:25:14,620 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 16:25:14,621 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 16:25:14,622 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 16:25:14,622 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 16:25:14,629 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 16:25:14,630 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:25:14" (1/1) ...
[2025-02-05 16:25:14,631 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c50513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:14, skipping insertion in model container
[2025-02-05 16:25:14,631 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:25:14" (1/1) ...
[2025-02-05 16:25:14,679 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 16:25:14,851 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_ctm.4.c[1868,1881]
[2025-02-05 16:25:15,198 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 16:25:15,218 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 16:25:15,227 WARN  L75    lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/ctm.ok4.i","-S") [42]
[2025-02-05 16:25:15,233 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_ctm.4.c[1868,1881]
[2025-02-05 16:25:15,478 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 16:25:15,513 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 16:25:15,513 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:15 WrapperNode
[2025-02-05 16:25:15,513 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 16:25:15,514 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 16:25:15,514 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 16:25:15,515 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 16:25:15,519 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:15" (1/1) ...
[2025-02-05 16:25:15,576 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:15" (1/1) ...
[2025-02-05 16:25:15,825 INFO  L138                Inliner]: procedures = 99, calls = 2906, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 8763
[2025-02-05 16:25:15,826 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 16:25:15,826 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 16:25:15,827 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 16:25:15,827 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 16:25:15,834 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:15" (1/1) ...
[2025-02-05 16:25:15,835 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:15" (1/1) ...
[2025-02-05 16:25:15,867 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:15" (1/1) ...
[2025-02-05 16:25:15,945 INFO  L175           MemorySlicer]: Split 2508 memory accesses to 49 slices as follows [2, 80, 86, 37, 37, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46]. 3 percent of accesses are in the largest equivalence class. The 338 initializations are split as follows [2, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]. The 490 writes are split as follows [0, 7, 7, 7, 7, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6].
[2025-02-05 16:25:15,948 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:15" (1/1) ...
[2025-02-05 16:25:15,948 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:15" (1/1) ...
[2025-02-05 16:25:16,149 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:15" (1/1) ...
[2025-02-05 16:25:16,162 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:15" (1/1) ...
[2025-02-05 16:25:16,180 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:15" (1/1) ...
[2025-02-05 16:25:16,191 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:15" (1/1) ...
[2025-02-05 16:25:16,228 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 16:25:16,229 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 16:25:16,230 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 16:25:16,230 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 16:25:16,230 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:15" (1/1) ...
[2025-02-05 16:25:16,234 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 16:25:16,243 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 16:25:16,255 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 16:25:16,259 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 16:25:16,273 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_read_W_state
[2025-02-05 16:25:16,273 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_read_W_state
[2025-02-05 16:25:16,273 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_read_T_state
[2025-02-05 16:25:16,274 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_read_T_state
[2025-02-05 16:25:16,274 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2025-02-05 16:25:16,274 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2025-02-05 16:25:16,274 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#2
[2025-02-05 16:25:16,274 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#3
[2025-02-05 16:25:16,274 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#4
[2025-02-05 16:25:16,274 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#5
[2025-02-05 16:25:16,274 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#6
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#7
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#8
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#9
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#10
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#11
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#12
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#13
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#14
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#15
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#16
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#17
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#18
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#19
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#20
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#21
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#22
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#23
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#24
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#25
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#26
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#27
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#28
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#29
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#30
[2025-02-05 16:25:16,275 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#31
[2025-02-05 16:25:16,277 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#32
[2025-02-05 16:25:16,277 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#33
[2025-02-05 16:25:16,277 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#34
[2025-02-05 16:25:16,277 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#35
[2025-02-05 16:25:16,277 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#36
[2025-02-05 16:25:16,277 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#37
[2025-02-05 16:25:16,277 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#38
[2025-02-05 16:25:16,277 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#39
[2025-02-05 16:25:16,277 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#40
[2025-02-05 16:25:16,277 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#41
[2025-02-05 16:25:16,277 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#42
[2025-02-05 16:25:16,278 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#43
[2025-02-05 16:25:16,278 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#44
[2025-02-05 16:25:16,278 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#45
[2025-02-05 16:25:16,278 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#46
[2025-02-05 16:25:16,278 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#47
[2025-02-05 16:25:16,278 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#48
[2025-02-05 16:25:16,278 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_run_nxtbg
[2025-02-05 16:25:16,278 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_run_nxtbg
[2025-02-05 16:25:16,278 INFO  L130     BoogieDeclarations]: Found specification of procedure nxt_motor_set_count
[2025-02-05 16:25:16,278 INFO  L138     BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count
[2025-02-05 16:25:16,278 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_write___startrek_current_priority
[2025-02-05 16:25:16,278 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_write___startrek_current_priority
[2025-02-05 16:25:16,278 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_read_input
[2025-02-05 16:25:16,278 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_read_input
[2025-02-05 16:25:16,278 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_hyperperiod
[2025-02-05 16:25:16,278 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_hyperperiod
[2025-02-05 16:25:16,278 INFO  L130     BoogieDeclarations]: Found specification of procedure bg_nxtcolorsensor
[2025-02-05 16:25:16,278 INFO  L138     BoogieDeclarations]: Found implementation of procedure bg_nxtcolorsensor
[2025-02-05 16:25:16,278 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Writer
[2025-02-05 16:25:16,278 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Writer
[2025-02-05 16:25:16,278 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_mode
[2025-02-05 16:25:16,278 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_mode
[2025-02-05 16:25:16,278 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2025-02-05 16:25:16,278 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2025-02-05 16:25:16,278 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2025-02-05 16:25:16,278 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#3
[2025-02-05 16:25:16,278 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#4
[2025-02-05 16:25:16,278 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#5
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#6
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#7
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#8
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#9
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#10
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#11
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#12
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#13
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#14
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#15
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#16
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#17
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#18
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#19
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#20
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#21
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#22
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#23
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#24
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#25
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#26
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#27
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#28
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#29
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#30
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#31
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#32
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#33
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#34
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#35
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#36
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#37
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#38
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#39
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#40
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#41
[2025-02-05 16:25:16,279 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#42
[2025-02-05 16:25:16,280 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#43
[2025-02-05 16:25:16,280 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#44
[2025-02-05 16:25:16,280 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#45
[2025-02-05 16:25:16,280 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#46
[2025-02-05 16:25:16,280 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#47
[2025-02-05 16:25:16,280 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#48
[2025-02-05 16:25:16,280 INFO  L130     BoogieDeclarations]: Found specification of procedure assert
[2025-02-05 16:25:16,280 INFO  L138     BoogieDeclarations]: Found implementation of procedure assert
[2025-02-05 16:25:16,280 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_read_R_count
[2025-02-05 16:25:16,280 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_read_R_count
[2025-02-05 16:25:16,280 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_write_T_state
[2025-02-05 16:25:16,280 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_write_T_state
[2025-02-05 16:25:16,280 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_write_output
[2025-02-05 16:25:16,280 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_write_output
[2025-02-05 16:25:16,282 INFO  L130     BoogieDeclarations]: Found specification of procedure move_motor
[2025-02-05 16:25:16,282 INFO  L138     BoogieDeclarations]: Found implementation of procedure move_motor
[2025-02-05 16:25:16,283 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_read_R_speed
[2025-02-05 16:25:16,283 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_read_R_speed
[2025-02-05 16:25:16,283 INFO  L130     BoogieDeclarations]: Found specification of procedure nxt_motor_get_count
[2025-02-05 16:25:16,283 INFO  L138     BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count
[2025-02-05 16:25:16,283 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 16:25:16,283 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_cs_t2
[2025-02-05 16:25:16,283 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2
[2025-02-05 16:25:16,283 INFO  L130     BoogieDeclarations]: Found specification of procedure ecrobot_set_nxtcolorsensor
[2025-02-05 16:25:16,283 INFO  L138     BoogieDeclarations]: Found implementation of procedure ecrobot_set_nxtcolorsensor
[2025-02-05 16:25:16,283 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_cs_t3
[2025-02-05 16:25:16,283 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_cs_t3
[2025-02-05 16:25:16,283 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_read_output
[2025-02-05 16:25:16,283 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_read_output
[2025-02-05 16:25:16,283 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_cs_t0
[2025-02-05 16:25:16,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0
[2025-02-05 16:25:16,284 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_write_T_count
[2025-02-05 16:25:16,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_write_T_count
[2025-02-05 16:25:16,284 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_cs_t1
[2025-02-05 16:25:16,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1
[2025-02-05 16:25:16,284 INFO  L130     BoogieDeclarations]: Found specification of procedure TerminateTask
[2025-02-05 16:25:16,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure TerminateTask
[2025-02-05 16:25:16,284 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_write_W_count
[2025-02-05 16:25:16,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_write_W_count
[2025-02-05 16:25:16,284 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_read___startrek_current_priority
[2025-02-05 16:25:16,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_read___startrek_current_priority
[2025-02-05 16:25:16,284 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_read_W_count
[2025-02-05 16:25:16,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_read_W_count
[2025-02-05 16:25:16,284 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_read_T_count
[2025-02-05 16:25:16,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_read_T_count
[2025-02-05 16:25:16,284 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_read_T_speed
[2025-02-05 16:25:16,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_read_T_speed
[2025-02-05 16:25:16,284 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_data_mode
[2025-02-05 16:25:16,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_data_mode
[2025-02-05 16:25:16,284 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_read_threshold
[2025-02-05 16:25:16,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_read_threshold
[2025-02-05 16:25:16,284 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_read
[2025-02-05 16:25:16,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_read
[2025-02-05 16:25:16,284 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_write_R_state
[2025-02-05 16:25:16,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_write_R_state
[2025-02-05 16:25:16,284 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Reader
[2025-02-05 16:25:16,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Reader
[2025-02-05 16:25:16,284 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_write_dir
[2025-02-05 16:25:16,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_write_dir
[2025-02-05 16:25:16,284 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_read_W_speed
[2025-02-05 16:25:16,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_read_W_speed
[2025-02-05 16:25:16,284 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_write_input
[2025-02-05 16:25:16,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_write_input
[2025-02-05 16:25:16,284 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_read_R_state
[2025-02-05 16:25:16,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_read_R_state
[2025-02-05 16:25:16,284 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_read_need_to_run_nxtbg
[2025-02-05 16:25:16,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_read_need_to_run_nxtbg
[2025-02-05 16:25:16,284 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_write_W_state
[2025-02-05 16:25:16,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_write_W_state
[2025-02-05 16:25:16,285 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_write_R_count
[2025-02-05 16:25:16,285 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_write_R_count
[2025-02-05 16:25:16,285 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_TapeMover
[2025-02-05 16:25:16,285 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_TapeMover
[2025-02-05 16:25:16,285 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 16:25:16,285 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2025-02-05 16:25:16,285 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#2
[2025-02-05 16:25:16,285 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#3
[2025-02-05 16:25:16,285 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#4
[2025-02-05 16:25:16,285 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#5
[2025-02-05 16:25:16,285 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#6
[2025-02-05 16:25:16,285 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#7
[2025-02-05 16:25:16,285 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#8
[2025-02-05 16:25:16,285 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#9
[2025-02-05 16:25:16,285 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#10
[2025-02-05 16:25:16,285 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#11
[2025-02-05 16:25:16,285 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#12
[2025-02-05 16:25:16,285 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#13
[2025-02-05 16:25:16,285 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#14
[2025-02-05 16:25:16,285 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#15
[2025-02-05 16:25:16,285 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#16
[2025-02-05 16:25:16,285 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#17
[2025-02-05 16:25:16,285 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#18
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#19
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#20
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#21
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#22
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#23
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#24
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#25
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#26
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#27
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#28
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#29
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#30
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#31
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#32
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#33
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#34
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#35
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#36
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#37
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#38
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#39
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#40
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#41
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#42
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#43
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#44
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#45
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#46
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#47
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#48
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Controller
[2025-02-05 16:25:16,289 INFO  L138     BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Controller
[2025-02-05 16:25:16,289 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 16:25:16,289 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 16:25:16,760 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 16:25:16,763 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 16:25:25,629 INFO  L?                        ?]: Removed 946 outVars from TransFormulas that were not future-live.
[2025-02-05 16:25:25,629 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 16:25:25,676 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 16:25:25,677 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 16:25:25,677 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:25:25 BoogieIcfgContainer
[2025-02-05 16:25:25,678 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 16:25:25,679 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 16:25:25,680 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 16:25:25,683 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 16:25:25,684 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:25:14" (1/3) ...
[2025-02-05 16:25:25,684 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20cc8d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:25:25, skipping insertion in model container
[2025-02-05 16:25:25,685 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:15" (2/3) ...
[2025-02-05 16:25:25,685 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20cc8d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:25:25, skipping insertion in model container
[2025-02-05 16:25:25,685 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:25:25" (3/3) ...
[2025-02-05 16:25:25,686 INFO  L128   eAbstractionObserver]: Analyzing ICFG rekh_ctm.4.c
[2025-02-05 16:25:25,696 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 16:25:25,699 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG rekh_ctm.4.c that has 45 procedures, 2469 locations, 1 initial locations, 0 loop locations, and 1 error locations.
[2025-02-05 16:25:25,796 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 16:25:25,804 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;@5ed5a05e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 16:25:25,804 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 16:25:25,814 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 2469 states, 2115 states have (on average 1.4799054373522458) internal successors, (3130), 2139 states have internal predecessors, (3130), 308 states have call successors, (308), 44 states have call predecessors, (308), 44 states have return successors, (308), 298 states have call predecessors, (308), 308 states have call successors, (308)
[2025-02-05 16:25:25,826 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 149
[2025-02-05 16:25:25,826 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:25:25,827 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:25:25,827 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:25:25,831 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:25:25,831 INFO  L85        PathProgramCache]: Analyzing trace with hash -1431802412, now seen corresponding path program 1 times
[2025-02-05 16:25:25,837 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:25:25,837 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088291771]
[2025-02-05 16:25:25,837 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:25:25,838 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:25:26,224 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes.
[2025-02-05 16:25:26,429 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements.
[2025-02-05 16:25:26,430 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:25:26,430 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:25:26,853 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:25:26,854 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:25:26,854 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088291771]
[2025-02-05 16:25:26,854 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088291771] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:25:26,854 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:25:26,855 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 16:25:26,856 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573937922]
[2025-02-05 16:25:26,857 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:25:26,860 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-05 16:25:26,861 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:25:26,879 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-05 16:25:26,880 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 16:25:26,888 INFO  L87              Difference]: Start difference. First operand  has 2469 states, 2115 states have (on average 1.4799054373522458) internal successors, (3130), 2139 states have internal predecessors, (3130), 308 states have call successors, (308), 44 states have call predecessors, (308), 44 states have return successors, (308), 298 states have call predecessors, (308), 308 states have call successors, (308) Second operand  has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-02-05 16:25:27,168 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:25:27,169 INFO  L93              Difference]: Finished difference Result 4929 states and 7742 transitions.
[2025-02-05 16:25:27,170 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-05 16:25:27,172 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 148
[2025-02-05 16:25:27,172 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:25:27,210 INFO  L225             Difference]: With dead ends: 4929
[2025-02-05 16:25:27,211 INFO  L226             Difference]: Without dead ends: 2456
[2025-02-05 16:25:27,246 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 16:25:27,247 INFO  L435           NwaCegarLoop]: 3050 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:25:27,250 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3050 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:25:27,266 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2456 states.
[2025-02-05 16:25:27,398 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2456 to 2456.
[2025-02-05 16:25:27,402 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2456 states, 2103 states have (on average 1.1535901093675702) internal successors, (2426), 2127 states have internal predecessors, (2426), 308 states have call successors, (308), 44 states have call predecessors, (308), 44 states have return successors, (307), 297 states have call predecessors, (307), 307 states have call successors, (307)
[2025-02-05 16:25:27,432 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2456 states and 3041 transitions.
[2025-02-05 16:25:27,436 INFO  L78                 Accepts]: Start accepts. Automaton has 2456 states and 3041 transitions. Word has length 148
[2025-02-05 16:25:27,438 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:25:27,438 INFO  L471      AbstractCegarLoop]: Abstraction has 2456 states and 3041 transitions.
[2025-02-05 16:25:27,438 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-02-05 16:25:27,439 INFO  L276                IsEmpty]: Start isEmpty. Operand 2456 states and 3041 transitions.
[2025-02-05 16:25:27,453 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 209
[2025-02-05 16:25:27,453 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:25:27,453 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 16:25:27,453 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 16:25:27,454 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:25:27,454 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:25:27,454 INFO  L85        PathProgramCache]: Analyzing trace with hash -2100952652, now seen corresponding path program 1 times
[2025-02-05 16:25:27,454 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:25:27,454 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375728492]
[2025-02-05 16:25:27,457 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:25:27,457 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:25:27,835 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes.
[2025-02-05 16:25:28,025 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements.
[2025-02-05 16:25:28,025 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:25:28,025 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:25:28,919 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-02-05 16:25:28,921 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:25:28,921 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375728492]
[2025-02-05 16:25:28,921 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375728492] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:25:28,921 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:25:28,921 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 16:25:28,922 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976945114]
[2025-02-05 16:25:28,922 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:25:28,923 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 16:25:28,923 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:25:28,924 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 16:25:28,925 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:25:28,925 INFO  L87              Difference]: Start difference. First operand 2456 states and 3041 transitions. Second operand  has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8)
[2025-02-05 16:25:31,898 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:25:31,898 INFO  L93              Difference]: Finished difference Result 5566 states and 6995 transitions.
[2025-02-05 16:25:31,899 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 16:25:31,899 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 208
[2025-02-05 16:25:31,901 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:25:31,916 INFO  L225             Difference]: With dead ends: 5566
[2025-02-05 16:25:31,917 INFO  L226             Difference]: Without dead ends: 3115
[2025-02-05 16:25:31,937 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2025-02-05 16:25:31,938 INFO  L435           NwaCegarLoop]: 3655 mSDtfsCounter, 3891 mSDsluCounter, 5596 mSDsCounter, 0 mSdLazyCounter, 2558 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3891 SdHoareTripleChecker+Valid, 9251 SdHoareTripleChecker+Invalid, 2569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time
[2025-02-05 16:25:31,938 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3891 Valid, 9251 Invalid, 2569 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 2558 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time]
[2025-02-05 16:25:31,944 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3115 states.
[2025-02-05 16:25:32,029 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 2979.
[2025-02-05 16:25:32,033 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2979 states, 2478 states have (on average 1.1864406779661016) internal successors, (2940), 2508 states have internal predecessors, (2940), 423 states have call successors, (423), 77 states have call predecessors, (423), 77 states have return successors, (422), 408 states have call predecessors, (422), 422 states have call successors, (422)
[2025-02-05 16:25:32,047 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2979 states to 2979 states and 3785 transitions.
[2025-02-05 16:25:32,050 INFO  L78                 Accepts]: Start accepts. Automaton has 2979 states and 3785 transitions. Word has length 208
[2025-02-05 16:25:32,052 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:25:32,052 INFO  L471      AbstractCegarLoop]: Abstraction has 2979 states and 3785 transitions.
[2025-02-05 16:25:32,052 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8)
[2025-02-05 16:25:32,053 INFO  L276                IsEmpty]: Start isEmpty. Operand 2979 states and 3785 transitions.
[2025-02-05 16:25:32,059 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 210
[2025-02-05 16:25:32,060 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:25:32,060 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 16:25:32,060 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 16:25:32,060 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:25:32,063 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:25:32,063 INFO  L85        PathProgramCache]: Analyzing trace with hash -1320700328, now seen corresponding path program 1 times
[2025-02-05 16:25:32,063 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:25:32,063 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961622661]
[2025-02-05 16:25:32,063 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:25:32,063 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:25:32,407 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes.
[2025-02-05 16:25:32,549 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements.
[2025-02-05 16:25:32,550 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:25:32,550 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:25:33,162 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-02-05 16:25:33,163 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:25:33,163 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961622661]
[2025-02-05 16:25:33,164 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961622661] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:25:33,164 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:25:33,164 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 16:25:33,164 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409902205]
[2025-02-05 16:25:33,164 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:25:33,164 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 16:25:33,165 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:25:33,165 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 16:25:33,166 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:25:33,166 INFO  L87              Difference]: Start difference. First operand 2979 states and 3785 transitions. Second operand  has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8)
[2025-02-05 16:25:35,240 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:25:35,241 INFO  L93              Difference]: Finished difference Result 6465 states and 8276 transitions.
[2025-02-05 16:25:35,241 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 16:25:35,241 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 209
[2025-02-05 16:25:35,242 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:25:35,260 INFO  L225             Difference]: With dead ends: 6465
[2025-02-05 16:25:35,260 INFO  L226             Difference]: Without dead ends: 3491
[2025-02-05 16:25:35,279 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2025-02-05 16:25:35,282 INFO  L435           NwaCegarLoop]: 3532 mSDtfsCounter, 6685 mSDsluCounter, 2729 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 801 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6685 SdHoareTripleChecker+Valid, 6261 SdHoareTripleChecker+Invalid, 2098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 801 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-02-05 16:25:35,282 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [6685 Valid, 6261 Invalid, 2098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [801 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-02-05 16:25:35,288 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3491 states.
[2025-02-05 16:25:35,408 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3491 to 3353.
[2025-02-05 16:25:35,413 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3353 states, 2754 states have (on average 1.2058823529411764) internal successors, (3321), 2793 states have internal predecessors, (3321), 500 states have call successors, (500), 98 states have call predecessors, (500), 98 states have return successors, (499), 481 states have call predecessors, (499), 499 states have call successors, (499)
[2025-02-05 16:25:35,428 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3353 states to 3353 states and 4320 transitions.
[2025-02-05 16:25:35,431 INFO  L78                 Accepts]: Start accepts. Automaton has 3353 states and 4320 transitions. Word has length 209
[2025-02-05 16:25:35,431 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:25:35,432 INFO  L471      AbstractCegarLoop]: Abstraction has 3353 states and 4320 transitions.
[2025-02-05 16:25:35,432 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8)
[2025-02-05 16:25:35,432 INFO  L276                IsEmpty]: Start isEmpty. Operand 3353 states and 4320 transitions.
[2025-02-05 16:25:35,437 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 206
[2025-02-05 16:25:35,439 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:25:35,439 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 16:25:35,439 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 16:25:35,440 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:25:35,440 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:25:35,441 INFO  L85        PathProgramCache]: Analyzing trace with hash 810369058, now seen corresponding path program 1 times
[2025-02-05 16:25:35,441 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:25:35,441 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059104338]
[2025-02-05 16:25:35,441 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:25:35,441 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:25:35,904 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes.
[2025-02-05 16:25:36,000 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements.
[2025-02-05 16:25:36,000 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:25:36,001 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:25:37,347 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-02-05 16:25:37,348 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:25:37,348 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059104338]
[2025-02-05 16:25:37,349 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059104338] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:25:37,349 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:25:37,349 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:25:37,349 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950956720]
[2025-02-05 16:25:37,349 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:25:37,349 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:25:37,349 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:25:37,350 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:25:37,350 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:25:37,350 INFO  L87              Difference]: Start difference. First operand 3353 states and 4320 transitions. Second operand  has 5 states, 4 states have (on average 45.5) internal successors, (182), 5 states have internal predecessors, (182), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7)
[2025-02-05 16:25:39,131 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:25:39,131 INFO  L93              Difference]: Finished difference Result 7075 states and 9180 transitions.
[2025-02-05 16:25:39,131 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:25:39,131 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 45.5) internal successors, (182), 5 states have internal predecessors, (182), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 205
[2025-02-05 16:25:39,132 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:25:39,148 INFO  L225             Difference]: With dead ends: 7075
[2025-02-05 16:25:39,148 INFO  L226             Difference]: Without dead ends: 3727
[2025-02-05 16:25:39,158 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:25:39,160 INFO  L435           NwaCegarLoop]: 3426 mSDtfsCounter, 5712 mSDsluCounter, 2607 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5712 SdHoareTripleChecker+Valid, 6033 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 581 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-02-05 16:25:39,161 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5712 Valid, 6033 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [581 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-02-05 16:25:39,165 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3727 states.
[2025-02-05 16:25:39,256 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3725.
[2025-02-05 16:25:39,261 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3725 states, 3029 states have (on average 1.2218553978210631) internal successors, (3701), 3074 states have internal predecessors, (3701), 577 states have call successors, (577), 118 states have call predecessors, (577), 118 states have return successors, (576), 556 states have call predecessors, (576), 576 states have call successors, (576)
[2025-02-05 16:25:39,273 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3725 states to 3725 states and 4854 transitions.
[2025-02-05 16:25:39,275 INFO  L78                 Accepts]: Start accepts. Automaton has 3725 states and 4854 transitions. Word has length 205
[2025-02-05 16:25:39,276 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:25:39,276 INFO  L471      AbstractCegarLoop]: Abstraction has 3725 states and 4854 transitions.
[2025-02-05 16:25:39,276 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 45.5) internal successors, (182), 5 states have internal predecessors, (182), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7)
[2025-02-05 16:25:39,276 INFO  L276                IsEmpty]: Start isEmpty. Operand 3725 states and 4854 transitions.
[2025-02-05 16:25:39,280 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 209
[2025-02-05 16:25:39,280 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:25:39,280 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 16:25:39,280 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 16:25:39,280 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:25:39,281 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:25:39,281 INFO  L85        PathProgramCache]: Analyzing trace with hash 523449504, now seen corresponding path program 1 times
[2025-02-05 16:25:39,281 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:25:39,281 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035740710]
[2025-02-05 16:25:39,281 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:25:39,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:25:39,570 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes.
[2025-02-05 16:25:39,642 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements.
[2025-02-05 16:25:39,642 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:25:39,642 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:25:40,073 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-02-05 16:25:40,074 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:25:40,074 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035740710]
[2025-02-05 16:25:40,074 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035740710] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 16:25:40,074 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29382468]
[2025-02-05 16:25:40,074 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:25:40,074 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 16:25:40,074 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 16:25:40,080 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 16:25:40,084 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 16:25:40,966 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes.
[2025-02-05 16:25:41,215 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements.
[2025-02-05 16:25:41,215 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:25:41,215 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:25:41,227 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2846 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-02-05 16:25:41,236 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 16:25:41,311 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-02-05 16:25:41,312 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 16:25:41,312 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [29382468] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:25:41,312 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 16:25:41,312 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8
[2025-02-05 16:25:41,312 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015172814]
[2025-02-05 16:25:41,312 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:25:41,313 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:25:41,313 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:25:41,313 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:25:41,313 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-02-05 16:25:41,313 INFO  L87              Difference]: Start difference. First operand 3725 states and 4854 transitions. Second operand  has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8)
[2025-02-05 16:25:42,578 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:25:42,578 INFO  L93              Difference]: Finished difference Result 7682 states and 9997 transitions.
[2025-02-05 16:25:42,579 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 16:25:42,579 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 208
[2025-02-05 16:25:42,579 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:25:42,596 INFO  L225             Difference]: With dead ends: 7682
[2025-02-05 16:25:42,596 INFO  L226             Difference]: Without dead ends: 3848
[2025-02-05 16:25:42,609 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2025-02-05 16:25:42,610 INFO  L435           NwaCegarLoop]: 3604 mSDtfsCounter, 1465 mSDsluCounter, 6346 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 9950 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:25:42,610 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 9950 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-05 16:25:42,613 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3848 states.
[2025-02-05 16:25:42,697 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3848 to 3712.
[2025-02-05 16:25:42,702 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3712 states, 3021 states have (on average 1.2204568023833169) internal successors, (3687), 3066 states have internal predecessors, (3687), 572 states have call successors, (572), 118 states have call predecessors, (572), 118 states have return successors, (571), 551 states have call predecessors, (571), 571 states have call successors, (571)
[2025-02-05 16:25:42,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 4830 transitions.
[2025-02-05 16:25:42,719 INFO  L78                 Accepts]: Start accepts. Automaton has 3712 states and 4830 transitions. Word has length 208
[2025-02-05 16:25:42,719 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:25:42,719 INFO  L471      AbstractCegarLoop]: Abstraction has 3712 states and 4830 transitions.
[2025-02-05 16:25:42,719 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8)
[2025-02-05 16:25:42,720 INFO  L276                IsEmpty]: Start isEmpty. Operand 3712 states and 4830 transitions.
[2025-02-05 16:25:42,723 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 210
[2025-02-05 16:25:42,723 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:25:42,723 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 16:25:42,736 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 16:25:42,927 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 16:25:42,927 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:25:42,928 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:25:42,928 INFO  L85        PathProgramCache]: Analyzing trace with hash -1985595834, now seen corresponding path program 1 times
[2025-02-05 16:25:42,928 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:25:42,929 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905582402]
[2025-02-05 16:25:42,929 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:25:42,929 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:25:43,249 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes.
[2025-02-05 16:25:43,301 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements.
[2025-02-05 16:25:43,301 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:25:43,301 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:25:43,679 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-02-05 16:25:43,680 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:25:43,680 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905582402]
[2025-02-05 16:25:43,680 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905582402] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 16:25:43,680 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331994701]
[2025-02-05 16:25:43,680 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:25:43,680 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 16:25:43,680 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 16:25:43,684 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 16:25:43,686 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 16:25:44,524 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes.
[2025-02-05 16:25:44,772 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements.
[2025-02-05 16:25:44,773 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:25:44,773 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:25:44,783 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2848 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-05 16:25:44,792 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 16:25:44,895 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-02-05 16:25:44,896 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 16:25:44,896 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [331994701] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:25:44,896 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 16:25:44,896 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8
[2025-02-05 16:25:44,896 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637032335]
[2025-02-05 16:25:44,896 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:25:44,897 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:25:44,897 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:25:44,897 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:25:44,897 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-02-05 16:25:44,897 INFO  L87              Difference]: Start difference. First operand 3712 states and 4830 transitions. Second operand  has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8)
[2025-02-05 16:25:46,264 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:25:46,264 INFO  L93              Difference]: Finished difference Result 7613 states and 9892 transitions.
[2025-02-05 16:25:46,265 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 16:25:46,265 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 209
[2025-02-05 16:25:46,265 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:25:46,283 INFO  L225             Difference]: With dead ends: 7613
[2025-02-05 16:25:46,284 INFO  L226             Difference]: Without dead ends: 3840
[2025-02-05 16:25:46,341 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2025-02-05 16:25:46,343 INFO  L435           NwaCegarLoop]: 3578 mSDtfsCounter, 1205 mSDsluCounter, 8716 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 12294 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-05 16:25:46,343 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 12294 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-05 16:25:46,346 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3840 states.
[2025-02-05 16:25:46,415 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3840 to 3702.
[2025-02-05 16:25:46,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3702 states, 3015 states have (on average 1.2192371475953565) internal successors, (3676), 3060 states have internal predecessors, (3676), 568 states have call successors, (568), 118 states have call predecessors, (568), 118 states have return successors, (567), 547 states have call predecessors, (567), 567 states have call successors, (567)
[2025-02-05 16:25:46,433 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3702 states to 3702 states and 4811 transitions.
[2025-02-05 16:25:46,436 INFO  L78                 Accepts]: Start accepts. Automaton has 3702 states and 4811 transitions. Word has length 209
[2025-02-05 16:25:46,436 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:25:46,436 INFO  L471      AbstractCegarLoop]: Abstraction has 3702 states and 4811 transitions.
[2025-02-05 16:25:46,437 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8)
[2025-02-05 16:25:46,437 INFO  L276                IsEmpty]: Start isEmpty. Operand 3702 states and 4811 transitions.
[2025-02-05 16:25:46,440 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 211
[2025-02-05 16:25:46,440 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:25:46,441 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 16:25:46,453 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 16:25:46,641 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 16:25:46,641 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:25:46,642 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:25:46,642 INFO  L85        PathProgramCache]: Analyzing trace with hash 2087086975, now seen corresponding path program 1 times
[2025-02-05 16:25:46,642 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:25:46,642 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669856533]
[2025-02-05 16:25:46,642 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:25:46,642 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:25:46,932 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes.
[2025-02-05 16:25:46,976 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements.
[2025-02-05 16:25:46,976 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:25:46,976 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:25:47,456 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-02-05 16:25:47,456 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:25:47,456 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669856533]
[2025-02-05 16:25:47,456 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669856533] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 16:25:47,456 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298425844]
[2025-02-05 16:25:47,456 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:25:47,456 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 16:25:47,457 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 16:25:47,462 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 16:25:47,463 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 16:25:48,339 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes.
[2025-02-05 16:25:48,585 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements.
[2025-02-05 16:25:48,585 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:25:48,585 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:25:48,596 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2850 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-05 16:25:48,601 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 16:25:48,689 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-02-05 16:25:48,689 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 16:25:48,689 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298425844] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:25:48,689 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 16:25:48,690 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8
[2025-02-05 16:25:48,690 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736165496]
[2025-02-05 16:25:48,690 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:25:48,690 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:25:48,690 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:25:48,691 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:25:48,691 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-02-05 16:25:48,691 INFO  L87              Difference]: Start difference. First operand 3702 states and 4811 transitions. Second operand  has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8)
[2025-02-05 16:25:50,423 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:25:50,424 INFO  L93              Difference]: Finished difference Result 8202 states and 10659 transitions.
[2025-02-05 16:25:50,424 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 16:25:50,424 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 210
[2025-02-05 16:25:50,424 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:25:50,445 INFO  L225             Difference]: With dead ends: 8202
[2025-02-05 16:25:50,446 INFO  L226             Difference]: Without dead ends: 4505
[2025-02-05 16:25:50,460 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2025-02-05 16:25:50,461 INFO  L435           NwaCegarLoop]: 3793 mSDtfsCounter, 1718 mSDsluCounter, 6877 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1718 SdHoareTripleChecker+Valid, 10670 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-05 16:25:50,461 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1718 Valid, 10670 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-05 16:25:50,466 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4505 states.
[2025-02-05 16:25:50,580 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4505 to 4176.
[2025-02-05 16:25:50,585 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4176 states, 3357 states have (on average 1.2347333929103366) internal successors, (4145), 3413 states have internal predecessors, (4145), 676 states have call successors, (676), 141 states have call predecessors, (676), 142 states have return successors, (676), 651 states have call predecessors, (676), 675 states have call successors, (676)
[2025-02-05 16:25:50,598 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 5497 transitions.
[2025-02-05 16:25:50,607 INFO  L78                 Accepts]: Start accepts. Automaton has 4176 states and 5497 transitions. Word has length 210
[2025-02-05 16:25:50,608 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:25:50,608 INFO  L471      AbstractCegarLoop]: Abstraction has 4176 states and 5497 transitions.
[2025-02-05 16:25:50,608 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8)
[2025-02-05 16:25:50,608 INFO  L276                IsEmpty]: Start isEmpty. Operand 4176 states and 5497 transitions.
[2025-02-05 16:25:50,614 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 211
[2025-02-05 16:25:50,614 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:25:50,615 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 16:25:50,629 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-02-05 16:25:50,815 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 16:25:50,816 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:25:50,817 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:25:50,817 INFO  L85        PathProgramCache]: Analyzing trace with hash 1425174083, now seen corresponding path program 1 times
[2025-02-05 16:25:50,817 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:25:50,817 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836317363]
[2025-02-05 16:25:50,817 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:25:50,817 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:25:51,106 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes.
[2025-02-05 16:25:51,143 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements.
[2025-02-05 16:25:51,143 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:25:51,143 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:25:51,543 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-02-05 16:25:51,544 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:25:51,544 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836317363]
[2025-02-05 16:25:51,544 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836317363] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 16:25:51,544 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957295049]
[2025-02-05 16:25:51,544 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:25:51,544 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 16:25:51,545 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 16:25:51,547 INFO  L229       MonitoredProcess]: Starting monitored process 5 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 16:25:51,556 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-02-05 16:25:52,393 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes.
[2025-02-05 16:25:52,657 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements.
[2025-02-05 16:25:52,657 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:25:52,657 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:25:52,671 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2848 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-05 16:25:52,677 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 16:25:52,773 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-02-05 16:25:52,773 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 16:25:52,773 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957295049] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:25:52,773 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 16:25:52,773 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8
[2025-02-05 16:25:52,773 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631926710]
[2025-02-05 16:25:52,773 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:25:52,773 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:25:52,773 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:25:52,774 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:25:52,774 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-02-05 16:25:52,774 INFO  L87              Difference]: Start difference. First operand 4176 states and 5497 transitions. Second operand  has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8)
[2025-02-05 16:25:53,828 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:25:53,828 INFO  L93              Difference]: Finished difference Result 8349 states and 11000 transitions.
[2025-02-05 16:25:53,829 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:25:53,829 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 210
[2025-02-05 16:25:53,829 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:25:53,848 INFO  L225             Difference]: With dead ends: 8349
[2025-02-05 16:25:53,849 INFO  L226             Difference]: Without dead ends: 4178
[2025-02-05 16:25:53,863 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2025-02-05 16:25:53,863 INFO  L435           NwaCegarLoop]: 2953 mSDtfsCounter, 1039 mSDsluCounter, 5769 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 8722 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 16:25:53,864 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 8722 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 16:25:53,867 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4178 states.
[2025-02-05 16:25:53,958 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4178 to 4176.
[2025-02-05 16:25:53,962 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4176 states, 3357 states have (on average 1.2344355078939528) internal successors, (4144), 3413 states have internal predecessors, (4144), 676 states have call successors, (676), 141 states have call predecessors, (676), 142 states have return successors, (676), 651 states have call predecessors, (676), 675 states have call successors, (676)
[2025-02-05 16:25:53,973 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 5496 transitions.
[2025-02-05 16:25:53,977 INFO  L78                 Accepts]: Start accepts. Automaton has 4176 states and 5496 transitions. Word has length 210
[2025-02-05 16:25:53,977 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:25:53,977 INFO  L471      AbstractCegarLoop]: Abstraction has 4176 states and 5496 transitions.
[2025-02-05 16:25:53,978 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8)
[2025-02-05 16:25:53,978 INFO  L276                IsEmpty]: Start isEmpty. Operand 4176 states and 5496 transitions.
[2025-02-05 16:25:53,983 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 221
[2025-02-05 16:25:53,983 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:25:53,983 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 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]
[2025-02-05 16:25:53,994 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-02-05 16:25:54,188 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7
[2025-02-05 16:25:54,188 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:25:54,189 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:25:54,189 INFO  L85        PathProgramCache]: Analyzing trace with hash -104316833, now seen corresponding path program 1 times
[2025-02-05 16:25:54,189 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:25:54,189 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879512005]
[2025-02-05 16:25:54,189 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:25:54,189 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:25:54,465 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes.
[2025-02-05 16:25:54,503 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements.
[2025-02-05 16:25:54,503 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:25:54,503 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:25:55,011 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-02-05 16:25:55,011 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:25:55,011 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879512005]
[2025-02-05 16:25:55,011 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879512005] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:25:55,011 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:25:55,011 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 16:25:55,012 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735050270]
[2025-02-05 16:25:55,012 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:25:55,012 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 16:25:55,012 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:25:55,013 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 16:25:55,013 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:25:55,013 INFO  L87              Difference]: Start difference. First operand 4176 states and 5496 transitions. Second operand  has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9)
[2025-02-05 16:25:57,156 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:25:57,156 INFO  L93              Difference]: Finished difference Result 7867 states and 10296 transitions.
[2025-02-05 16:25:57,156 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:25:57,157 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 220
[2025-02-05 16:25:57,157 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:25:57,205 INFO  L225             Difference]: With dead ends: 7867
[2025-02-05 16:25:57,205 INFO  L226             Difference]: Without dead ends: 3696
[2025-02-05 16:25:57,221 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2025-02-05 16:25:57,224 INFO  L435           NwaCegarLoop]: 3496 mSDtfsCounter, 4661 mSDsluCounter, 3454 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4661 SdHoareTripleChecker+Valid, 6950 SdHoareTripleChecker+Invalid, 2107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-02-05 16:25:57,224 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4661 Valid, 6950 Invalid, 2107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1801 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-02-05 16:25:57,228 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3696 states.
[2025-02-05 16:25:57,307 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3696 to 3694.
[2025-02-05 16:25:57,312 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3694 states, 3010 states have (on average 1.217607973421927) internal successors, (3665), 3055 states have internal predecessors, (3665), 565 states have call successors, (565), 118 states have call predecessors, (565), 118 states have return successors, (564), 544 states have call predecessors, (564), 564 states have call successors, (564)
[2025-02-05 16:25:57,322 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 3694 states and 4794 transitions.
[2025-02-05 16:25:57,326 INFO  L78                 Accepts]: Start accepts. Automaton has 3694 states and 4794 transitions. Word has length 220
[2025-02-05 16:25:57,327 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:25:57,328 INFO  L471      AbstractCegarLoop]: Abstraction has 3694 states and 4794 transitions.
[2025-02-05 16:25:57,328 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9)
[2025-02-05 16:25:57,328 INFO  L276                IsEmpty]: Start isEmpty. Operand 3694 states and 4794 transitions.
[2025-02-05 16:25:57,331 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 221
[2025-02-05 16:25:57,331 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:25:57,331 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 16:25:57,331 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 16:25:57,332 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:25:57,333 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:25:57,333 INFO  L85        PathProgramCache]: Analyzing trace with hash 1540529699, now seen corresponding path program 1 times
[2025-02-05 16:25:57,333 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:25:57,333 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741936766]
[2025-02-05 16:25:57,333 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:25:57,333 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:25:57,647 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes.
[2025-02-05 16:25:57,686 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements.
[2025-02-05 16:25:57,687 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:25:57,687 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:25:57,998 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-02-05 16:25:57,999 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:25:57,999 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741936766]
[2025-02-05 16:25:57,999 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741936766] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 16:25:57,999 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683925944]
[2025-02-05 16:25:57,999 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:25:57,999 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 16:25:57,999 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 16:25:58,001 INFO  L229       MonitoredProcess]: Starting monitored process 6 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 16:25:58,005 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-02-05 16:25:58,867 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes.
[2025-02-05 16:25:59,092 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements.
[2025-02-05 16:25:59,093 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:25:59,093 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:25:59,103 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2876 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-05 16:25:59,109 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 16:25:59,163 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-02-05 16:25:59,163 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 16:25:59,163 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [683925944] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:25:59,163 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 16:25:59,163 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7
[2025-02-05 16:25:59,163 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808045619]
[2025-02-05 16:25:59,164 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:25:59,164 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:25:59,164 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:25:59,164 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:25:59,164 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2025-02-05 16:25:59,165 INFO  L87              Difference]: Start difference. First operand 3694 states and 4794 transitions. Second operand  has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9)
[2025-02-05 16:26:00,484 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:26:00,485 INFO  L93              Difference]: Finished difference Result 7383 states and 9591 transitions.
[2025-02-05 16:26:00,485 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:26:00,485 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 220
[2025-02-05 16:26:00,485 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:26:00,517 INFO  L225             Difference]: With dead ends: 7383
[2025-02-05 16:26:00,517 INFO  L226             Difference]: Without dead ends: 3694
[2025-02-05 16:26:00,531 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2025-02-05 16:26:00,531 INFO  L435           NwaCegarLoop]: 3066 mSDtfsCounter, 2533 mSDsluCounter, 4041 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 7107 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-05 16:26:00,532 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 7107 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-05 16:26:00,535 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3694 states.
[2025-02-05 16:26:00,611 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3692.
[2025-02-05 16:26:00,614 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3692 states, 3009 states have (on average 1.2173479561316052) internal successors, (3663), 3054 states have internal predecessors, (3663), 564 states have call successors, (564), 118 states have call predecessors, (564), 118 states have return successors, (563), 543 states have call predecessors, (563), 563 states have call successors, (563)
[2025-02-05 16:26:00,624 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3692 states and 4790 transitions.
[2025-02-05 16:26:00,628 INFO  L78                 Accepts]: Start accepts. Automaton has 3692 states and 4790 transitions. Word has length 220
[2025-02-05 16:26:00,628 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:26:00,628 INFO  L471      AbstractCegarLoop]: Abstraction has 3692 states and 4790 transitions.
[2025-02-05 16:26:00,628 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9)
[2025-02-05 16:26:00,628 INFO  L276                IsEmpty]: Start isEmpty. Operand 3692 states and 4790 transitions.
[2025-02-05 16:26:00,632 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 221
[2025-02-05 16:26:00,633 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:26:00,633 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 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]
[2025-02-05 16:26:00,644 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-02-05 16:26:00,834 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2025-02-05 16:26:00,834 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:26:00,835 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:26:00,835 INFO  L85        PathProgramCache]: Analyzing trace with hash 1302251911, now seen corresponding path program 1 times
[2025-02-05 16:26:00,835 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:26:00,835 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273892050]
[2025-02-05 16:26:00,835 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:26:00,835 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:26:01,120 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes.
[2025-02-05 16:26:01,155 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements.
[2025-02-05 16:26:01,156 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:26:01,156 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:26:01,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2025-02-05 16:26:01,520 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:26:01,520 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273892050]
[2025-02-05 16:26:01,520 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273892050] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:26:01,520 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:26:01,520 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 16:26:01,520 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112483251]
[2025-02-05 16:26:01,520 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:26:01,520 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 16:26:01,520 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:26:01,521 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 16:26:01,521 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:26:01,521 INFO  L87              Difference]: Start difference. First operand 3692 states and 4790 transitions. Second operand  has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9)
[2025-02-05 16:26:03,455 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:26:03,456 INFO  L93              Difference]: Finished difference Result 7381 states and 9585 transitions.
[2025-02-05 16:26:03,456 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:26:03,456 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 220
[2025-02-05 16:26:03,456 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:26:03,471 INFO  L225             Difference]: With dead ends: 7381
[2025-02-05 16:26:03,471 INFO  L226             Difference]: Without dead ends: 3694
[2025-02-05 16:26:03,485 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2025-02-05 16:26:03,486 INFO  L435           NwaCegarLoop]: 3398 mSDtfsCounter, 6470 mSDsluCounter, 2587 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 809 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6470 SdHoareTripleChecker+Valid, 5985 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 809 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-02-05 16:26:03,487 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [6470 Valid, 5985 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [809 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-02-05 16:26:03,492 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3694 states.
[2025-02-05 16:26:03,571 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3692.
[2025-02-05 16:26:03,575 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3692 states, 3009 states have (on average 1.217015619807245) internal successors, (3662), 3054 states have internal predecessors, (3662), 564 states have call successors, (564), 118 states have call predecessors, (564), 118 states have return successors, (563), 543 states have call predecessors, (563), 563 states have call successors, (563)
[2025-02-05 16:26:03,585 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3692 states and 4789 transitions.
[2025-02-05 16:26:03,589 INFO  L78                 Accepts]: Start accepts. Automaton has 3692 states and 4789 transitions. Word has length 220
[2025-02-05 16:26:03,589 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:26:03,589 INFO  L471      AbstractCegarLoop]: Abstraction has 3692 states and 4789 transitions.
[2025-02-05 16:26:03,589 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9)
[2025-02-05 16:26:03,589 INFO  L276                IsEmpty]: Start isEmpty. Operand 3692 states and 4789 transitions.
[2025-02-05 16:26:03,592 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 224
[2025-02-05 16:26:03,592 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:26:03,592 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 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]
[2025-02-05 16:26:03,593 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 16:26:03,593 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:26:03,593 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:26:03,593 INFO  L85        PathProgramCache]: Analyzing trace with hash -559423823, now seen corresponding path program 1 times
[2025-02-05 16:26:03,593 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:26:03,593 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453328673]
[2025-02-05 16:26:03,593 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:26:03,593 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:26:03,859 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes.
[2025-02-05 16:26:03,893 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements.
[2025-02-05 16:26:03,893 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:26:03,893 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:26:04,298 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2025-02-05 16:26:04,298 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:26:04,298 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453328673]
[2025-02-05 16:26:04,298 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453328673] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:26:04,298 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:26:04,298 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 16:26:04,298 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249967751]
[2025-02-05 16:26:04,298 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:26:04,300 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 16:26:04,300 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:26:04,300 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 16:26:04,300 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:26:04,301 INFO  L87              Difference]: Start difference. First operand 3692 states and 4789 transitions. Second operand  has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10)
[2025-02-05 16:26:06,186 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:26:06,186 INFO  L93              Difference]: Finished difference Result 7513 states and 9731 transitions.
[2025-02-05 16:26:06,187 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 16:26:06,187 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 223
[2025-02-05 16:26:06,187 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:26:06,203 INFO  L225             Difference]: With dead ends: 7513
[2025-02-05 16:26:06,203 INFO  L226             Difference]: Without dead ends: 3826
[2025-02-05 16:26:06,216 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2025-02-05 16:26:06,217 INFO  L435           NwaCegarLoop]: 3631 mSDtfsCounter, 5830 mSDsluCounter, 4584 mSDsCounter, 0 mSdLazyCounter, 2045 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5830 SdHoareTripleChecker+Valid, 8215 SdHoareTripleChecker+Invalid, 2535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 2045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-02-05 16:26:06,217 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5830 Valid, 8215 Invalid, 2535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 2045 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-02-05 16:26:06,221 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3826 states.
[2025-02-05 16:26:06,300 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3826 to 3690.
[2025-02-05 16:26:06,304 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3690 states, 3008 states have (on average 1.2167553191489362) internal successors, (3660), 3053 states have internal predecessors, (3660), 563 states have call successors, (563), 118 states have call predecessors, (563), 118 states have return successors, (562), 542 states have call predecessors, (562), 562 states have call successors, (562)
[2025-02-05 16:26:06,314 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 4785 transitions.
[2025-02-05 16:26:06,319 INFO  L78                 Accepts]: Start accepts. Automaton has 3690 states and 4785 transitions. Word has length 223
[2025-02-05 16:26:06,320 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:26:06,320 INFO  L471      AbstractCegarLoop]: Abstraction has 3690 states and 4785 transitions.
[2025-02-05 16:26:06,320 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10)
[2025-02-05 16:26:06,320 INFO  L276                IsEmpty]: Start isEmpty. Operand 3690 states and 4785 transitions.
[2025-02-05 16:26:06,323 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 225
[2025-02-05 16:26:06,323 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:26:06,323 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 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]
[2025-02-05 16:26:06,323 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 16:26:06,323 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:26:06,324 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:26:06,324 INFO  L85        PathProgramCache]: Analyzing trace with hash 40677408, now seen corresponding path program 1 times
[2025-02-05 16:26:06,324 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:26:06,324 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134712287]
[2025-02-05 16:26:06,324 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:26:06,324 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:26:06,624 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes.
[2025-02-05 16:26:06,658 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements.
[2025-02-05 16:26:06,659 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:26:06,659 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:26:06,978 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2025-02-05 16:26:06,979 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:26:06,979 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134712287]
[2025-02-05 16:26:06,979 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134712287] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:26:06,979 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:26:06,979 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 16:26:06,979 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545604131]
[2025-02-05 16:26:06,979 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:26:06,979 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 16:26:06,979 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:26:06,980 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 16:26:06,980 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:26:06,980 INFO  L87              Difference]: Start difference. First operand 3690 states and 4785 transitions. Second operand  has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10)
[2025-02-05 16:26:08,682 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:26:08,682 INFO  L93              Difference]: Finished difference Result 7509 states and 9723 transitions.
[2025-02-05 16:26:08,682 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 16:26:08,683 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 224
[2025-02-05 16:26:08,683 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:26:08,699 INFO  L225             Difference]: With dead ends: 7509
[2025-02-05 16:26:08,700 INFO  L226             Difference]: Without dead ends: 3824
[2025-02-05 16:26:08,714 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2025-02-05 16:26:08,716 INFO  L435           NwaCegarLoop]: 3509 mSDtfsCounter, 4705 mSDsluCounter, 3608 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4705 SdHoareTripleChecker+Valid, 7117 SdHoareTripleChecker+Invalid, 1856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-05 16:26:08,716 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4705 Valid, 7117 Invalid, 1856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-05 16:26:08,720 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3824 states.
[2025-02-05 16:26:08,803 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3824 to 3686.
[2025-02-05 16:26:08,808 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3686 states, 3006 states have (on average 1.2162341982701264) internal successors, (3656), 3051 states have internal predecessors, (3656), 561 states have call successors, (561), 118 states have call predecessors, (561), 118 states have return successors, (560), 540 states have call predecessors, (560), 560 states have call successors, (560)
[2025-02-05 16:26:08,819 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 4777 transitions.
[2025-02-05 16:26:08,824 INFO  L78                 Accepts]: Start accepts. Automaton has 3686 states and 4777 transitions. Word has length 224
[2025-02-05 16:26:08,824 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:26:08,824 INFO  L471      AbstractCegarLoop]: Abstraction has 3686 states and 4777 transitions.
[2025-02-05 16:26:08,824 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10)
[2025-02-05 16:26:08,825 INFO  L276                IsEmpty]: Start isEmpty. Operand 3686 states and 4777 transitions.
[2025-02-05 16:26:08,827 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2025-02-05 16:26:08,828 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:26:08,828 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 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]
[2025-02-05 16:26:08,828 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 16:26:08,828 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:26:08,829 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:26:08,829 INFO  L85        PathProgramCache]: Analyzing trace with hash -2017252176, now seen corresponding path program 1 times
[2025-02-05 16:26:08,829 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:26:08,829 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691308764]
[2025-02-05 16:26:08,829 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:26:08,829 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:26:09,138 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes.
[2025-02-05 16:26:09,174 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements.
[2025-02-05 16:26:09,174 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:26:09,174 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:26:09,493 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2025-02-05 16:26:09,493 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:26:09,493 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691308764]
[2025-02-05 16:26:09,493 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691308764] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:26:09,493 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:26:09,493 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 16:26:09,493 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159268297]
[2025-02-05 16:26:09,493 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:26:09,494 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 16:26:09,494 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:26:09,494 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 16:26:09,494 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:26:09,495 INFO  L87              Difference]: Start difference. First operand 3686 states and 4777 transitions. Second operand  has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10)
[2025-02-05 16:26:11,586 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:26:11,587 INFO  L93              Difference]: Finished difference Result 7365 states and 9555 transitions.
[2025-02-05 16:26:11,587 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 16:26:11,587 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 225
[2025-02-05 16:26:11,587 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:26:11,600 INFO  L225             Difference]: With dead ends: 7365
[2025-02-05 16:26:11,601 INFO  L226             Difference]: Without dead ends: 3684
[2025-02-05 16:26:11,614 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2025-02-05 16:26:11,615 INFO  L435           NwaCegarLoop]: 3483 mSDtfsCounter, 5736 mSDsluCounter, 4477 mSDsCounter, 0 mSdLazyCounter, 2102 mSolverCounterSat, 547 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5736 SdHoareTripleChecker+Valid, 7960 SdHoareTripleChecker+Invalid, 2649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 547 IncrementalHoareTripleChecker+Valid, 2102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-02-05 16:26:11,615 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5736 Valid, 7960 Invalid, 2649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [547 Valid, 2102 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-02-05 16:26:11,618 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3684 states.
[2025-02-05 16:26:11,732 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 3682.
[2025-02-05 16:26:11,735 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3682 states, 3004 states have (on average 1.2157123834886818) internal successors, (3652), 3049 states have internal predecessors, (3652), 559 states have call successors, (559), 118 states have call predecessors, (559), 118 states have return successors, (558), 538 states have call predecessors, (558), 558 states have call successors, (558)
[2025-02-05 16:26:11,744 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4769 transitions.
[2025-02-05 16:26:11,748 INFO  L78                 Accepts]: Start accepts. Automaton has 3682 states and 4769 transitions. Word has length 225
[2025-02-05 16:26:11,748 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:26:11,748 INFO  L471      AbstractCegarLoop]: Abstraction has 3682 states and 4769 transitions.
[2025-02-05 16:26:11,748 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10)
[2025-02-05 16:26:11,748 INFO  L276                IsEmpty]: Start isEmpty. Operand 3682 states and 4769 transitions.
[2025-02-05 16:26:11,751 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2025-02-05 16:26:11,751 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:26:11,751 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 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]
[2025-02-05 16:26:11,751 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 16:26:11,752 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:26:11,752 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:26:11,752 INFO  L85        PathProgramCache]: Analyzing trace with hash -160102401, now seen corresponding path program 1 times
[2025-02-05 16:26:11,752 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:26:11,752 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940683748]
[2025-02-05 16:26:11,752 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:26:11,752 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:26:12,033 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes.
[2025-02-05 16:26:12,067 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements.
[2025-02-05 16:26:12,068 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:26:12,068 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:26:12,368 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2025-02-05 16:26:12,369 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:26:12,369 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940683748]
[2025-02-05 16:26:12,369 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940683748] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:26:12,369 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:26:12,369 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 16:26:12,369 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323885045]
[2025-02-05 16:26:12,369 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:26:12,370 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 16:26:12,370 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:26:12,370 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 16:26:12,370 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:26:12,370 INFO  L87              Difference]: Start difference. First operand 3682 states and 4769 transitions. Second operand  has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10)
[2025-02-05 16:26:14,639 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:26:14,640 INFO  L93              Difference]: Finished difference Result 7361 states and 9543 transitions.
[2025-02-05 16:26:14,640 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:26:14,640 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 225
[2025-02-05 16:26:14,640 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:26:14,652 INFO  L225             Difference]: With dead ends: 7361
[2025-02-05 16:26:14,653 INFO  L226             Difference]: Without dead ends: 3684
[2025-02-05 16:26:14,666 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2025-02-05 16:26:14,666 INFO  L435           NwaCegarLoop]: 3377 mSDtfsCounter, 5636 mSDsluCounter, 4438 mSDsCounter, 0 mSdLazyCounter, 2046 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5636 SdHoareTripleChecker+Valid, 7815 SdHoareTripleChecker+Invalid, 2620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 2046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:26:14,666 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5636 Valid, 7815 Invalid, 2620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 2046 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-02-05 16:26:14,669 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3684 states.
[2025-02-05 16:26:14,744 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 3682.
[2025-02-05 16:26:14,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3682 states, 3004 states have (on average 1.2153794940079894) internal successors, (3651), 3049 states have internal predecessors, (3651), 559 states have call successors, (559), 118 states have call predecessors, (559), 118 states have return successors, (558), 538 states have call predecessors, (558), 558 states have call successors, (558)
[2025-02-05 16:26:14,758 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4768 transitions.
[2025-02-05 16:26:14,762 INFO  L78                 Accepts]: Start accepts. Automaton has 3682 states and 4768 transitions. Word has length 225
[2025-02-05 16:26:14,763 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:26:14,763 INFO  L471      AbstractCegarLoop]: Abstraction has 3682 states and 4768 transitions.
[2025-02-05 16:26:14,763 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10)
[2025-02-05 16:26:14,763 INFO  L276                IsEmpty]: Start isEmpty. Operand 3682 states and 4768 transitions.
[2025-02-05 16:26:14,765 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-02-05 16:26:14,765 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:26:14,766 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 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]
[2025-02-05 16:26:14,766 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 16:26:14,766 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:26:14,766 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:26:14,766 INFO  L85        PathProgramCache]: Analyzing trace with hash 1277304439, now seen corresponding path program 1 times
[2025-02-05 16:26:14,766 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:26:14,766 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940043369]
[2025-02-05 16:26:14,766 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:26:14,767 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:26:15,049 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-02-05 16:26:15,084 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-02-05 16:26:15,084 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:26:15,085 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:26:15,429 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2025-02-05 16:26:15,429 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:26:15,429 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940043369]
[2025-02-05 16:26:15,429 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940043369] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:26:15,429 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:26:15,429 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 16:26:15,430 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109759324]
[2025-02-05 16:26:15,430 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:26:15,430 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 16:26:15,430 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:26:15,431 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 16:26:15,431 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:26:15,431 INFO  L87              Difference]: Start difference. First operand 3682 states and 4768 transitions. Second operand  has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11)
[2025-02-05 16:26:17,767 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:26:17,768 INFO  L93              Difference]: Finished difference Result 7493 states and 9689 transitions.
[2025-02-05 16:26:17,768 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 16:26:17,768 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 228
[2025-02-05 16:26:17,768 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:26:17,782 INFO  L225             Difference]: With dead ends: 7493
[2025-02-05 16:26:17,782 INFO  L226             Difference]: Without dead ends: 3816
[2025-02-05 16:26:17,795 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2025-02-05 16:26:17,795 INFO  L435           NwaCegarLoop]: 3610 mSDtfsCounter, 5797 mSDsluCounter, 4566 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5797 SdHoareTripleChecker+Valid, 8176 SdHoareTripleChecker+Invalid, 2512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:26:17,796 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5797 Valid, 8176 Invalid, 2512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-02-05 16:26:17,799 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3816 states.
[2025-02-05 16:26:17,873 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 3680.
[2025-02-05 16:26:17,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3680 states, 3003 states have (on average 1.2151182151182152) internal successors, (3649), 3048 states have internal predecessors, (3649), 558 states have call successors, (558), 118 states have call predecessors, (558), 118 states have return successors, (557), 537 states have call predecessors, (557), 557 states have call successors, (557)
[2025-02-05 16:26:17,886 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 4764 transitions.
[2025-02-05 16:26:17,890 INFO  L78                 Accepts]: Start accepts. Automaton has 3680 states and 4764 transitions. Word has length 228
[2025-02-05 16:26:17,891 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:26:17,891 INFO  L471      AbstractCegarLoop]: Abstraction has 3680 states and 4764 transitions.
[2025-02-05 16:26:17,891 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11)
[2025-02-05 16:26:17,891 INFO  L276                IsEmpty]: Start isEmpty. Operand 3680 states and 4764 transitions.
[2025-02-05 16:26:17,894 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 230
[2025-02-05 16:26:17,894 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:26:17,894 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 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]
[2025-02-05 16:26:17,894 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 16:26:17,894 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:26:17,896 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:26:17,896 INFO  L85        PathProgramCache]: Analyzing trace with hash 1082613499, now seen corresponding path program 1 times
[2025-02-05 16:26:17,896 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:26:17,896 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732727983]
[2025-02-05 16:26:17,896 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:26:17,896 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:26:18,180 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes.
[2025-02-05 16:26:18,214 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements.
[2025-02-05 16:26:18,215 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:26:18,215 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:26:18,549 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2025-02-05 16:26:18,549 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:26:18,550 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732727983]
[2025-02-05 16:26:18,550 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732727983] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:26:18,550 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:26:18,550 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 16:26:18,550 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569695251]
[2025-02-05 16:26:18,550 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:26:18,550 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 16:26:18,550 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:26:18,551 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 16:26:18,551 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:26:18,551 INFO  L87              Difference]: Start difference. First operand 3680 states and 4764 transitions. Second operand  has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11)
[2025-02-05 16:26:20,654 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:26:20,654 INFO  L93              Difference]: Finished difference Result 7489 states and 9681 transitions.
[2025-02-05 16:26:20,655 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 16:26:20,655 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 229
[2025-02-05 16:26:20,655 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:26:20,685 INFO  L225             Difference]: With dead ends: 7489
[2025-02-05 16:26:20,685 INFO  L226             Difference]: Without dead ends: 3814
[2025-02-05 16:26:20,716 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2025-02-05 16:26:20,721 INFO  L435           NwaCegarLoop]: 3501 mSDtfsCounter, 5702 mSDsluCounter, 4541 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5702 SdHoareTripleChecker+Valid, 8042 SdHoareTripleChecker+Invalid, 2527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-02-05 16:26:20,721 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5702 Valid, 8042 Invalid, 2527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-02-05 16:26:20,728 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3814 states.
[2025-02-05 16:26:20,815 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3814 to 3676.
[2025-02-05 16:26:20,819 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3676 states, 3001 states have (on average 1.214595134955015) internal successors, (3645), 3046 states have internal predecessors, (3645), 556 states have call successors, (556), 118 states have call predecessors, (556), 118 states have return successors, (555), 535 states have call predecessors, (555), 555 states have call successors, (555)
[2025-02-05 16:26:20,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3676 states to 3676 states and 4756 transitions.
[2025-02-05 16:26:20,833 INFO  L78                 Accepts]: Start accepts. Automaton has 3676 states and 4756 transitions. Word has length 229
[2025-02-05 16:26:20,833 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:26:20,833 INFO  L471      AbstractCegarLoop]: Abstraction has 3676 states and 4756 transitions.
[2025-02-05 16:26:20,833 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11)
[2025-02-05 16:26:20,834 INFO  L276                IsEmpty]: Start isEmpty. Operand 3676 states and 4756 transitions.
[2025-02-05 16:26:20,835 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 231
[2025-02-05 16:26:20,836 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:26:20,836 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 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]
[2025-02-05 16:26:20,836 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-05 16:26:20,836 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:26:20,836 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:26:20,836 INFO  L85        PathProgramCache]: Analyzing trace with hash -19141576, now seen corresponding path program 1 times
[2025-02-05 16:26:20,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:26:20,836 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452463159]
[2025-02-05 16:26:20,837 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:26:20,837 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:26:21,135 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes.
[2025-02-05 16:26:21,168 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements.
[2025-02-05 16:26:21,168 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:26:21,168 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:26:21,500 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2025-02-05 16:26:21,500 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:26:21,500 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452463159]
[2025-02-05 16:26:21,500 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452463159] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:26:21,500 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:26:21,500 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 16:26:21,500 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67468534]
[2025-02-05 16:26:21,500 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:26:21,501 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 16:26:21,501 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:26:21,502 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 16:26:21,502 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:26:21,502 INFO  L87              Difference]: Start difference. First operand 3676 states and 4756 transitions. Second operand  has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11)
[2025-02-05 16:26:23,174 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:26:23,175 INFO  L93              Difference]: Finished difference Result 7345 states and 9513 transitions.
[2025-02-05 16:26:23,175 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 16:26:23,175 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 230
[2025-02-05 16:26:23,176 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:26:23,191 INFO  L225             Difference]: With dead ends: 7345
[2025-02-05 16:26:23,193 INFO  L226             Difference]: Without dead ends: 3674
[2025-02-05 16:26:23,209 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2025-02-05 16:26:23,210 INFO  L435           NwaCegarLoop]: 3475 mSDtfsCounter, 6632 mSDsluCounter, 2635 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 840 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6632 SdHoareTripleChecker+Valid, 6110 SdHoareTripleChecker+Invalid, 2230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 840 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-05 16:26:23,210 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [6632 Valid, 6110 Invalid, 2230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [840 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-05 16:26:23,217 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3674 states.
[2025-02-05 16:26:23,348 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3672.
[2025-02-05 16:26:23,351 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3672 states, 2999 states have (on average 1.2140713571190396) internal successors, (3641), 3044 states have internal predecessors, (3641), 554 states have call successors, (554), 118 states have call predecessors, (554), 118 states have return successors, (553), 533 states have call predecessors, (553), 553 states have call successors, (553)
[2025-02-05 16:26:23,361 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 4748 transitions.
[2025-02-05 16:26:23,367 INFO  L78                 Accepts]: Start accepts. Automaton has 3672 states and 4748 transitions. Word has length 230
[2025-02-05 16:26:23,367 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:26:23,367 INFO  L471      AbstractCegarLoop]: Abstraction has 3672 states and 4748 transitions.
[2025-02-05 16:26:23,367 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11)
[2025-02-05 16:26:23,367 INFO  L276                IsEmpty]: Start isEmpty. Operand 3672 states and 4748 transitions.
[2025-02-05 16:26:23,369 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 231
[2025-02-05 16:26:23,369 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:26:23,370 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 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]
[2025-02-05 16:26:23,370 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-05 16:26:23,370 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:26:23,370 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:26:23,370 INFO  L85        PathProgramCache]: Analyzing trace with hash -677425004, now seen corresponding path program 1 times
[2025-02-05 16:26:23,370 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:26:23,370 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605825604]
[2025-02-05 16:26:23,370 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:26:23,371 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:26:23,659 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes.
[2025-02-05 16:26:23,689 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements.
[2025-02-05 16:26:23,690 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:26:23,690 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:26:24,058 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2025-02-05 16:26:24,058 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:26:24,058 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605825604]
[2025-02-05 16:26:24,058 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605825604] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:26:24,058 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:26:24,058 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:26:24,058 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928491312]
[2025-02-05 16:26:24,059 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:26:24,059 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:26:24,059 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:26:24,059 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:26:24,059 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:26:24,060 INFO  L87              Difference]: Start difference. First operand 3672 states and 4748 transitions. Second operand  has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)
[2025-02-05 16:26:24,749 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:26:24,750 INFO  L93              Difference]: Finished difference Result 7341 states and 9500 transitions.
[2025-02-05 16:26:24,750 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 16:26:24,750 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 230
[2025-02-05 16:26:24,751 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:26:24,765 INFO  L225             Difference]: With dead ends: 7341
[2025-02-05 16:26:24,765 INFO  L226             Difference]: Without dead ends: 3674
[2025-02-05 16:26:24,780 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:26:24,780 INFO  L435           NwaCegarLoop]: 2937 mSDtfsCounter, 1783 mSDsluCounter, 5342 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1783 SdHoareTripleChecker+Valid, 8279 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 16:26:24,780 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1783 Valid, 8279 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 16:26:24,783 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3674 states.
[2025-02-05 16:26:24,863 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3672.
[2025-02-05 16:26:24,866 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3672 states, 2999 states have (on average 1.2137379126375458) internal successors, (3640), 3044 states have internal predecessors, (3640), 554 states have call successors, (554), 118 states have call predecessors, (554), 118 states have return successors, (553), 533 states have call predecessors, (553), 553 states have call successors, (553)
[2025-02-05 16:26:24,877 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 4747 transitions.
[2025-02-05 16:26:24,884 INFO  L78                 Accepts]: Start accepts. Automaton has 3672 states and 4747 transitions. Word has length 230
[2025-02-05 16:26:24,885 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:26:24,885 INFO  L471      AbstractCegarLoop]: Abstraction has 3672 states and 4747 transitions.
[2025-02-05 16:26:24,885 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)
[2025-02-05 16:26:24,885 INFO  L276                IsEmpty]: Start isEmpty. Operand 3672 states and 4747 transitions.
[2025-02-05 16:26:24,887 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2025-02-05 16:26:24,887 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:26:24,887 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 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]
[2025-02-05 16:26:24,887 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-02-05 16:26:24,887 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:26:24,888 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:26:24,888 INFO  L85        PathProgramCache]: Analyzing trace with hash 2119243150, now seen corresponding path program 1 times
[2025-02-05 16:26:24,888 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:26:24,888 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672790660]
[2025-02-05 16:26:24,888 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:26:24,888 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:26:25,170 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-02-05 16:26:25,205 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-02-05 16:26:25,205 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:26:25,205 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:26:25,480 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2025-02-05 16:26:25,481 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:26:25,481 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672790660]
[2025-02-05 16:26:25,481 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672790660] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:26:25,481 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:26:25,481 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:26:25,481 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788156066]
[2025-02-05 16:26:25,481 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:26:25,481 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:26:25,481 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:26:25,482 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:26:25,482 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:26:25,482 INFO  L87              Difference]: Start difference. First operand 3672 states and 4747 transitions. Second operand  has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12)
[2025-02-05 16:26:26,512 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:26:26,512 INFO  L93              Difference]: Finished difference Result 7473 states and 9646 transitions.
[2025-02-05 16:26:26,517 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:26:26,517 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 233
[2025-02-05 16:26:26,517 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:26:26,528 INFO  L225             Difference]: With dead ends: 7473
[2025-02-05 16:26:26,528 INFO  L226             Difference]: Without dead ends: 3806
[2025-02-05 16:26:26,539 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:26:26,540 INFO  L435           NwaCegarLoop]: 3013 mSDtfsCounter, 4315 mSDsluCounter, 4336 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4315 SdHoareTripleChecker+Valid, 7349 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 16:26:26,540 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4315 Valid, 7349 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 16:26:26,542 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3806 states.
[2025-02-05 16:26:26,608 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3806 to 3670.
[2025-02-05 16:26:26,611 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3670 states, 2998 states have (on average 1.2134756504336224) internal successors, (3638), 3043 states have internal predecessors, (3638), 553 states have call successors, (553), 118 states have call predecessors, (553), 118 states have return successors, (552), 532 states have call predecessors, (552), 552 states have call successors, (552)
[2025-02-05 16:26:26,620 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3670 states to 3670 states and 4743 transitions.
[2025-02-05 16:26:26,625 INFO  L78                 Accepts]: Start accepts. Automaton has 3670 states and 4743 transitions. Word has length 233
[2025-02-05 16:26:26,626 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:26:26,626 INFO  L471      AbstractCegarLoop]: Abstraction has 3670 states and 4743 transitions.
[2025-02-05 16:26:26,626 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12)
[2025-02-05 16:26:26,626 INFO  L276                IsEmpty]: Start isEmpty. Operand 3670 states and 4743 transitions.
[2025-02-05 16:26:26,628 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 235
[2025-02-05 16:26:26,628 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:26:26,628 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 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]
[2025-02-05 16:26:26,628 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-02-05 16:26:26,628 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:26:26,629 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:26:26,629 INFO  L85        PathProgramCache]: Analyzing trace with hash -1440609989, now seen corresponding path program 1 times
[2025-02-05 16:26:26,629 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:26:26,629 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526579989]
[2025-02-05 16:26:26,629 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:26:26,629 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:26:26,917 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes.
[2025-02-05 16:26:26,956 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements.
[2025-02-05 16:26:26,957 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:26:26,957 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:26:27,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2025-02-05 16:26:27,292 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:26:27,292 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526579989]
[2025-02-05 16:26:27,292 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526579989] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:26:27,292 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:26:27,292 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:26:27,292 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167959543]
[2025-02-05 16:26:27,292 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:26:27,293 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:26:27,293 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:26:27,294 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:26:27,294 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:26:27,294 INFO  L87              Difference]: Start difference. First operand 3670 states and 4743 transitions. Second operand  has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12)
[2025-02-05 16:26:28,393 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:26:28,393 INFO  L93              Difference]: Finished difference Result 7471 states and 9639 transitions.
[2025-02-05 16:26:28,393 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:26:28,394 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 234
[2025-02-05 16:26:28,394 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:26:28,405 INFO  L225             Difference]: With dead ends: 7471
[2025-02-05 16:26:28,405 INFO  L226             Difference]: Without dead ends: 3806
[2025-02-05 16:26:28,416 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:26:28,418 INFO  L435           NwaCegarLoop]: 2918 mSDtfsCounter, 4460 mSDsluCounter, 4045 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4460 SdHoareTripleChecker+Valid, 6963 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 535 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 16:26:28,418 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4460 Valid, 6963 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [535 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 16:26:28,421 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3806 states.
[2025-02-05 16:26:28,489 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3806 to 3668.
[2025-02-05 16:26:28,492 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3668 states, 2997 states have (on average 1.2132132132132132) internal successors, (3636), 3042 states have internal predecessors, (3636), 552 states have call successors, (552), 118 states have call predecessors, (552), 118 states have return successors, (551), 531 states have call predecessors, (551), 551 states have call successors, (551)
[2025-02-05 16:26:28,503 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 4739 transitions.
[2025-02-05 16:26:28,509 INFO  L78                 Accepts]: Start accepts. Automaton has 3668 states and 4739 transitions. Word has length 234
[2025-02-05 16:26:28,509 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:26:28,509 INFO  L471      AbstractCegarLoop]: Abstraction has 3668 states and 4739 transitions.
[2025-02-05 16:26:28,509 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12)
[2025-02-05 16:26:28,509 INFO  L276                IsEmpty]: Start isEmpty. Operand 3668 states and 4739 transitions.
[2025-02-05 16:26:28,511 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 236
[2025-02-05 16:26:28,511 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:26:28,512 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 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]
[2025-02-05 16:26:28,512 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-02-05 16:26:28,512 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:26:28,512 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:26:28,512 INFO  L85        PathProgramCache]: Analyzing trace with hash 1273175599, now seen corresponding path program 1 times
[2025-02-05 16:26:28,512 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:26:28,513 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773983875]
[2025-02-05 16:26:28,513 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:26:28,513 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:26:28,786 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes.
[2025-02-05 16:26:28,821 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements.
[2025-02-05 16:26:28,822 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:26:28,822 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:26:29,114 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2025-02-05 16:26:29,114 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:26:29,114 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773983875]
[2025-02-05 16:26:29,114 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773983875] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:26:29,114 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:26:29,114 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:26:29,114 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789214441]
[2025-02-05 16:26:29,115 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:26:29,115 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:26:29,115 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:26:29,116 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:26:29,116 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:26:29,116 INFO  L87              Difference]: Start difference. First operand 3668 states and 4739 transitions. Second operand  has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12)
[2025-02-05 16:26:29,718 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:26:29,720 INFO  L93              Difference]: Finished difference Result 7331 states and 9479 transitions.
[2025-02-05 16:26:29,720 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:26:29,721 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 235
[2025-02-05 16:26:29,721 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:26:29,738 INFO  L225             Difference]: With dead ends: 7331
[2025-02-05 16:26:29,739 INFO  L226             Difference]: Without dead ends: 3668
[2025-02-05 16:26:29,843 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:26:29,845 INFO  L435           NwaCegarLoop]: 3037 mSDtfsCounter, 2499 mSDsluCounter, 5238 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2499 SdHoareTripleChecker+Valid, 8275 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 16:26:29,845 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2499 Valid, 8275 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 16:26:29,848 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3668 states.
[2025-02-05 16:26:29,980 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3668 to 3666.
[2025-02-05 16:26:29,983 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3666 states, 2996 states have (on average 1.2129506008010682) internal successors, (3634), 3041 states have internal predecessors, (3634), 551 states have call successors, (551), 118 states have call predecessors, (551), 118 states have return successors, (550), 530 states have call predecessors, (550), 550 states have call successors, (550)
[2025-02-05 16:26:29,998 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 4735 transitions.
[2025-02-05 16:26:30,005 INFO  L78                 Accepts]: Start accepts. Automaton has 3666 states and 4735 transitions. Word has length 235
[2025-02-05 16:26:30,005 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:26:30,005 INFO  L471      AbstractCegarLoop]: Abstraction has 3666 states and 4735 transitions.
[2025-02-05 16:26:30,006 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12)
[2025-02-05 16:26:30,006 INFO  L276                IsEmpty]: Start isEmpty. Operand 3666 states and 4735 transitions.
[2025-02-05 16:26:30,008 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 236
[2025-02-05 16:26:30,008 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:26:30,009 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 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]
[2025-02-05 16:26:30,009 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-02-05 16:26:30,009 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:26:30,009 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:26:30,009 INFO  L85        PathProgramCache]: Analyzing trace with hash 1685461728, now seen corresponding path program 1 times
[2025-02-05 16:26:30,009 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:26:30,010 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183297157]
[2025-02-05 16:26:30,010 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:26:30,010 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:26:30,417 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes.
[2025-02-05 16:26:30,452 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements.
[2025-02-05 16:26:30,452 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:26:30,452 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:26:30,739 INFO  L134       CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2025-02-05 16:26:30,739 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:26:30,739 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183297157]
[2025-02-05 16:26:30,739 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183297157] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:26:30,739 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:26:30,739 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:26:30,740 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117028326]
[2025-02-05 16:26:30,740 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:26:30,740 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:26:30,740 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:26:30,740 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:26:30,740 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:26:30,740 INFO  L87              Difference]: Start difference. First operand 3666 states and 4735 transitions. Second operand  has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12)
[2025-02-05 16:26:31,533 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:26:31,533 INFO  L93              Difference]: Finished difference Result 7329 states and 9474 transitions.
[2025-02-05 16:26:31,533 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 16:26:31,534 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 235
[2025-02-05 16:26:31,534 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:26:31,552 INFO  L225             Difference]: With dead ends: 7329
[2025-02-05 16:26:31,552 INFO  L226             Difference]: Without dead ends: 3668
[2025-02-05 16:26:31,567 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:26:31,567 INFO  L435           NwaCegarLoop]: 2924 mSDtfsCounter, 1748 mSDsluCounter, 5328 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 8252 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 16:26:31,567 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 8252 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 16:26:31,570 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3668 states.
[2025-02-05 16:26:31,649 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3668 to 3666.
[2025-02-05 16:26:31,653 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3666 states, 2996 states have (on average 1.2126168224299065) internal successors, (3633), 3041 states have internal predecessors, (3633), 551 states have call successors, (551), 118 states have call predecessors, (551), 118 states have return successors, (550), 530 states have call predecessors, (550), 550 states have call successors, (550)
[2025-02-05 16:26:31,663 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 4734 transitions.
[2025-02-05 16:26:31,672 INFO  L78                 Accepts]: Start accepts. Automaton has 3666 states and 4734 transitions. Word has length 235
[2025-02-05 16:26:31,673 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:26:31,673 INFO  L471      AbstractCegarLoop]: Abstraction has 3666 states and 4734 transitions.
[2025-02-05 16:26:31,673 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12)
[2025-02-05 16:26:31,673 INFO  L276                IsEmpty]: Start isEmpty. Operand 3666 states and 4734 transitions.
[2025-02-05 16:26:31,675 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 239
[2025-02-05 16:26:31,675 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:26:31,675 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 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]
[2025-02-05 16:26:31,675 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-02-05 16:26:31,676 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:26:31,676 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:26:31,676 INFO  L85        PathProgramCache]: Analyzing trace with hash 992810828, now seen corresponding path program 1 times
[2025-02-05 16:26:31,676 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:26:31,676 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904483194]
[2025-02-05 16:26:31,676 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:26:31,676 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:26:31,996 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes.
[2025-02-05 16:26:32,032 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements.
[2025-02-05 16:26:32,032 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:26:32,032 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:26:32,345 INFO  L134       CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2025-02-05 16:26:32,346 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:26:32,346 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904483194]
[2025-02-05 16:26:32,346 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904483194] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:26:32,346 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:26:32,346 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:26:32,346 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755024950]
[2025-02-05 16:26:32,346 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:26:32,346 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:26:32,347 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:26:32,347 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:26:32,347 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:26:32,347 INFO  L87              Difference]: Start difference. First operand 3666 states and 4734 transitions. Second operand  has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13)
[2025-02-05 16:26:32,905 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:26:32,905 INFO  L93              Difference]: Finished difference Result 7461 states and 9620 transitions.
[2025-02-05 16:26:32,906 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:26:32,906 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 238
[2025-02-05 16:26:32,906 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:26:32,921 INFO  L225             Difference]: With dead ends: 7461
[2025-02-05 16:26:32,921 INFO  L226             Difference]: Without dead ends: 3800
[2025-02-05 16:26:32,935 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:26:32,939 INFO  L435           NwaCegarLoop]: 3000 mSDtfsCounter, 2366 mSDsluCounter, 5650 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2366 SdHoareTripleChecker+Valid, 8650 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 16:26:32,939 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2366 Valid, 8650 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 16:26:32,942 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3800 states.
[2025-02-05 16:26:33,017 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3800 to 3664.
[2025-02-05 16:26:33,020 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3664 states, 2995 states have (on average 1.2123539232053422) internal successors, (3631), 3040 states have internal predecessors, (3631), 550 states have call successors, (550), 118 states have call predecessors, (550), 118 states have return successors, (549), 529 states have call predecessors, (549), 549 states have call successors, (549)
[2025-02-05 16:26:33,030 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3664 states to 3664 states and 4730 transitions.
[2025-02-05 16:26:33,036 INFO  L78                 Accepts]: Start accepts. Automaton has 3664 states and 4730 transitions. Word has length 238
[2025-02-05 16:26:33,037 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:26:33,037 INFO  L471      AbstractCegarLoop]: Abstraction has 3664 states and 4730 transitions.
[2025-02-05 16:26:33,037 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13)
[2025-02-05 16:26:33,037 INFO  L276                IsEmpty]: Start isEmpty. Operand 3664 states and 4730 transitions.
[2025-02-05 16:26:33,039 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 240
[2025-02-05 16:26:33,039 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:26:33,039 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 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]
[2025-02-05 16:26:33,039 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-02-05 16:26:33,039 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:26:33,040 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:26:33,043 INFO  L85        PathProgramCache]: Analyzing trace with hash -1258717484, now seen corresponding path program 1 times
[2025-02-05 16:26:33,044 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:26:33,044 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518517465]
[2025-02-05 16:26:33,044 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:26:33,044 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms