./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d09ea01cef1d93b0c86c8a3dadfd601718ca81915e873154848504beefeee43f
[2025-03-03 15:18:48,161 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 15:18:48,167 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 15:18:48,169 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 15:18:48,170 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 15:18:48,170 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 15:18:48,171 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c
[2025-03-03 15:18:49,273 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5709a1508/1029ce243a614bccbc48dbb202cc7d2a/FLAGd1aa2c91c
[2025-03-03 15:18:49,521 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 15:18:49,522 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c
[2025-03-03 15:18:49,536 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5709a1508/1029ce243a614bccbc48dbb202cc7d2a/FLAGd1aa2c91c
[2025-03-03 15:18:49,839 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5709a1508/1029ce243a614bccbc48dbb202cc7d2a
[2025-03-03 15:18:49,840 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 15:18:49,841 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 15:18:49,842 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 15:18:49,842 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 15:18:49,845 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 15:18:49,846 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:18:49" (1/1) ...
[2025-03-03 15:18:49,846 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bc8c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:49, skipping insertion in model container
[2025-03-03 15:18:49,847 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:18:49" (1/1) ...
[2025-03-03 15:18:49,877 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 15:18:50,043 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[11680,11693]
[2025-03-03 15:18:50,079 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 15:18:50,093 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 15:18:50,150 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[11680,11693]
[2025-03-03 15:18:50,175 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 15:18:50,188 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 15:18:50,188 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:50 WrapperNode
[2025-03-03 15:18:50,188 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 15:18:50,189 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 15:18:50,189 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 15:18:50,189 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 15:18:50,194 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:50" (1/1) ...
[2025-03-03 15:18:50,203 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:50" (1/1) ...
[2025-03-03 15:18:50,257 INFO  L138                Inliner]: procedures = 28, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1033
[2025-03-03 15:18:50,257 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 15:18:50,258 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 15:18:50,258 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 15:18:50,258 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 15:18:50,271 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:50" (1/1) ...
[2025-03-03 15:18:50,271 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:50" (1/1) ...
[2025-03-03 15:18:50,277 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:50" (1/1) ...
[2025-03-03 15:18:50,301 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 15:18:50,301 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:50" (1/1) ...
[2025-03-03 15:18:50,302 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:50" (1/1) ...
[2025-03-03 15:18:50,309 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:50" (1/1) ...
[2025-03-03 15:18:50,315 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:50" (1/1) ...
[2025-03-03 15:18:50,318 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:50" (1/1) ...
[2025-03-03 15:18:50,321 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:50" (1/1) ...
[2025-03-03 15:18:50,325 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 15:18:50,325 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 15:18:50,326 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 15:18:50,326 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 15:18:50,327 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:50" (1/1) ...
[2025-03-03 15:18:50,331 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 15:18:50,341 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 15:18:50,354 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 15:18:50,356 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 15:18:50,375 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 15:18:50,376 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 15:18:50,376 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 15:18:50,376 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 15:18:50,501 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 15:18:50,503 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 15:18:51,314 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L766: havoc main_~node7____CPAchecker_TMP_0~1#1;havoc main_~node7__m7~2#1;
[2025-03-03 15:18:51,314 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L700: havoc main_~node5__m5~2#1;
[2025-03-03 15:18:51,314 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L635: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;
[2025-03-03 15:18:51,314 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L901: havoc main_~node4____CPAchecker_TMP_0~1#1;
[2025-03-03 15:18:51,314 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L670: havoc main_~node3__m3~2#1;
[2025-03-03 15:18:51,314 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L577: havoc main_~node8__m8~1#1;havoc main_~node7__m7~1#1;havoc main_~node6__m6~1#1;havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node8____CPAchecker_TMP_0~0#1;havoc main_~node8__m8~0#1;havoc main_~node7____CPAchecker_TMP_0~0#1;havoc main_~node7__m7~0#1;havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1;
[2025-03-03 15:18:51,314 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L1042: havoc main_~node1____CPAchecker_TMP_0~1#1;
[2025-03-03 15:18:51,314 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L811: havoc main_~node6____CPAchecker_TMP_0~1#1;
[2025-03-03 15:18:51,314 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L946: havoc main_~node3____CPAchecker_TMP_0~1#1;
[2025-03-03 15:18:51,314 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L715: havoc main_~node6__m6~2#1;
[2025-03-03 15:18:51,315 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L685: havoc main_~node4__m4~2#1;
[2025-03-03 15:18:51,315 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L655: havoc main_~node2__m2~2#1;
[2025-03-03 15:18:51,315 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L856: havoc main_~node5____CPAchecker_TMP_0~1#1;
[2025-03-03 15:18:51,315 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L1123: havoc main_~node8____CPAchecker_TMP_0~1#1;
[2025-03-03 15:18:51,315 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L991: havoc main_~node2____CPAchecker_TMP_0~1#1;
[2025-03-03 15:18:51,367 INFO  L?                        ?]: Removed 115 outVars from TransFormulas that were not future-live.
[2025-03-03 15:18:51,367 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 15:18:51,383 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 15:18:51,384 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 15:18:51,385 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:18:51 BoogieIcfgContainer
[2025-03-03 15:18:51,385 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 15:18:51,386 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 15:18:51,387 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 15:18:51,390 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 15:18:51,390 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:18:49" (1/3) ...
[2025-03-03 15:18:51,391 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d95d267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:18:51, skipping insertion in model container
[2025-03-03 15:18:51,391 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:18:50" (2/3) ...
[2025-03-03 15:18:51,391 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d95d267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:18:51, skipping insertion in model container
[2025-03-03 15:18:51,391 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:18:51" (3/3) ...
[2025-03-03 15:18:51,393 INFO  L128   eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c
[2025-03-03 15:18:51,403 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 15:18:51,406 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 231 locations, 1 initial locations, 0 loop locations, and 1 error locations.
[2025-03-03 15:18:51,461 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 15:18:51,468 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;@3bb5b609, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 15:18:51,468 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 15:18:51,472 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 231 states, 229 states have (on average 1.7685589519650655) internal successors, (405), 230 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:51,478 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2025-03-03 15:18:51,478 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:18:51,479 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]
[2025-03-03 15:18:51,479 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:18:51,483 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:18:51,483 INFO  L85        PathProgramCache]: Analyzing trace with hash -587552538, now seen corresponding path program 1 times
[2025-03-03 15:18:51,488 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:18:51,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010586110]
[2025-03-03 15:18:51,489 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:18:51,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:18:51,576 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes.
[2025-03-03 15:18:51,668 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements.
[2025-03-03 15:18:51,669 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:18:51,669 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:18:52,254 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:18:52,254 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:18:52,255 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010586110]
[2025-03-03 15:18:52,255 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010586110] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:18:52,255 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:18:52,255 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-03 15:18:52,256 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270150020]
[2025-03-03 15:18:52,257 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:18:52,259 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 15:18:52,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:18:52,272 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 15:18:52,273 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2025-03-03 15:18:52,275 INFO  L87              Difference]: Start difference. First operand  has 231 states, 229 states have (on average 1.7685589519650655) internal successors, (405), 230 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:53,165 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:18:53,165 INFO  L93              Difference]: Finished difference Result 1826 states and 2955 transitions.
[2025-03-03 15:18:53,166 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-03-03 15:18:53,167 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124
[2025-03-03 15:18:53,168 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:18:53,187 INFO  L225             Difference]: With dead ends: 1826
[2025-03-03 15:18:53,187 INFO  L226             Difference]: Without dead ends: 1705
[2025-03-03 15:18:53,190 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506
[2025-03-03 15:18:53,192 INFO  L435           NwaCegarLoop]: 1356 mSDtfsCounter, 3200 mSDsluCounter, 9979 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3200 SdHoareTripleChecker+Valid, 11335 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 15:18:53,192 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3200 Valid, 11335 Invalid, 776 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [12 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 15:18:53,204 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1705 states.
[2025-03-03 15:18:53,240 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 348.
[2025-03-03 15:18:53,241 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 348 states, 347 states have (on average 1.446685878962536) internal successors, (502), 347 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:53,248 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 502 transitions.
[2025-03-03 15:18:53,249 INFO  L78                 Accepts]: Start accepts. Automaton has 348 states and 502 transitions. Word has length 124
[2025-03-03 15:18:53,249 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:18:53,249 INFO  L471      AbstractCegarLoop]: Abstraction has 348 states and 502 transitions.
[2025-03-03 15:18:53,250 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:53,250 INFO  L276                IsEmpty]: Start isEmpty. Operand 348 states and 502 transitions.
[2025-03-03 15:18:53,251 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2025-03-03 15:18:53,251 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:18:53,251 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]
[2025-03-03 15:18:53,251 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 15:18:53,251 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:18:53,252 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:18:53,252 INFO  L85        PathProgramCache]: Analyzing trace with hash -1066191774, now seen corresponding path program 1 times
[2025-03-03 15:18:53,252 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:18:53,252 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210661513]
[2025-03-03 15:18:53,252 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:18:53,252 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:18:53,271 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-03-03 15:18:53,285 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-03-03 15:18:53,285 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:18:53,285 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:18:53,578 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:18:53,579 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:18:53,579 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210661513]
[2025-03-03 15:18:53,579 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210661513] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:18:53,579 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:18:53,579 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-03 15:18:53,579 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042083028]
[2025-03-03 15:18:53,579 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:18:53,580 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 15:18:53,580 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:18:53,581 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 15:18:53,581 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-03-03 15:18:53,581 INFO  L87              Difference]: Start difference. First operand 348 states and 502 transitions. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:53,992 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:18:53,993 INFO  L93              Difference]: Finished difference Result 1960 states and 3067 transitions.
[2025-03-03 15:18:53,993 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-03 15:18:53,993 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126
[2025-03-03 15:18:53,995 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:18:54,003 INFO  L225             Difference]: With dead ends: 1960
[2025-03-03 15:18:54,004 INFO  L226             Difference]: Without dead ends: 1780
[2025-03-03 15:18:54,005 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272
[2025-03-03 15:18:54,006 INFO  L435           NwaCegarLoop]: 1318 mSDtfsCounter, 2287 mSDsluCounter, 4769 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2287 SdHoareTripleChecker+Valid, 6087 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 15:18:54,006 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2287 Valid, 6087 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 15:18:54,008 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1780 states.
[2025-03-03 15:18:54,041 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 552.
[2025-03-03 15:18:54,045 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 551 states have (on average 1.5027223230490019) internal successors, (828), 551 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:54,047 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 828 transitions.
[2025-03-03 15:18:54,047 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 828 transitions. Word has length 126
[2025-03-03 15:18:54,048 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:18:54,048 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 828 transitions.
[2025-03-03 15:18:54,048 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:54,048 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 828 transitions.
[2025-03-03 15:18:54,049 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2025-03-03 15:18:54,049 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:18:54,051 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]
[2025-03-03 15:18:54,052 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 15:18:54,052 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:18:54,052 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:18:54,053 INFO  L85        PathProgramCache]: Analyzing trace with hash 450778474, now seen corresponding path program 1 times
[2025-03-03 15:18:54,053 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:18:54,053 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425739065]
[2025-03-03 15:18:54,053 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:18:54,054 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:18:54,076 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-03-03 15:18:54,095 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-03-03 15:18:54,095 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:18:54,095 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:18:54,349 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:18:54,351 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:18:54,351 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425739065]
[2025-03-03 15:18:54,351 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425739065] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:18:54,351 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:18:54,351 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-03 15:18:54,351 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691271273]
[2025-03-03 15:18:54,352 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:18:54,352 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 15:18:54,352 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:18:54,353 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 15:18:54,354 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-03-03 15:18:54,354 INFO  L87              Difference]: Start difference. First operand 552 states and 828 transitions. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:54,709 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:18:54,710 INFO  L93              Difference]: Finished difference Result 2164 states and 3393 transitions.
[2025-03-03 15:18:54,711 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-03 15:18:54,711 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126
[2025-03-03 15:18:54,712 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:18:54,719 INFO  L225             Difference]: With dead ends: 2164
[2025-03-03 15:18:54,719 INFO  L226             Difference]: Without dead ends: 1984
[2025-03-03 15:18:54,722 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272
[2025-03-03 15:18:54,723 INFO  L435           NwaCegarLoop]: 1192 mSDtfsCounter, 2280 mSDsluCounter, 4139 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2280 SdHoareTripleChecker+Valid, 5331 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 15:18:54,724 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2280 Valid, 5331 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 15:18:54,726 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1984 states.
[2025-03-03 15:18:54,752 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 845.
[2025-03-03 15:18:54,754 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 845 states, 844 states have (on average 1.5355450236966826) internal successors, (1296), 844 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:54,756 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1296 transitions.
[2025-03-03 15:18:54,756 INFO  L78                 Accepts]: Start accepts. Automaton has 845 states and 1296 transitions. Word has length 126
[2025-03-03 15:18:54,757 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:18:54,757 INFO  L471      AbstractCegarLoop]: Abstraction has 845 states and 1296 transitions.
[2025-03-03 15:18:54,757 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:54,758 INFO  L276                IsEmpty]: Start isEmpty. Operand 845 states and 1296 transitions.
[2025-03-03 15:18:54,759 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2025-03-03 15:18:54,760 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:18:54,760 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]
[2025-03-03 15:18:54,760 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 15:18:54,760 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:18:54,760 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:18:54,761 INFO  L85        PathProgramCache]: Analyzing trace with hash -528084638, now seen corresponding path program 1 times
[2025-03-03 15:18:54,761 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:18:54,761 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274551053]
[2025-03-03 15:18:54,761 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:18:54,761 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:18:54,777 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-03-03 15:18:54,791 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-03-03 15:18:54,791 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:18:54,791 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:18:55,016 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:18:55,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:18:55,016 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274551053]
[2025-03-03 15:18:55,016 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274551053] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:18:55,016 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:18:55,016 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-03 15:18:55,016 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080062512]
[2025-03-03 15:18:55,016 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:18:55,017 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 15:18:55,017 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:18:55,017 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 15:18:55,017 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-03-03 15:18:55,017 INFO  L87              Difference]: Start difference. First operand 845 states and 1296 transitions. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:55,390 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:18:55,390 INFO  L93              Difference]: Finished difference Result 2363 states and 3711 transitions.
[2025-03-03 15:18:55,391 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-03 15:18:55,391 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126
[2025-03-03 15:18:55,391 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:18:55,397 INFO  L225             Difference]: With dead ends: 2363
[2025-03-03 15:18:55,397 INFO  L226             Difference]: Without dead ends: 2183
[2025-03-03 15:18:55,398 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272
[2025-03-03 15:18:55,400 INFO  L435           NwaCegarLoop]: 1066 mSDtfsCounter, 2400 mSDsluCounter, 4311 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2400 SdHoareTripleChecker+Valid, 5377 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 15:18:55,401 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2400 Valid, 5377 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 15:18:55,403 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2183 states.
[2025-03-03 15:18:55,426 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 1044.
[2025-03-03 15:18:55,427 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1044 states, 1043 states have (on average 1.5474592521572388) internal successors, (1614), 1043 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:55,430 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1614 transitions.
[2025-03-03 15:18:55,431 INFO  L78                 Accepts]: Start accepts. Automaton has 1044 states and 1614 transitions. Word has length 126
[2025-03-03 15:18:55,431 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:18:55,431 INFO  L471      AbstractCegarLoop]: Abstraction has 1044 states and 1614 transitions.
[2025-03-03 15:18:55,431 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:55,431 INFO  L276                IsEmpty]: Start isEmpty. Operand 1044 states and 1614 transitions.
[2025-03-03 15:18:55,432 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2025-03-03 15:18:55,432 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:18:55,432 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]
[2025-03-03 15:18:55,433 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 15:18:55,433 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:18:55,433 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:18:55,433 INFO  L85        PathProgramCache]: Analyzing trace with hash -1375692694, now seen corresponding path program 1 times
[2025-03-03 15:18:55,433 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:18:55,433 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578005681]
[2025-03-03 15:18:55,433 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:18:55,433 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:18:55,451 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-03-03 15:18:55,462 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-03-03 15:18:55,462 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:18:55,462 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:18:55,673 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:18:55,674 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:18:55,674 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578005681]
[2025-03-03 15:18:55,674 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578005681] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:18:55,674 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:18:55,674 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-03 15:18:55,674 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342589817]
[2025-03-03 15:18:55,674 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:18:55,674 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 15:18:55,674 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:18:55,675 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 15:18:55,675 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-03-03 15:18:55,675 INFO  L87              Difference]: Start difference. First operand 1044 states and 1614 transitions. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:56,021 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:18:56,021 INFO  L93              Difference]: Finished difference Result 2557 states and 4021 transitions.
[2025-03-03 15:18:56,022 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-03 15:18:56,022 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126
[2025-03-03 15:18:56,022 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:18:56,030 INFO  L225             Difference]: With dead ends: 2557
[2025-03-03 15:18:56,030 INFO  L226             Difference]: Without dead ends: 2377
[2025-03-03 15:18:56,031 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272
[2025-03-03 15:18:56,032 INFO  L435           NwaCegarLoop]: 940 mSDtfsCounter, 2523 mSDsluCounter, 3548 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2523 SdHoareTripleChecker+Valid, 4488 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 15:18:56,032 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2523 Valid, 4488 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 15:18:56,034 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2377 states.
[2025-03-03 15:18:56,058 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1238.
[2025-03-03 15:18:56,060 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1238 states, 1237 states have (on average 1.555375909458367) internal successors, (1924), 1237 states have internal predecessors, (1924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:56,063 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1924 transitions.
[2025-03-03 15:18:56,063 INFO  L78                 Accepts]: Start accepts. Automaton has 1238 states and 1924 transitions. Word has length 126
[2025-03-03 15:18:56,064 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:18:56,064 INFO  L471      AbstractCegarLoop]: Abstraction has 1238 states and 1924 transitions.
[2025-03-03 15:18:56,064 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:56,064 INFO  L276                IsEmpty]: Start isEmpty. Operand 1238 states and 1924 transitions.
[2025-03-03 15:18:56,065 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2025-03-03 15:18:56,065 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:18:56,065 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]
[2025-03-03 15:18:56,065 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 15:18:56,065 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:18:56,067 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:18:56,067 INFO  L85        PathProgramCache]: Analyzing trace with hash -884822430, now seen corresponding path program 1 times
[2025-03-03 15:18:56,067 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:18:56,067 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382302324]
[2025-03-03 15:18:56,068 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:18:56,068 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:18:56,088 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-03-03 15:18:56,097 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-03-03 15:18:56,098 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:18:56,098 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:18:56,293 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:18:56,294 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:18:56,294 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382302324]
[2025-03-03 15:18:56,294 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382302324] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:18:56,294 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:18:56,294 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-03 15:18:56,294 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150839005]
[2025-03-03 15:18:56,294 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:18:56,294 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 15:18:56,294 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:18:56,295 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 15:18:56,295 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-03-03 15:18:56,295 INFO  L87              Difference]: Start difference. First operand 1238 states and 1924 transitions. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:56,622 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:18:56,623 INFO  L93              Difference]: Finished difference Result 2746 states and 4323 transitions.
[2025-03-03 15:18:56,623 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-03 15:18:56,623 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126
[2025-03-03 15:18:56,623 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:18:56,631 INFO  L225             Difference]: With dead ends: 2746
[2025-03-03 15:18:56,631 INFO  L226             Difference]: Without dead ends: 2566
[2025-03-03 15:18:56,633 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272
[2025-03-03 15:18:56,633 INFO  L435           NwaCegarLoop]: 814 mSDtfsCounter, 2643 mSDsluCounter, 3581 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2643 SdHoareTripleChecker+Valid, 4395 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 15:18:56,633 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2643 Valid, 4395 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 15:18:56,636 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2566 states.
[2025-03-03 15:18:56,660 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 1427.
[2025-03-03 15:18:56,662 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1427 states, 1426 states have (on average 1.5610098176718092) internal successors, (2226), 1426 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:56,666 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 2226 transitions.
[2025-03-03 15:18:56,666 INFO  L78                 Accepts]: Start accepts. Automaton has 1427 states and 2226 transitions. Word has length 126
[2025-03-03 15:18:56,666 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:18:56,666 INFO  L471      AbstractCegarLoop]: Abstraction has 1427 states and 2226 transitions.
[2025-03-03 15:18:56,666 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:56,666 INFO  L276                IsEmpty]: Start isEmpty. Operand 1427 states and 2226 transitions.
[2025-03-03 15:18:56,667 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2025-03-03 15:18:56,667 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:18:56,668 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]
[2025-03-03 15:18:56,668 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 15:18:56,668 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:18:56,668 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:18:56,668 INFO  L85        PathProgramCache]: Analyzing trace with hash -858711190, now seen corresponding path program 1 times
[2025-03-03 15:18:56,668 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:18:56,668 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342666242]
[2025-03-03 15:18:56,669 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:18:56,669 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:18:56,693 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-03-03 15:18:56,701 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-03-03 15:18:56,702 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:18:56,702 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:18:56,870 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:18:56,871 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:18:56,871 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342666242]
[2025-03-03 15:18:56,871 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342666242] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:18:56,871 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:18:56,871 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-03 15:18:56,871 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893448392]
[2025-03-03 15:18:56,871 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:18:56,871 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 15:18:56,871 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:18:56,872 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 15:18:56,872 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-03-03 15:18:56,872 INFO  L87              Difference]: Start difference. First operand 1427 states and 2226 transitions. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:57,167 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:18:57,167 INFO  L93              Difference]: Finished difference Result 2930 states and 4617 transitions.
[2025-03-03 15:18:57,167 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-03 15:18:57,168 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126
[2025-03-03 15:18:57,168 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:18:57,175 INFO  L225             Difference]: With dead ends: 2930
[2025-03-03 15:18:57,176 INFO  L226             Difference]: Without dead ends: 2750
[2025-03-03 15:18:57,176 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272
[2025-03-03 15:18:57,177 INFO  L435           NwaCegarLoop]: 688 mSDtfsCounter, 2762 mSDsluCounter, 3829 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2762 SdHoareTripleChecker+Valid, 4517 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 15:18:57,177 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2762 Valid, 4517 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 15:18:57,179 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2750 states.
[2025-03-03 15:18:57,206 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 1611.
[2025-03-03 15:18:57,209 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1611 states, 1610 states have (on average 1.565217391304348) internal successors, (2520), 1610 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:57,214 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2520 transitions.
[2025-03-03 15:18:57,214 INFO  L78                 Accepts]: Start accepts. Automaton has 1611 states and 2520 transitions. Word has length 126
[2025-03-03 15:18:57,214 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:18:57,214 INFO  L471      AbstractCegarLoop]: Abstraction has 1611 states and 2520 transitions.
[2025-03-03 15:18:57,215 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:57,215 INFO  L276                IsEmpty]: Start isEmpty. Operand 1611 states and 2520 transitions.
[2025-03-03 15:18:57,216 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2025-03-03 15:18:57,216 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:18:57,216 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]
[2025-03-03 15:18:57,217 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 15:18:57,217 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:18:57,217 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:18:57,217 INFO  L85        PathProgramCache]: Analyzing trace with hash 855182178, now seen corresponding path program 1 times
[2025-03-03 15:18:57,217 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:18:57,217 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524013376]
[2025-03-03 15:18:57,218 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:18:57,218 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:18:57,236 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-03-03 15:18:57,244 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-03-03 15:18:57,245 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:18:57,245 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:18:57,432 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:18:57,432 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:18:57,432 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524013376]
[2025-03-03 15:18:57,432 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524013376] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:18:57,432 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:18:57,432 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-03 15:18:57,432 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006201467]
[2025-03-03 15:18:57,432 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:18:57,433 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 15:18:57,433 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:18:57,433 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 15:18:57,433 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-03-03 15:18:57,434 INFO  L87              Difference]: Start difference. First operand 1611 states and 2520 transitions. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:57,794 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:18:57,795 INFO  L93              Difference]: Finished difference Result 3109 states and 4903 transitions.
[2025-03-03 15:18:57,795 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-03 15:18:57,795 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126
[2025-03-03 15:18:57,795 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:18:57,805 INFO  L225             Difference]: With dead ends: 3109
[2025-03-03 15:18:57,805 INFO  L226             Difference]: Without dead ends: 2929
[2025-03-03 15:18:57,807 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272
[2025-03-03 15:18:57,808 INFO  L435           NwaCegarLoop]: 562 mSDtfsCounter, 2878 mSDsluCounter, 4423 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2878 SdHoareTripleChecker+Valid, 4985 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 15:18:57,809 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2878 Valid, 4985 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 15:18:57,811 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2929 states.
[2025-03-03 15:18:57,843 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 1790.
[2025-03-03 15:18:57,846 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1790 states, 1789 states have (on average 1.568474007825601) internal successors, (2806), 1789 states have internal predecessors, (2806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:57,851 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2806 transitions.
[2025-03-03 15:18:57,852 INFO  L78                 Accepts]: Start accepts. Automaton has 1790 states and 2806 transitions. Word has length 126
[2025-03-03 15:18:57,852 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:18:57,852 INFO  L471      AbstractCegarLoop]: Abstraction has 1790 states and 2806 transitions.
[2025-03-03 15:18:57,852 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:57,852 INFO  L276                IsEmpty]: Start isEmpty. Operand 1790 states and 2806 transitions.
[2025-03-03 15:18:57,854 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2025-03-03 15:18:57,854 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:18:57,854 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]
[2025-03-03 15:18:57,854 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 15:18:57,854 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:18:57,854 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:18:57,855 INFO  L85        PathProgramCache]: Analyzing trace with hash 1063026434, now seen corresponding path program 1 times
[2025-03-03 15:18:57,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:18:57,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613600986]
[2025-03-03 15:18:57,855 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:18:57,855 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:18:57,873 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-03-03 15:18:57,887 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-03-03 15:18:57,887 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:18:57,887 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:18:58,077 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:18:58,077 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:18:58,077 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613600986]
[2025-03-03 15:18:58,077 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613600986] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:18:58,077 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:18:58,078 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-03 15:18:58,078 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622580721]
[2025-03-03 15:18:58,078 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:18:58,078 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 15:18:58,078 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:18:58,078 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 15:18:58,079 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-03-03 15:18:58,079 INFO  L87              Difference]: Start difference. First operand 1790 states and 2806 transitions. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:58,340 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:18:58,341 INFO  L93              Difference]: Finished difference Result 3287 states and 5188 transitions.
[2025-03-03 15:18:58,341 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-03 15:18:58,341 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126
[2025-03-03 15:18:58,342 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:18:58,351 INFO  L225             Difference]: With dead ends: 3287
[2025-03-03 15:18:58,352 INFO  L226             Difference]: Without dead ends: 3107
[2025-03-03 15:18:58,353 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272
[2025-03-03 15:18:58,354 INFO  L435           NwaCegarLoop]: 444 mSDtfsCounter, 2989 mSDsluCounter, 4955 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2989 SdHoareTripleChecker+Valid, 5399 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 15:18:58,355 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2989 Valid, 5399 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 15:18:58,358 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3107 states.
[2025-03-03 15:18:58,384 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 1968.
[2025-03-03 15:18:58,387 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1968 states, 1967 states have (on average 1.5714285714285714) internal successors, (3091), 1967 states have internal predecessors, (3091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:58,390 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 3091 transitions.
[2025-03-03 15:18:58,391 INFO  L78                 Accepts]: Start accepts. Automaton has 1968 states and 3091 transitions. Word has length 126
[2025-03-03 15:18:58,391 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:18:58,391 INFO  L471      AbstractCegarLoop]: Abstraction has 1968 states and 3091 transitions.
[2025-03-03 15:18:58,391 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:58,391 INFO  L276                IsEmpty]: Start isEmpty. Operand 1968 states and 3091 transitions.
[2025-03-03 15:18:58,392 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2025-03-03 15:18:58,392 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:18:58,392 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]
[2025-03-03 15:18:58,392 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 15:18:58,393 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:18:58,393 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:18:58,393 INFO  L85        PathProgramCache]: Analyzing trace with hash -1958218737, now seen corresponding path program 1 times
[2025-03-03 15:18:58,394 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:18:58,394 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448731740]
[2025-03-03 15:18:58,394 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:18:58,394 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:18:58,412 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-03-03 15:18:58,421 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-03-03 15:18:58,421 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:18:58,421 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:18:58,475 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:18:58,475 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:18:58,475 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448731740]
[2025-03-03 15:18:58,475 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448731740] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:18:58,475 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:18:58,476 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 15:18:58,476 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92348529]
[2025-03-03 15:18:58,476 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:18:58,476 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 15:18:58,476 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:18:58,476 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 15:18:58,476 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 15:18:58,477 INFO  L87              Difference]: Start difference. First operand 1968 states and 3091 transitions. Second operand  has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:58,510 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:18:58,510 INFO  L93              Difference]: Finished difference Result 5231 states and 8292 transitions.
[2025-03-03 15:18:58,511 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 15:18:58,511 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126
[2025-03-03 15:18:58,512 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:18:58,527 INFO  L225             Difference]: With dead ends: 5231
[2025-03-03 15:18:58,530 INFO  L226             Difference]: Without dead ends: 3538
[2025-03-03 15:18:58,533 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 15:18:58,535 INFO  L435           NwaCegarLoop]: 437 mSDtfsCounter, 131 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 15:18:58,536 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 733 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 15:18:58,540 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3538 states.
[2025-03-03 15:18:58,580 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3538 to 3498.
[2025-03-03 15:18:58,584 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3498 states, 3497 states have (on average 1.5690591935945095) internal successors, (5487), 3497 states have internal predecessors, (5487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:58,591 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 5487 transitions.
[2025-03-03 15:18:58,591 INFO  L78                 Accepts]: Start accepts. Automaton has 3498 states and 5487 transitions. Word has length 126
[2025-03-03 15:18:58,592 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:18:58,592 INFO  L471      AbstractCegarLoop]: Abstraction has 3498 states and 5487 transitions.
[2025-03-03 15:18:58,592 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:58,592 INFO  L276                IsEmpty]: Start isEmpty. Operand 3498 states and 5487 transitions.
[2025-03-03 15:18:58,593 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2025-03-03 15:18:58,593 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:18:58,593 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]
[2025-03-03 15:18:58,593 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 15:18:58,593 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:18:58,594 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:18:58,594 INFO  L85        PathProgramCache]: Analyzing trace with hash -1957056888, now seen corresponding path program 1 times
[2025-03-03 15:18:58,594 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:18:58,594 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473941219]
[2025-03-03 15:18:58,594 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:18:58,594 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:18:58,629 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-03-03 15:18:58,640 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-03-03 15:18:58,640 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:18:58,640 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:18:59,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:18:59,029 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:18:59,029 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473941219]
[2025-03-03 15:18:59,029 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473941219] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:18:59,029 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:18:59,030 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-03 15:18:59,030 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878402674]
[2025-03-03 15:18:59,030 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:18:59,030 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 15:18:59,030 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:18:59,030 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 15:18:59,030 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2025-03-03 15:18:59,031 INFO  L87              Difference]: Start difference. First operand 3498 states and 5487 transitions. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:59,409 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:18:59,410 INFO  L93              Difference]: Finished difference Result 6723 states and 10593 transitions.
[2025-03-03 15:18:59,410 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-03 15:18:59,411 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126
[2025-03-03 15:18:59,411 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:18:59,417 INFO  L225             Difference]: With dead ends: 6723
[2025-03-03 15:18:59,417 INFO  L226             Difference]: Without dead ends: 3500
[2025-03-03 15:18:59,420 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240
[2025-03-03 15:18:59,421 INFO  L435           NwaCegarLoop]: 299 mSDtfsCounter, 255 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 15:18:59,421 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1783 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 15:18:59,423 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3500 states.
[2025-03-03 15:18:59,454 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3500 to 3498.
[2025-03-03 15:18:59,458 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3498 states, 3497 states have (on average 1.5661995996568487) internal successors, (5477), 3497 states have internal predecessors, (5477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:59,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 5477 transitions.
[2025-03-03 15:18:59,464 INFO  L78                 Accepts]: Start accepts. Automaton has 3498 states and 5477 transitions. Word has length 126
[2025-03-03 15:18:59,464 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:18:59,464 INFO  L471      AbstractCegarLoop]: Abstraction has 3498 states and 5477 transitions.
[2025-03-03 15:18:59,464 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:59,464 INFO  L276                IsEmpty]: Start isEmpty. Operand 3498 states and 5477 transitions.
[2025-03-03 15:18:59,465 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2025-03-03 15:18:59,465 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:18:59,466 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]
[2025-03-03 15:18:59,466 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 15:18:59,466 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:18:59,466 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:18:59,466 INFO  L85        PathProgramCache]: Analyzing trace with hash -570464742, now seen corresponding path program 1 times
[2025-03-03 15:18:59,466 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:18:59,466 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006296337]
[2025-03-03 15:18:59,466 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:18:59,466 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:18:59,481 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes.
[2025-03-03 15:18:59,494 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements.
[2025-03-03 15:18:59,494 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:18:59,494 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:18:59,589 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:18:59,590 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:18:59,590 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006296337]
[2025-03-03 15:18:59,590 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006296337] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:18:59,590 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:18:59,590 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 15:18:59,590 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468862822]
[2025-03-03 15:18:59,590 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:18:59,590 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 15:18:59,591 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:18:59,591 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 15:18:59,591 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 15:18:59,591 INFO  L87              Difference]: Start difference. First operand 3498 states and 5477 transitions. Second operand  has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:59,737 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:18:59,738 INFO  L93              Difference]: Finished difference Result 6905 states and 10856 transitions.
[2025-03-03 15:18:59,738 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 15:18:59,738 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127
[2025-03-03 15:18:59,739 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:18:59,745 INFO  L225             Difference]: With dead ends: 6905
[2025-03-03 15:18:59,745 INFO  L226             Difference]: Without dead ends: 3498
[2025-03-03 15:18:59,749 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-03 15:18:59,750 INFO  L435           NwaCegarLoop]: 169 mSDtfsCounter, 786 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 15:18:59,750 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 221 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 15:18:59,753 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3498 states.
[2025-03-03 15:18:59,798 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 3498.
[2025-03-03 15:18:59,803 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3498 states, 3497 states have (on average 1.5550471832999715) internal successors, (5438), 3497 states have internal predecessors, (5438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:59,810 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 5438 transitions.
[2025-03-03 15:18:59,811 INFO  L78                 Accepts]: Start accepts. Automaton has 3498 states and 5438 transitions. Word has length 127
[2025-03-03 15:18:59,811 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:18:59,811 INFO  L471      AbstractCegarLoop]: Abstraction has 3498 states and 5438 transitions.
[2025-03-03 15:18:59,811 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:18:59,811 INFO  L276                IsEmpty]: Start isEmpty. Operand 3498 states and 5438 transitions.
[2025-03-03 15:18:59,813 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 129
[2025-03-03 15:18:59,813 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:18:59,813 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]
[2025-03-03 15:18:59,813 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 15:18:59,813 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:18:59,813 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:18:59,814 INFO  L85        PathProgramCache]: Analyzing trace with hash -2094717068, now seen corresponding path program 1 times
[2025-03-03 15:18:59,814 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:18:59,814 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295355723]
[2025-03-03 15:18:59,814 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:18:59,814 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:18:59,833 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes.
[2025-03-03 15:18:59,848 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements.
[2025-03-03 15:18:59,848 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:18:59,848 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:18:59,913 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:18:59,913 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:18:59,914 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295355723]
[2025-03-03 15:18:59,914 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295355723] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:18:59,914 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:18:59,914 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 15:18:59,914 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720010363]
[2025-03-03 15:18:59,914 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:18:59,914 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 15:18:59,914 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:18:59,915 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 15:18:59,915 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 15:18:59,915 INFO  L87              Difference]: Start difference. First operand 3498 states and 5438 transitions. Second operand  has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:00,133 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:00,133 INFO  L93              Difference]: Finished difference Result 10285 states and 16073 transitions.
[2025-03-03 15:19:00,133 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 15:19:00,134 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128
[2025-03-03 15:19:00,134 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:00,144 INFO  L225             Difference]: With dead ends: 10285
[2025-03-03 15:19:00,144 INFO  L226             Difference]: Without dead ends: 6854
[2025-03-03 15:19:00,150 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-03 15:19:00,150 INFO  L435           NwaCegarLoop]: 169 mSDtfsCounter, 1230 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:00,151 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 274 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 15:19:00,156 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6854 states.
[2025-03-03 15:19:00,220 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6854 to 6852.
[2025-03-03 15:19:00,230 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6852 states, 6851 states have (on average 1.5564151218800175) internal successors, (10663), 6851 states have internal predecessors, (10663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:00,239 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 10663 transitions.
[2025-03-03 15:19:00,239 INFO  L78                 Accepts]: Start accepts. Automaton has 6852 states and 10663 transitions. Word has length 128
[2025-03-03 15:19:00,240 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:00,240 INFO  L471      AbstractCegarLoop]: Abstraction has 6852 states and 10663 transitions.
[2025-03-03 15:19:00,240 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:00,240 INFO  L276                IsEmpty]: Start isEmpty. Operand 6852 states and 10663 transitions.
[2025-03-03 15:19:00,255 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-03-03 15:19:00,255 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:00,255 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]
[2025-03-03 15:19:00,255 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 15:19:00,256 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:00,256 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:00,256 INFO  L85        PathProgramCache]: Analyzing trace with hash -1331332646, now seen corresponding path program 1 times
[2025-03-03 15:19:00,256 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:00,257 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608021618]
[2025-03-03 15:19:00,257 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:00,257 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:00,272 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-03-03 15:19:00,283 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-03-03 15:19:00,289 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:00,290 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:00,354 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:00,354 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:00,354 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608021618]
[2025-03-03 15:19:00,354 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608021618] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:00,354 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:00,354 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 15:19:00,354 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113252066]
[2025-03-03 15:19:00,354 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:00,355 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 15:19:00,355 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:00,355 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 15:19:00,355 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 15:19:00,355 INFO  L87              Difference]: Start difference. First operand 6852 states and 10663 transitions. Second operand  has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:00,507 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:00,508 INFO  L93              Difference]: Finished difference Result 13625 states and 21244 transitions.
[2025-03-03 15:19:00,508 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 15:19:00,508 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129
[2025-03-03 15:19:00,508 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:00,519 INFO  L225             Difference]: With dead ends: 13625
[2025-03-03 15:19:00,519 INFO  L226             Difference]: Without dead ends: 6852
[2025-03-03 15:19:00,527 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-03 15:19:00,529 INFO  L435           NwaCegarLoop]: 169 mSDtfsCounter, 809 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:00,529 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 197 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 15:19:00,535 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6852 states.
[2025-03-03 15:19:00,598 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6852 to 6852.
[2025-03-03 15:19:00,609 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6852 states, 6851 states have (on average 1.545175886731864) internal successors, (10586), 6851 states have internal predecessors, (10586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:00,621 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 10586 transitions.
[2025-03-03 15:19:00,622 INFO  L78                 Accepts]: Start accepts. Automaton has 6852 states and 10586 transitions. Word has length 129
[2025-03-03 15:19:00,622 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:00,622 INFO  L471      AbstractCegarLoop]: Abstraction has 6852 states and 10586 transitions.
[2025-03-03 15:19:00,623 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:00,623 INFO  L276                IsEmpty]: Start isEmpty. Operand 6852 states and 10586 transitions.
[2025-03-03 15:19:00,624 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 131
[2025-03-03 15:19:00,624 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:00,624 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]
[2025-03-03 15:19:00,624 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 15:19:00,625 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:00,625 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:00,625 INFO  L85        PathProgramCache]: Analyzing trace with hash 162782168, now seen corresponding path program 1 times
[2025-03-03 15:19:00,625 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:00,625 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478340156]
[2025-03-03 15:19:00,625 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:00,625 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:00,641 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes.
[2025-03-03 15:19:00,653 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements.
[2025-03-03 15:19:00,653 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:00,653 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:00,737 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:00,738 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:00,738 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478340156]
[2025-03-03 15:19:00,738 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478340156] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:00,738 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:00,738 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 15:19:00,738 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379660082]
[2025-03-03 15:19:00,738 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:00,739 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 15:19:00,739 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:00,739 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 15:19:00,739 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 15:19:00,739 INFO  L87              Difference]: Start difference. First operand 6852 states and 10586 transitions. Second operand  has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:00,886 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:00,886 INFO  L93              Difference]: Finished difference Result 13621 states and 21086 transitions.
[2025-03-03 15:19:00,887 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 15:19:00,887 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130
[2025-03-03 15:19:00,887 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:00,896 INFO  L225             Difference]: With dead ends: 13621
[2025-03-03 15:19:00,896 INFO  L226             Difference]: Without dead ends: 6852
[2025-03-03 15:19:00,903 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-03 15:19:00,904 INFO  L435           NwaCegarLoop]: 169 mSDtfsCounter, 791 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:00,904 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 205 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 15:19:00,909 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6852 states.
[2025-03-03 15:19:00,964 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6852 to 6852.
[2025-03-03 15:19:00,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6852 states, 6851 states have (on average 1.5339366515837105) internal successors, (10509), 6851 states have internal predecessors, (10509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:00,979 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 10509 transitions.
[2025-03-03 15:19:00,980 INFO  L78                 Accepts]: Start accepts. Automaton has 6852 states and 10509 transitions. Word has length 130
[2025-03-03 15:19:00,980 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:00,980 INFO  L471      AbstractCegarLoop]: Abstraction has 6852 states and 10509 transitions.
[2025-03-03 15:19:00,980 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:00,980 INFO  L276                IsEmpty]: Start isEmpty. Operand 6852 states and 10509 transitions.
[2025-03-03 15:19:00,982 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2025-03-03 15:19:00,982 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:00,982 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]
[2025-03-03 15:19:00,982 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-03 15:19:00,982 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:00,982 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:00,983 INFO  L85        PathProgramCache]: Analyzing trace with hash 179230454, now seen corresponding path program 1 times
[2025-03-03 15:19:00,983 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:00,983 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702519929]
[2025-03-03 15:19:00,983 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:00,983 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:01,000 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes.
[2025-03-03 15:19:01,012 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements.
[2025-03-03 15:19:01,012 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:01,012 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:01,072 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:01,072 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:01,072 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702519929]
[2025-03-03 15:19:01,073 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702519929] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:01,074 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:01,074 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 15:19:01,074 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263419105]
[2025-03-03 15:19:01,074 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:01,074 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 15:19:01,074 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:01,074 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 15:19:01,075 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 15:19:01,075 INFO  L87              Difference]: Start difference. First operand 6852 states and 10509 transitions. Second operand  has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:01,222 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:01,223 INFO  L93              Difference]: Finished difference Result 13633 states and 20946 transitions.
[2025-03-03 15:19:01,223 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 15:19:01,223 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131
[2025-03-03 15:19:01,223 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:01,232 INFO  L225             Difference]: With dead ends: 13633
[2025-03-03 15:19:01,233 INFO  L226             Difference]: Without dead ends: 6852
[2025-03-03 15:19:01,239 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-03 15:19:01,240 INFO  L435           NwaCegarLoop]: 169 mSDtfsCounter, 819 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:01,241 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 181 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 15:19:01,246 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6852 states.
[2025-03-03 15:19:01,327 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6852 to 6852.
[2025-03-03 15:19:01,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6852 states, 6851 states have (on average 1.522697416435557) internal successors, (10432), 6851 states have internal predecessors, (10432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:01,343 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 10432 transitions.
[2025-03-03 15:19:01,343 INFO  L78                 Accepts]: Start accepts. Automaton has 6852 states and 10432 transitions. Word has length 131
[2025-03-03 15:19:01,344 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:01,344 INFO  L471      AbstractCegarLoop]: Abstraction has 6852 states and 10432 transitions.
[2025-03-03 15:19:01,344 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:01,344 INFO  L276                IsEmpty]: Start isEmpty. Operand 6852 states and 10432 transitions.
[2025-03-03 15:19:01,346 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2025-03-03 15:19:01,346 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:01,346 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]
[2025-03-03 15:19:01,346 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 15:19:01,346 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:01,347 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:01,347 INFO  L85        PathProgramCache]: Analyzing trace with hash 635032564, now seen corresponding path program 1 times
[2025-03-03 15:19:01,347 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:01,348 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973879420]
[2025-03-03 15:19:01,348 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:01,348 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:01,371 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes.
[2025-03-03 15:19:01,383 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements.
[2025-03-03 15:19:01,383 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:01,383 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:01,452 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:01,452 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:01,452 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973879420]
[2025-03-03 15:19:01,452 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973879420] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:01,452 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:01,452 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 15:19:01,452 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965120170]
[2025-03-03 15:19:01,452 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:01,453 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 15:19:01,453 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:01,453 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 15:19:01,453 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 15:19:01,453 INFO  L87              Difference]: Start difference. First operand 6852 states and 10432 transitions. Second operand  has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:01,599 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:01,599 INFO  L93              Difference]: Finished difference Result 13629 states and 20788 transitions.
[2025-03-03 15:19:01,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 15:19:01,600 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132
[2025-03-03 15:19:01,600 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:01,608 INFO  L225             Difference]: With dead ends: 13629
[2025-03-03 15:19:01,608 INFO  L226             Difference]: Without dead ends: 6852
[2025-03-03 15:19:01,615 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-03 15:19:01,616 INFO  L435           NwaCegarLoop]: 169 mSDtfsCounter, 801 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:01,616 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 189 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 15:19:01,620 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6852 states.
[2025-03-03 15:19:01,670 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6852 to 6852.
[2025-03-03 15:19:01,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6852 states, 6851 states have (on average 1.5114581812874033) internal successors, (10355), 6851 states have internal predecessors, (10355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:01,684 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 10355 transitions.
[2025-03-03 15:19:01,684 INFO  L78                 Accepts]: Start accepts. Automaton has 6852 states and 10355 transitions. Word has length 132
[2025-03-03 15:19:01,685 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:01,685 INFO  L471      AbstractCegarLoop]: Abstraction has 6852 states and 10355 transitions.
[2025-03-03 15:19:01,685 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:01,685 INFO  L276                IsEmpty]: Start isEmpty. Operand 6852 states and 10355 transitions.
[2025-03-03 15:19:01,686 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2025-03-03 15:19:01,686 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:01,687 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]
[2025-03-03 15:19:01,687 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-03 15:19:01,687 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:01,688 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:01,688 INFO  L85        PathProgramCache]: Analyzing trace with hash 611743762, now seen corresponding path program 1 times
[2025-03-03 15:19:01,688 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:01,688 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753007474]
[2025-03-03 15:19:01,688 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:01,688 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:01,719 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes.
[2025-03-03 15:19:01,734 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements.
[2025-03-03 15:19:01,734 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:01,734 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:01,828 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:01,828 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:01,828 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753007474]
[2025-03-03 15:19:01,829 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753007474] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:01,829 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:01,829 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 15:19:01,829 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165530620]
[2025-03-03 15:19:01,829 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:01,829 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 15:19:01,829 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:01,829 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 15:19:01,829 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 15:19:01,830 INFO  L87              Difference]: Start difference. First operand 6852 states and 10355 transitions. Second operand  has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:01,987 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:01,987 INFO  L93              Difference]: Finished difference Result 13617 states and 20622 transitions.
[2025-03-03 15:19:01,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 15:19:01,988 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133
[2025-03-03 15:19:01,988 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:01,998 INFO  L225             Difference]: With dead ends: 13617
[2025-03-03 15:19:01,998 INFO  L226             Difference]: Without dead ends: 6852
[2025-03-03 15:19:02,004 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-03 15:19:02,005 INFO  L435           NwaCegarLoop]: 169 mSDtfsCounter, 759 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:02,005 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 213 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 15:19:02,008 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6852 states.
[2025-03-03 15:19:02,076 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6852 to 6852.
[2025-03-03 15:19:02,081 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6852 states, 6851 states have (on average 1.5002189461392497) internal successors, (10278), 6851 states have internal predecessors, (10278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:02,088 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 10278 transitions.
[2025-03-03 15:19:02,088 INFO  L78                 Accepts]: Start accepts. Automaton has 6852 states and 10278 transitions. Word has length 133
[2025-03-03 15:19:02,088 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:02,088 INFO  L471      AbstractCegarLoop]: Abstraction has 6852 states and 10278 transitions.
[2025-03-03 15:19:02,089 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:02,089 INFO  L276                IsEmpty]: Start isEmpty. Operand 6852 states and 10278 transitions.
[2025-03-03 15:19:02,090 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-03-03 15:19:02,090 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:02,090 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]
[2025-03-03 15:19:02,090 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-03 15:19:02,091 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:02,091 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:02,091 INFO  L85        PathProgramCache]: Analyzing trace with hash 223019552, now seen corresponding path program 1 times
[2025-03-03 15:19:02,091 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:02,091 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210719452]
[2025-03-03 15:19:02,091 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:02,092 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:02,107 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-03 15:19:02,117 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-03 15:19:02,118 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:02,118 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:02,194 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:02,194 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:02,194 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210719452]
[2025-03-03 15:19:02,194 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210719452] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:02,194 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:02,194 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 15:19:02,194 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4727525]
[2025-03-03 15:19:02,194 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:02,194 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 15:19:02,194 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:02,195 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 15:19:02,195 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 15:19:02,195 INFO  L87              Difference]: Start difference. First operand 6852 states and 10278 transitions. Second operand  has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:02,329 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:02,330 INFO  L93              Difference]: Finished difference Result 13609 states and 20460 transitions.
[2025-03-03 15:19:02,330 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 15:19:02,330 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134
[2025-03-03 15:19:02,330 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:02,340 INFO  L225             Difference]: With dead ends: 13609
[2025-03-03 15:19:02,340 INFO  L226             Difference]: Without dead ends: 6852
[2025-03-03 15:19:02,346 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-03 15:19:02,347 INFO  L435           NwaCegarLoop]: 173 mSDtfsCounter, 730 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:02,347 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 233 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 15:19:02,350 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6852 states.
[2025-03-03 15:19:02,437 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6852 to 6852.
[2025-03-03 15:19:02,441 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6852 states, 6851 states have (on average 1.4889797109910963) internal successors, (10201), 6851 states have internal predecessors, (10201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:02,448 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 10201 transitions.
[2025-03-03 15:19:02,448 INFO  L78                 Accepts]: Start accepts. Automaton has 6852 states and 10201 transitions. Word has length 134
[2025-03-03 15:19:02,448 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:02,448 INFO  L471      AbstractCegarLoop]: Abstraction has 6852 states and 10201 transitions.
[2025-03-03 15:19:02,448 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:02,449 INFO  L276                IsEmpty]: Start isEmpty. Operand 6852 states and 10201 transitions.
[2025-03-03 15:19:02,450 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 136
[2025-03-03 15:19:02,450 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:02,450 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]
[2025-03-03 15:19:02,450 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-03 15:19:02,450 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:02,451 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:02,451 INFO  L85        PathProgramCache]: Analyzing trace with hash -739119990, now seen corresponding path program 1 times
[2025-03-03 15:19:02,451 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:02,451 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946455642]
[2025-03-03 15:19:02,451 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:02,451 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:02,467 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes.
[2025-03-03 15:19:02,488 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements.
[2025-03-03 15:19:02,488 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:02,488 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:02,851 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:02,851 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:02,851 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946455642]
[2025-03-03 15:19:02,851 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946455642] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:02,851 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:02,851 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-03-03 15:19:02,851 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693443164]
[2025-03-03 15:19:02,851 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:02,852 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-03-03 15:19:02,852 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:02,852 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-03-03 15:19:02,852 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156
[2025-03-03 15:19:02,852 INFO  L87              Difference]: Start difference. First operand 6852 states and 10201 transitions. Second operand  has 13 states, 13 states have (on average 10.384615384615385) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:03,495 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:03,495 INFO  L93              Difference]: Finished difference Result 20163 states and 29958 transitions.
[2025-03-03 15:19:03,496 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-03 15:19:03,496 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 10.384615384615385) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135
[2025-03-03 15:19:03,496 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:03,520 INFO  L225             Difference]: With dead ends: 20163
[2025-03-03 15:19:03,520 INFO  L226             Difference]: Without dead ends: 13719
[2025-03-03 15:19:03,528 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600
[2025-03-03 15:19:03,529 INFO  L435           NwaCegarLoop]: 164 mSDtfsCounter, 1531 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:03,531 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1531 Valid, 878 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 15:19:03,541 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13719 states.
[2025-03-03 15:19:03,619 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13719 to 6903.
[2025-03-03 15:19:03,625 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6903 states, 6902 states have (on average 1.4878296146044625) internal successors, (10269), 6902 states have internal predecessors, (10269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:03,633 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6903 states to 6903 states and 10269 transitions.
[2025-03-03 15:19:03,633 INFO  L78                 Accepts]: Start accepts. Automaton has 6903 states and 10269 transitions. Word has length 135
[2025-03-03 15:19:03,633 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:03,633 INFO  L471      AbstractCegarLoop]: Abstraction has 6903 states and 10269 transitions.
[2025-03-03 15:19:03,633 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 10.384615384615385) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:03,633 INFO  L276                IsEmpty]: Start isEmpty. Operand 6903 states and 10269 transitions.
[2025-03-03 15:19:03,635 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2025-03-03 15:19:03,635 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:03,635 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]
[2025-03-03 15:19:03,635 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-03 15:19:03,635 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:03,635 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:03,635 INFO  L85        PathProgramCache]: Analyzing trace with hash -281124082, now seen corresponding path program 1 times
[2025-03-03 15:19:03,635 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:03,635 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399621766]
[2025-03-03 15:19:03,635 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:03,635 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:03,652 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes.
[2025-03-03 15:19:03,664 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements.
[2025-03-03 15:19:03,664 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:03,664 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:04,049 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:04,049 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:04,049 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399621766]
[2025-03-03 15:19:04,049 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399621766] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:04,049 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:04,050 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-03-03 15:19:04,050 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189333955]
[2025-03-03 15:19:04,050 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:04,050 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-03-03 15:19:04,050 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:04,051 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-03-03 15:19:04,051 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182
[2025-03-03 15:19:04,051 INFO  L87              Difference]: Start difference. First operand 6903 states and 10269 transitions. Second operand  has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 13 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:04,735 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:04,736 INFO  L93              Difference]: Finished difference Result 20638 states and 30583 transitions.
[2025-03-03 15:19:04,736 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2025-03-03 15:19:04,736 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 13 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136
[2025-03-03 15:19:04,736 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:04,758 INFO  L225             Difference]: With dead ends: 20638
[2025-03-03 15:19:04,758 INFO  L226             Difference]: Without dead ends: 14042
[2025-03-03 15:19:04,768 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702
[2025-03-03 15:19:04,770 INFO  L435           NwaCegarLoop]: 160 mSDtfsCounter, 1095 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:04,770 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 1089 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 15:19:04,778 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14042 states.
[2025-03-03 15:19:04,869 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14042 to 6975.
[2025-03-03 15:19:04,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6975 states, 6974 states have (on average 1.486664754803556) internal successors, (10368), 6974 states have internal predecessors, (10368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:04,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6975 states to 6975 states and 10368 transitions.
[2025-03-03 15:19:04,884 INFO  L78                 Accepts]: Start accepts. Automaton has 6975 states and 10368 transitions. Word has length 136
[2025-03-03 15:19:04,885 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:04,885 INFO  L471      AbstractCegarLoop]: Abstraction has 6975 states and 10368 transitions.
[2025-03-03 15:19:04,885 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 13 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:04,885 INFO  L276                IsEmpty]: Start isEmpty. Operand 6975 states and 10368 transitions.
[2025-03-03 15:19:04,886 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2025-03-03 15:19:04,886 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:04,887 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]
[2025-03-03 15:19:04,887 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-03 15:19:04,887 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:04,887 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:04,887 INFO  L85        PathProgramCache]: Analyzing trace with hash 1533370902, now seen corresponding path program 1 times
[2025-03-03 15:19:04,887 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:04,887 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102271400]
[2025-03-03 15:19:04,887 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:04,888 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:04,903 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes.
[2025-03-03 15:19:04,922 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements.
[2025-03-03 15:19:04,922 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:04,923 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:05,339 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:05,339 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:05,339 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102271400]
[2025-03-03 15:19:05,339 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102271400] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:05,339 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:05,339 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-03-03 15:19:05,339 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573281465]
[2025-03-03 15:19:05,340 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:05,340 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-03-03 15:19:05,340 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:05,341 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-03-03 15:19:05,341 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156
[2025-03-03 15:19:05,341 INFO  L87              Difference]: Start difference. First operand 6975 states and 10368 transitions. Second operand  has 13 states, 13 states have (on average 10.461538461538462) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:05,936 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:05,937 INFO  L93              Difference]: Finished difference Result 20320 states and 30204 transitions.
[2025-03-03 15:19:05,938 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-03 15:19:05,938 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 10.461538461538462) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136
[2025-03-03 15:19:05,938 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:05,957 INFO  L225             Difference]: With dead ends: 20320
[2025-03-03 15:19:05,958 INFO  L226             Difference]: Without dead ends: 13751
[2025-03-03 15:19:05,967 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600
[2025-03-03 15:19:05,969 INFO  L435           NwaCegarLoop]: 164 mSDtfsCounter, 1465 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:05,969 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 886 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 15:19:05,975 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13751 states.
[2025-03-03 15:19:06,046 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13751 to 6975.
[2025-03-03 15:19:06,052 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6975 states, 6974 states have (on average 1.4848006882707199) internal successors, (10355), 6974 states have internal predecessors, (10355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:06,060 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6975 states to 6975 states and 10355 transitions.
[2025-03-03 15:19:06,060 INFO  L78                 Accepts]: Start accepts. Automaton has 6975 states and 10355 transitions. Word has length 136
[2025-03-03 15:19:06,060 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:06,060 INFO  L471      AbstractCegarLoop]: Abstraction has 6975 states and 10355 transitions.
[2025-03-03 15:19:06,060 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 10.461538461538462) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:06,060 INFO  L276                IsEmpty]: Start isEmpty. Operand 6975 states and 10355 transitions.
[2025-03-03 15:19:06,062 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2025-03-03 15:19:06,062 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:06,062 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]
[2025-03-03 15:19:06,062 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-03-03 15:19:06,062 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:06,062 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:06,063 INFO  L85        PathProgramCache]: Analyzing trace with hash 460335364, now seen corresponding path program 1 times
[2025-03-03 15:19:06,063 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:06,064 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800358090]
[2025-03-03 15:19:06,064 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:06,064 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:06,077 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes.
[2025-03-03 15:19:06,116 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements.
[2025-03-03 15:19:06,116 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:06,117 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:06,362 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:06,362 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:06,362 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800358090]
[2025-03-03 15:19:06,362 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800358090] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:06,362 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:06,363 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 15:19:06,363 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242637523]
[2025-03-03 15:19:06,363 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:06,364 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-03 15:19:06,364 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:06,364 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-03 15:19:06,364 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-03-03 15:19:06,364 INFO  L87              Difference]: Start difference. First operand 6975 states and 10355 transitions. Second operand  has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:06,744 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:06,744 INFO  L93              Difference]: Finished difference Result 20047 states and 29863 transitions.
[2025-03-03 15:19:06,745 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-03 15:19:06,745 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137
[2025-03-03 15:19:06,745 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:06,762 INFO  L225             Difference]: With dead ends: 20047
[2025-03-03 15:19:06,763 INFO  L226             Difference]: Without dead ends: 13419
[2025-03-03 15:19:06,770 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240
[2025-03-03 15:19:06,770 INFO  L435           NwaCegarLoop]: 178 mSDtfsCounter, 1461 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1461 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:06,770 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1461 Valid, 783 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 15:19:06,776 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13419 states.
[2025-03-03 15:19:06,845 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13419 to 6975.
[2025-03-03 15:19:06,851 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6975 states, 6974 states have (on average 1.4846572985374247) internal successors, (10354), 6974 states have internal predecessors, (10354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:06,860 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6975 states to 6975 states and 10354 transitions.
[2025-03-03 15:19:06,860 INFO  L78                 Accepts]: Start accepts. Automaton has 6975 states and 10354 transitions. Word has length 137
[2025-03-03 15:19:06,860 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:06,860 INFO  L471      AbstractCegarLoop]: Abstraction has 6975 states and 10354 transitions.
[2025-03-03 15:19:06,860 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:06,860 INFO  L276                IsEmpty]: Start isEmpty. Operand 6975 states and 10354 transitions.
[2025-03-03 15:19:06,861 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2025-03-03 15:19:06,861 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:06,861 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]
[2025-03-03 15:19:06,862 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-03-03 15:19:06,862 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:06,862 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:06,862 INFO  L85        PathProgramCache]: Analyzing trace with hash -683967490, now seen corresponding path program 1 times
[2025-03-03 15:19:06,862 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:06,862 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780023785]
[2025-03-03 15:19:06,862 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:06,862 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:06,877 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes.
[2025-03-03 15:19:06,897 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements.
[2025-03-03 15:19:06,897 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:06,897 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:07,092 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:07,092 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:07,093 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780023785]
[2025-03-03 15:19:07,093 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780023785] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:07,093 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:07,093 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-03 15:19:07,093 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051868966]
[2025-03-03 15:19:07,093 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:07,094 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 15:19:07,094 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:07,094 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 15:19:07,094 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2025-03-03 15:19:07,094 INFO  L87              Difference]: Start difference. First operand 6975 states and 10354 transitions. Second operand  has 10 states, 10 states have (on average 13.8) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:07,516 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:07,516 INFO  L93              Difference]: Finished difference Result 20438 states and 30346 transitions.
[2025-03-03 15:19:07,516 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-03-03 15:19:07,516 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 13.8) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138
[2025-03-03 15:19:07,517 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:07,530 INFO  L225             Difference]: With dead ends: 20438
[2025-03-03 15:19:07,530 INFO  L226             Difference]: Without dead ends: 13814
[2025-03-03 15:19:07,538 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420
[2025-03-03 15:19:07,538 INFO  L435           NwaCegarLoop]: 164 mSDtfsCounter, 797 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:07,538 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 796 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 15:19:07,545 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13814 states.
[2025-03-03 15:19:07,620 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13814 to 6903.
[2025-03-03 15:19:07,626 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6903 states, 6902 states have (on average 1.484207476093886) internal successors, (10244), 6902 states have internal predecessors, (10244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:07,634 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6903 states to 6903 states and 10244 transitions.
[2025-03-03 15:19:07,634 INFO  L78                 Accepts]: Start accepts. Automaton has 6903 states and 10244 transitions. Word has length 138
[2025-03-03 15:19:07,634 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:07,634 INFO  L471      AbstractCegarLoop]: Abstraction has 6903 states and 10244 transitions.
[2025-03-03 15:19:07,635 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.8) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:07,635 INFO  L276                IsEmpty]: Start isEmpty. Operand 6903 states and 10244 transitions.
[2025-03-03 15:19:07,636 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2025-03-03 15:19:07,636 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:07,636 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]
[2025-03-03 15:19:07,636 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-03-03 15:19:07,636 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:07,637 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:07,637 INFO  L85        PathProgramCache]: Analyzing trace with hash -1431752733, now seen corresponding path program 1 times
[2025-03-03 15:19:07,637 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:07,637 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937089374]
[2025-03-03 15:19:07,637 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:07,638 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:07,651 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes.
[2025-03-03 15:19:07,679 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements.
[2025-03-03 15:19:07,683 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:07,683 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:08,066 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:08,066 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:08,066 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937089374]
[2025-03-03 15:19:08,067 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937089374] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:08,067 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:08,067 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-03-03 15:19:08,067 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174595178]
[2025-03-03 15:19:08,067 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:08,067 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-03-03 15:19:08,068 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:08,068 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-03-03 15:19:08,068 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2025-03-03 15:19:08,068 INFO  L87              Difference]: Start difference. First operand 6903 states and 10244 transitions. Second operand  has 12 states, 12 states have (on average 11.5) internal successors, (138), 11 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:09,075 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:09,076 INFO  L93              Difference]: Finished difference Result 17257 states and 25580 transitions.
[2025-03-03 15:19:09,076 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-03-03 15:19:09,076 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 11.5) internal successors, (138), 11 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138
[2025-03-03 15:19:09,076 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:09,086 INFO  L225             Difference]: With dead ends: 17257
[2025-03-03 15:19:09,086 INFO  L226             Difference]: Without dead ends: 10543
[2025-03-03 15:19:09,092 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702
[2025-03-03 15:19:09,093 INFO  L435           NwaCegarLoop]: 363 mSDtfsCounter, 1206 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 1816 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 2029 SdHoareTripleChecker+Invalid, 1832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:09,093 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 2029 Invalid, 1832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1816 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 15:19:09,098 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10543 states.
[2025-03-03 15:19:09,154 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10543 to 6903.
[2025-03-03 15:19:09,162 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6903 states, 6902 states have (on average 1.4837728194726165) internal successors, (10241), 6902 states have internal predecessors, (10241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:09,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6903 states to 6903 states and 10241 transitions.
[2025-03-03 15:19:09,170 INFO  L78                 Accepts]: Start accepts. Automaton has 6903 states and 10241 transitions. Word has length 138
[2025-03-03 15:19:09,170 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:09,170 INFO  L471      AbstractCegarLoop]: Abstraction has 6903 states and 10241 transitions.
[2025-03-03 15:19:09,170 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 11.5) internal successors, (138), 11 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:09,170 INFO  L276                IsEmpty]: Start isEmpty. Operand 6903 states and 10241 transitions.
[2025-03-03 15:19:09,171 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 140
[2025-03-03 15:19:09,172 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:09,172 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]
[2025-03-03 15:19:09,172 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-03-03 15:19:09,172 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:09,172 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:09,172 INFO  L85        PathProgramCache]: Analyzing trace with hash -486832639, now seen corresponding path program 1 times
[2025-03-03 15:19:09,172 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:09,172 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643372231]
[2025-03-03 15:19:09,172 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:09,173 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:09,187 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes.
[2025-03-03 15:19:09,198 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements.
[2025-03-03 15:19:09,198 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:09,199 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:09,441 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:09,441 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:09,441 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643372231]
[2025-03-03 15:19:09,442 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643372231] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:09,442 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:09,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-03 15:19:09,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773258310]
[2025-03-03 15:19:09,443 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:09,443 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 15:19:09,443 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:09,444 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 15:19:09,444 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2025-03-03 15:19:09,444 INFO  L87              Difference]: Start difference. First operand 6903 states and 10241 transitions. Second operand  has 10 states, 10 states have (on average 13.9) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:09,972 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:09,972 INFO  L93              Difference]: Finished difference Result 20468 states and 30389 transitions.
[2025-03-03 15:19:09,972 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-03-03 15:19:09,972 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 13.9) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139
[2025-03-03 15:19:09,973 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:09,985 INFO  L225             Difference]: With dead ends: 20468
[2025-03-03 15:19:09,985 INFO  L226             Difference]: Without dead ends: 13769
[2025-03-03 15:19:09,992 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420
[2025-03-03 15:19:09,992 INFO  L435           NwaCegarLoop]: 257 mSDtfsCounter, 1137 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:09,993 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1137 Valid, 1257 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 15:19:09,999 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13769 states.
[2025-03-03 15:19:10,070 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13769 to 6903.
[2025-03-03 15:19:10,075 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6903 states, 6902 states have (on average 1.4829035062300782) internal successors, (10235), 6902 states have internal predecessors, (10235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:10,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6903 states to 6903 states and 10235 transitions.
[2025-03-03 15:19:10,082 INFO  L78                 Accepts]: Start accepts. Automaton has 6903 states and 10235 transitions. Word has length 139
[2025-03-03 15:19:10,082 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:10,082 INFO  L471      AbstractCegarLoop]: Abstraction has 6903 states and 10235 transitions.
[2025-03-03 15:19:10,082 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.9) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:10,082 INFO  L276                IsEmpty]: Start isEmpty. Operand 6903 states and 10235 transitions.
[2025-03-03 15:19:10,084 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2025-03-03 15:19:10,084 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:10,084 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]
[2025-03-03 15:19:10,084 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-03-03 15:19:10,084 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:10,084 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:10,084 INFO  L85        PathProgramCache]: Analyzing trace with hash 1281407179, now seen corresponding path program 1 times
[2025-03-03 15:19:10,085 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:10,085 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825564765]
[2025-03-03 15:19:10,085 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:10,085 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:10,096 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes.
[2025-03-03 15:19:10,121 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements.
[2025-03-03 15:19:10,122 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:10,122 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:10,307 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:10,308 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:10,308 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825564765]
[2025-03-03 15:19:10,308 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825564765] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:10,308 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:10,308 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-03 15:19:10,308 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234402837]
[2025-03-03 15:19:10,308 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:10,308 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 15:19:10,308 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:10,309 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 15:19:10,309 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2025-03-03 15:19:10,309 INFO  L87              Difference]: Start difference. First operand 6903 states and 10235 transitions. Second operand  has 10 states, 10 states have (on average 14.0) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:10,879 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:10,879 INFO  L93              Difference]: Finished difference Result 20423 states and 30311 transitions.
[2025-03-03 15:19:10,880 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-03-03 15:19:10,880 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 14.0) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140
[2025-03-03 15:19:10,880 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:10,891 INFO  L225             Difference]: With dead ends: 20423
[2025-03-03 15:19:10,891 INFO  L226             Difference]: Without dead ends: 13754
[2025-03-03 15:19:10,896 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420
[2025-03-03 15:19:10,896 INFO  L435           NwaCegarLoop]: 253 mSDtfsCounter, 843 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:10,897 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1238 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 15:19:10,902 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13754 states.
[2025-03-03 15:19:10,977 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13754 to 6903.
[2025-03-03 15:19:10,982 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6903 states, 6902 states have (on average 1.4815995363662706) internal successors, (10226), 6902 states have internal predecessors, (10226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:10,989 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6903 states to 6903 states and 10226 transitions.
[2025-03-03 15:19:10,989 INFO  L78                 Accepts]: Start accepts. Automaton has 6903 states and 10226 transitions. Word has length 140
[2025-03-03 15:19:10,989 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:10,989 INFO  L471      AbstractCegarLoop]: Abstraction has 6903 states and 10226 transitions.
[2025-03-03 15:19:10,989 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 14.0) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:10,990 INFO  L276                IsEmpty]: Start isEmpty. Operand 6903 states and 10226 transitions.
[2025-03-03 15:19:10,991 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 142
[2025-03-03 15:19:10,991 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:10,991 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]
[2025-03-03 15:19:10,991 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2025-03-03 15:19:10,991 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:10,991 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:10,991 INFO  L85        PathProgramCache]: Analyzing trace with hash -124898791, now seen corresponding path program 1 times
[2025-03-03 15:19:10,992 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:10,992 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118194686]
[2025-03-03 15:19:10,992 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:10,992 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:11,005 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes.
[2025-03-03 15:19:11,016 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements.
[2025-03-03 15:19:11,017 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:11,017 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:11,204 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:11,205 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:11,205 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118194686]
[2025-03-03 15:19:11,205 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118194686] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:11,205 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:11,205 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-03 15:19:11,205 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207419051]
[2025-03-03 15:19:11,205 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:11,205 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 15:19:11,205 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:11,206 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 15:19:11,206 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2025-03-03 15:19:11,206 INFO  L87              Difference]: Start difference. First operand 6903 states and 10226 transitions. Second operand  has 10 states, 10 states have (on average 14.1) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:11,666 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:11,666 INFO  L93              Difference]: Finished difference Result 20128 states and 29870 transitions.
[2025-03-03 15:19:11,667 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-03-03 15:19:11,667 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 14.1) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141
[2025-03-03 15:19:11,667 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:11,677 INFO  L225             Difference]: With dead ends: 20128
[2025-03-03 15:19:11,677 INFO  L226             Difference]: Without dead ends: 13624
[2025-03-03 15:19:11,684 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420
[2025-03-03 15:19:11,684 INFO  L435           NwaCegarLoop]: 241 mSDtfsCounter, 872 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:11,685 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1181 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 15:19:11,691 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13624 states.
[2025-03-03 15:19:11,756 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13624 to 6903.
[2025-03-03 15:19:11,760 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6903 states, 6902 states have (on average 1.4794262532599247) internal successors, (10211), 6902 states have internal predecessors, (10211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:11,766 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6903 states to 6903 states and 10211 transitions.
[2025-03-03 15:19:11,767 INFO  L78                 Accepts]: Start accepts. Automaton has 6903 states and 10211 transitions. Word has length 141
[2025-03-03 15:19:11,767 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:11,767 INFO  L471      AbstractCegarLoop]: Abstraction has 6903 states and 10211 transitions.
[2025-03-03 15:19:11,767 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 14.1) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:11,767 INFO  L276                IsEmpty]: Start isEmpty. Operand 6903 states and 10211 transitions.
[2025-03-03 15:19:11,768 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2025-03-03 15:19:11,768 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:11,768 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]
[2025-03-03 15:19:11,768 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2025-03-03 15:19:11,768 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:11,769 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:11,769 INFO  L85        PathProgramCache]: Analyzing trace with hash 1899601075, now seen corresponding path program 1 times
[2025-03-03 15:19:11,769 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:11,769 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103564715]
[2025-03-03 15:19:11,769 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:11,769 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:11,781 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes.
[2025-03-03 15:19:11,840 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements.
[2025-03-03 15:19:11,840 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:11,840 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:12,353 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:12,354 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:12,354 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103564715]
[2025-03-03 15:19:12,354 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103564715] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:12,354 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:12,354 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-03-03 15:19:12,354 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154306421]
[2025-03-03 15:19:12,354 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:12,355 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-03-03 15:19:12,355 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:12,355 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-03-03 15:19:12,355 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182
[2025-03-03 15:19:12,355 INFO  L87              Difference]: Start difference. First operand 6903 states and 10211 transitions. Second operand  has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:13,143 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:13,143 INFO  L93              Difference]: Finished difference Result 28250 states and 41991 transitions.
[2025-03-03 15:19:13,144 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-03-03 15:19:13,144 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142
[2025-03-03 15:19:13,144 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:13,163 INFO  L225             Difference]: With dead ends: 28250
[2025-03-03 15:19:13,163 INFO  L226             Difference]: Without dead ends: 26816
[2025-03-03 15:19:13,166 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702
[2025-03-03 15:19:13,166 INFO  L435           NwaCegarLoop]: 705 mSDtfsCounter, 1314 mSDsluCounter, 4427 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 5132 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:13,166 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 5132 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 15:19:13,174 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26816 states.
[2025-03-03 15:19:13,282 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26816 to 6865.
[2025-03-03 15:19:13,287 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6865 states, 6864 states have (on average 1.4787296037296038) internal successors, (10150), 6864 states have internal predecessors, (10150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:13,293 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6865 states to 6865 states and 10150 transitions.
[2025-03-03 15:19:13,293 INFO  L78                 Accepts]: Start accepts. Automaton has 6865 states and 10150 transitions. Word has length 142
[2025-03-03 15:19:13,294 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:13,294 INFO  L471      AbstractCegarLoop]: Abstraction has 6865 states and 10150 transitions.
[2025-03-03 15:19:13,294 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:13,294 INFO  L276                IsEmpty]: Start isEmpty. Operand 6865 states and 10150 transitions.
[2025-03-03 15:19:13,295 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2025-03-03 15:19:13,295 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:13,295 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]
[2025-03-03 15:19:13,295 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2025-03-03 15:19:13,295 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:13,296 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:13,296 INFO  L85        PathProgramCache]: Analyzing trace with hash -817396813, now seen corresponding path program 1 times
[2025-03-03 15:19:13,296 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:13,296 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982463206]
[2025-03-03 15:19:13,296 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:13,296 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:13,308 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes.
[2025-03-03 15:19:13,345 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements.
[2025-03-03 15:19:13,345 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:13,345 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:13,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:13,803 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:13,803 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982463206]
[2025-03-03 15:19:13,803 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982463206] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:13,803 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:13,803 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-03-03 15:19:13,803 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143883737]
[2025-03-03 15:19:13,803 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:13,804 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-03-03 15:19:13,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:13,804 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-03-03 15:19:13,804 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2025-03-03 15:19:13,804 INFO  L87              Difference]: Start difference. First operand 6865 states and 10150 transitions. Second operand  has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:14,296 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:14,296 INFO  L93              Difference]: Finished difference Result 14819 states and 22003 transitions.
[2025-03-03 15:19:14,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-03 15:19:14,296 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142
[2025-03-03 15:19:14,297 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:14,309 INFO  L225             Difference]: With dead ends: 14819
[2025-03-03 15:19:14,309 INFO  L226             Difference]: Without dead ends: 13425
[2025-03-03 15:19:14,313 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600
[2025-03-03 15:19:14,314 INFO  L435           NwaCegarLoop]: 278 mSDtfsCounter, 1449 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:14,314 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 1910 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 15:19:14,320 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13425 states.
[2025-03-03 15:19:14,418 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13425 to 6847.
[2025-03-03 15:19:14,422 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6847 states, 6846 states have (on average 1.4775051124744376) internal successors, (10115), 6846 states have internal predecessors, (10115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:14,430 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6847 states to 6847 states and 10115 transitions.
[2025-03-03 15:19:14,430 INFO  L78                 Accepts]: Start accepts. Automaton has 6847 states and 10115 transitions. Word has length 142
[2025-03-03 15:19:14,430 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:14,430 INFO  L471      AbstractCegarLoop]: Abstraction has 6847 states and 10115 transitions.
[2025-03-03 15:19:14,430 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:14,430 INFO  L276                IsEmpty]: Start isEmpty. Operand 6847 states and 10115 transitions.
[2025-03-03 15:19:14,431 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2025-03-03 15:19:14,431 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:14,431 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]
[2025-03-03 15:19:14,432 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2025-03-03 15:19:14,432 INFO  L396      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:14,432 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:14,432 INFO  L85        PathProgramCache]: Analyzing trace with hash 1207681910, now seen corresponding path program 1 times
[2025-03-03 15:19:14,432 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:14,432 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711126235]
[2025-03-03 15:19:14,432 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:14,432 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:14,448 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes.
[2025-03-03 15:19:14,471 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements.
[2025-03-03 15:19:14,471 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:14,471 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:14,889 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:14,889 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:14,889 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711126235]
[2025-03-03 15:19:14,889 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711126235] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:14,889 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:14,889 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-03-03 15:19:14,889 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142197058]
[2025-03-03 15:19:14,889 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:14,890 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-03-03 15:19:14,890 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:14,890 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-03-03 15:19:14,890 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2025-03-03 15:19:14,890 INFO  L87              Difference]: Start difference. First operand 6847 states and 10115 transitions. Second operand  has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:15,422 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:15,422 INFO  L93              Difference]: Finished difference Result 14856 states and 22034 transitions.
[2025-03-03 15:19:15,422 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-03 15:19:15,423 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142
[2025-03-03 15:19:15,423 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:15,431 INFO  L225             Difference]: With dead ends: 14856
[2025-03-03 15:19:15,431 INFO  L226             Difference]: Without dead ends: 13442
[2025-03-03 15:19:15,433 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600
[2025-03-03 15:19:15,433 INFO  L435           NwaCegarLoop]: 392 mSDtfsCounter, 1035 mSDsluCounter, 2400 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:15,433 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 2792 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 15:19:15,437 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13442 states.
[2025-03-03 15:19:15,501 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13442 to 6819.
[2025-03-03 15:19:15,504 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6819 states, 6818 states have (on average 1.476972719272514) internal successors, (10070), 6818 states have internal predecessors, (10070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:15,509 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6819 states to 6819 states and 10070 transitions.
[2025-03-03 15:19:15,509 INFO  L78                 Accepts]: Start accepts. Automaton has 6819 states and 10070 transitions. Word has length 142
[2025-03-03 15:19:15,509 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:15,509 INFO  L471      AbstractCegarLoop]: Abstraction has 6819 states and 10070 transitions.
[2025-03-03 15:19:15,509 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:15,509 INFO  L276                IsEmpty]: Start isEmpty. Operand 6819 states and 10070 transitions.
[2025-03-03 15:19:15,510 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2025-03-03 15:19:15,510 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:15,510 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]
[2025-03-03 15:19:15,510 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2025-03-03 15:19:15,510 INFO  L396      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:15,511 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:15,511 INFO  L85        PathProgramCache]: Analyzing trace with hash 1985823174, now seen corresponding path program 1 times
[2025-03-03 15:19:15,511 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:15,511 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512885130]
[2025-03-03 15:19:15,511 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:15,511 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:15,523 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes.
[2025-03-03 15:19:15,551 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements.
[2025-03-03 15:19:15,551 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:15,551 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:15,992 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:15,992 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:15,992 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512885130]
[2025-03-03 15:19:15,992 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512885130] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:15,992 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:15,992 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-03-03 15:19:15,992 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26132060]
[2025-03-03 15:19:15,992 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:15,992 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-03-03 15:19:15,992 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:15,993 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-03-03 15:19:15,993 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182
[2025-03-03 15:19:15,993 INFO  L87              Difference]: Start difference. First operand 6819 states and 10070 transitions. Second operand  has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:16,669 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:16,669 INFO  L93              Difference]: Finished difference Result 27670 states and 41164 transitions.
[2025-03-03 15:19:16,670 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-03-03 15:19:16,670 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142
[2025-03-03 15:19:16,670 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:16,689 INFO  L225             Difference]: With dead ends: 27670
[2025-03-03 15:19:16,689 INFO  L226             Difference]: Without dead ends: 26296
[2025-03-03 15:19:16,692 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702
[2025-03-03 15:19:16,692 INFO  L435           NwaCegarLoop]: 644 mSDtfsCounter, 1251 mSDsluCounter, 3977 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 4621 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:16,692 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 4621 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 15:19:16,702 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26296 states.
[2025-03-03 15:19:16,792 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26296 to 6811.
[2025-03-03 15:19:16,796 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6811 states, 6810 states have (on average 1.4759177679882525) internal successors, (10051), 6810 states have internal predecessors, (10051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:16,802 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6811 states to 6811 states and 10051 transitions.
[2025-03-03 15:19:16,802 INFO  L78                 Accepts]: Start accepts. Automaton has 6811 states and 10051 transitions. Word has length 142
[2025-03-03 15:19:16,802 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:16,802 INFO  L471      AbstractCegarLoop]: Abstraction has 6811 states and 10051 transitions.
[2025-03-03 15:19:16,802 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:16,803 INFO  L276                IsEmpty]: Start isEmpty. Operand 6811 states and 10051 transitions.
[2025-03-03 15:19:16,803 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2025-03-03 15:19:16,803 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:16,803 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]
[2025-03-03 15:19:16,803 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2025-03-03 15:19:16,803 INFO  L396      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:16,804 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:16,804 INFO  L85        PathProgramCache]: Analyzing trace with hash 110466342, now seen corresponding path program 1 times
[2025-03-03 15:19:16,804 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:16,804 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974700441]
[2025-03-03 15:19:16,804 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:16,804 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:16,817 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes.
[2025-03-03 15:19:16,836 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements.
[2025-03-03 15:19:16,836 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:16,836 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:17,233 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:17,233 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:17,233 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974700441]
[2025-03-03 15:19:17,234 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974700441] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:17,234 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:17,234 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-03-03 15:19:17,234 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355733643]
[2025-03-03 15:19:17,234 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:17,234 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-03-03 15:19:17,234 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:17,235 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-03-03 15:19:17,235 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2025-03-03 15:19:17,235 INFO  L87              Difference]: Start difference. First operand 6811 states and 10051 transitions. Second operand  has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:17,675 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:17,675 INFO  L93              Difference]: Finished difference Result 14724 states and 21836 transitions.
[2025-03-03 15:19:17,676 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-03 15:19:17,676 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142
[2025-03-03 15:19:17,676 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:17,687 INFO  L225             Difference]: With dead ends: 14724
[2025-03-03 15:19:17,687 INFO  L226             Difference]: Without dead ends: 13270
[2025-03-03 15:19:17,691 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600
[2025-03-03 15:19:17,692 INFO  L435           NwaCegarLoop]: 294 mSDtfsCounter, 1483 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 2035 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:17,692 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 2035 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 15:19:17,697 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13270 states.
[2025-03-03 15:19:17,780 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13270 to 6739.
[2025-03-03 15:19:17,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6739 states, 6738 states have (on average 1.4778866132383497) internal successors, (9958), 6738 states have internal predecessors, (9958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:17,789 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6739 states to 6739 states and 9958 transitions.
[2025-03-03 15:19:17,789 INFO  L78                 Accepts]: Start accepts. Automaton has 6739 states and 9958 transitions. Word has length 142
[2025-03-03 15:19:17,789 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:17,789 INFO  L471      AbstractCegarLoop]: Abstraction has 6739 states and 9958 transitions.
[2025-03-03 15:19:17,789 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:17,790 INFO  L276                IsEmpty]: Start isEmpty. Operand 6739 states and 9958 transitions.
[2025-03-03 15:19:17,790 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2025-03-03 15:19:17,790 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:17,790 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]
[2025-03-03 15:19:17,790 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2025-03-03 15:19:17,790 INFO  L396      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:17,791 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:17,791 INFO  L85        PathProgramCache]: Analyzing trace with hash -1425556482, now seen corresponding path program 1 times
[2025-03-03 15:19:17,791 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:17,791 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779526155]
[2025-03-03 15:19:17,791 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:17,791 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:17,804 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes.
[2025-03-03 15:19:17,823 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements.
[2025-03-03 15:19:17,823 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:17,823 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:18,296 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:18,296 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:18,296 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779526155]
[2025-03-03 15:19:18,297 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779526155] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:18,297 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:18,297 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-03-03 15:19:18,297 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196076445]
[2025-03-03 15:19:18,297 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:18,297 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-03-03 15:19:18,297 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:18,297 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-03-03 15:19:18,298 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182
[2025-03-03 15:19:18,298 INFO  L87              Difference]: Start difference. First operand 6739 states and 9958 transitions. Second operand  has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:18,881 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:18,881 INFO  L93              Difference]: Finished difference Result 15988 states and 23733 transitions.
[2025-03-03 15:19:18,881 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-03-03 15:19:18,881 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142
[2025-03-03 15:19:18,882 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:18,895 INFO  L225             Difference]: With dead ends: 15988
[2025-03-03 15:19:18,895 INFO  L226             Difference]: Without dead ends: 14543
[2025-03-03 15:19:18,900 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702
[2025-03-03 15:19:18,900 INFO  L435           NwaCegarLoop]: 509 mSDtfsCounter, 1262 mSDsluCounter, 4293 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 4802 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:18,900 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 4802 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 15:19:18,907 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14543 states.
[2025-03-03 15:19:18,979 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14543 to 6652.
[2025-03-03 15:19:18,983 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6652 states, 6651 states have (on average 1.4809803037137272) internal successors, (9850), 6651 states have internal predecessors, (9850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:18,990 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6652 states to 6652 states and 9850 transitions.
[2025-03-03 15:19:18,990 INFO  L78                 Accepts]: Start accepts. Automaton has 6652 states and 9850 transitions. Word has length 142
[2025-03-03 15:19:18,990 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:18,990 INFO  L471      AbstractCegarLoop]: Abstraction has 6652 states and 9850 transitions.
[2025-03-03 15:19:18,990 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:18,990 INFO  L276                IsEmpty]: Start isEmpty. Operand 6652 states and 9850 transitions.
[2025-03-03 15:19:18,991 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2025-03-03 15:19:18,991 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:18,991 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]
[2025-03-03 15:19:18,991 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2025-03-03 15:19:18,991 INFO  L396      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:18,991 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:18,991 INFO  L85        PathProgramCache]: Analyzing trace with hash -371542314, now seen corresponding path program 1 times
[2025-03-03 15:19:18,991 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:18,991 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810554093]
[2025-03-03 15:19:18,992 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:18,992 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:19,004 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes.
[2025-03-03 15:19:19,052 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements.
[2025-03-03 15:19:19,052 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:19,052 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:22,857 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:22,857 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:22,857 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810554093]
[2025-03-03 15:19:22,858 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810554093] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:22,858 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:22,858 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52
[2025-03-03 15:19:22,858 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564631092]
[2025-03-03 15:19:22,858 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:22,858 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 52 states
[2025-03-03 15:19:22,858 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:22,859 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants.
[2025-03-03 15:19:22,859 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2479, Unknown=0, NotChecked=0, Total=2652
[2025-03-03 15:19:22,859 INFO  L87              Difference]: Start difference. First operand 6652 states and 9850 transitions. Second operand  has 52 states, 52 states have (on average 2.730769230769231) internal successors, (142), 52 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:36,512 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:36,512 INFO  L93              Difference]: Finished difference Result 12902 states and 19114 transitions.
[2025-03-03 15:19:36,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. 
[2025-03-03 15:19:36,513 INFO  L78                 Accepts]: Start accepts. Automaton has  has 52 states, 52 states have (on average 2.730769230769231) internal successors, (142), 52 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142
[2025-03-03 15:19:36,513 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:36,522 INFO  L225             Difference]: With dead ends: 12902
[2025-03-03 15:19:36,522 INFO  L226             Difference]: Without dead ends: 12222
[2025-03-03 15:19:36,525 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1413, Invalid=8289, Unknown=0, NotChecked=0, Total=9702
[2025-03-03 15:19:36,526 INFO  L435           NwaCegarLoop]: 1050 mSDtfsCounter, 3346 mSDsluCounter, 27711 mSDsCounter, 0 mSdLazyCounter, 18390 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3346 SdHoareTripleChecker+Valid, 28761 SdHoareTripleChecker+Invalid, 18411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 18390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:36,526 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3346 Valid, 28761 Invalid, 18411 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 18390 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time]
[2025-03-03 15:19:36,529 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12222 states.
[2025-03-03 15:19:36,589 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12222 to 6678.
[2025-03-03 15:19:36,594 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6678 states, 6677 states have (on average 1.48015575857421) internal successors, (9883), 6677 states have internal predecessors, (9883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:36,600 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6678 states to 6678 states and 9883 transitions.
[2025-03-03 15:19:36,601 INFO  L78                 Accepts]: Start accepts. Automaton has 6678 states and 9883 transitions. Word has length 142
[2025-03-03 15:19:36,601 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:36,601 INFO  L471      AbstractCegarLoop]: Abstraction has 6678 states and 9883 transitions.
[2025-03-03 15:19:36,601 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 52 states, 52 states have (on average 2.730769230769231) internal successors, (142), 52 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:36,601 INFO  L276                IsEmpty]: Start isEmpty. Operand 6678 states and 9883 transitions.
[2025-03-03 15:19:36,601 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 144
[2025-03-03 15:19:36,602 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:36,602 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]
[2025-03-03 15:19:36,602 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2025-03-03 15:19:36,602 INFO  L396      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:36,602 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:36,602 INFO  L85        PathProgramCache]: Analyzing trace with hash 155768389, now seen corresponding path program 1 times
[2025-03-03 15:19:36,602 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:36,602 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44653437]
[2025-03-03 15:19:36,602 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:36,602 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:36,615 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes.
[2025-03-03 15:19:36,650 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements.
[2025-03-03 15:19:36,650 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:36,650 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:36,729 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:36,729 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:36,729 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44653437]
[2025-03-03 15:19:36,729 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44653437] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:36,729 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:36,729 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 15:19:36,729 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543364395]
[2025-03-03 15:19:36,729 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:36,730 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 15:19:36,730 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:36,730 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 15:19:36,730 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 15:19:36,730 INFO  L87              Difference]: Start difference. First operand 6678 states and 9883 transitions. Second operand  has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:36,791 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:36,791 INFO  L93              Difference]: Finished difference Result 16131 states and 24005 transitions.
[2025-03-03 15:19:36,791 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 15:19:36,791 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143
[2025-03-03 15:19:36,791 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:36,800 INFO  L225             Difference]: With dead ends: 16131
[2025-03-03 15:19:36,800 INFO  L226             Difference]: Without dead ends: 9687
[2025-03-03 15:19:36,804 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 15:19:36,804 INFO  L435           NwaCegarLoop]: 276 mSDtfsCounter, 133 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:36,804 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 677 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 15:19:36,808 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9687 states.
[2025-03-03 15:19:36,869 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9687 to 9649.
[2025-03-03 15:19:36,877 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9649 states, 9648 states have (on average 1.4778192371475953) internal successors, (14258), 9648 states have internal predecessors, (14258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:36,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9649 states to 9649 states and 14258 transitions.
[2025-03-03 15:19:36,888 INFO  L78                 Accepts]: Start accepts. Automaton has 9649 states and 14258 transitions. Word has length 143
[2025-03-03 15:19:36,888 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:36,888 INFO  L471      AbstractCegarLoop]: Abstraction has 9649 states and 14258 transitions.
[2025-03-03 15:19:36,888 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:36,889 INFO  L276                IsEmpty]: Start isEmpty. Operand 9649 states and 14258 transitions.
[2025-03-03 15:19:36,889 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 144
[2025-03-03 15:19:36,889 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:36,890 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]
[2025-03-03 15:19:36,890 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2025-03-03 15:19:36,890 INFO  L396      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:36,890 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:36,890 INFO  L85        PathProgramCache]: Analyzing trace with hash 187972460, now seen corresponding path program 1 times
[2025-03-03 15:19:36,890 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:36,890 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335225276]
[2025-03-03 15:19:36,890 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:36,890 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:36,906 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes.
[2025-03-03 15:19:36,917 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements.
[2025-03-03 15:19:36,918 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:36,918 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:37,123 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:37,123 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:37,123 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335225276]
[2025-03-03 15:19:37,123 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335225276] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:37,123 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:37,123 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 15:19:37,123 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744138673]
[2025-03-03 15:19:37,123 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:37,124 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 15:19:37,124 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:37,124 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 15:19:37,124 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 15:19:37,124 INFO  L87              Difference]: Start difference. First operand 9649 states and 14258 transitions. Second operand  has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:37,157 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:37,158 INFO  L93              Difference]: Finished difference Result 9687 states and 14313 transitions.
[2025-03-03 15:19:37,158 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 15:19:37,158 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143
[2025-03-03 15:19:37,158 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:37,168 INFO  L225             Difference]: With dead ends: 9687
[2025-03-03 15:19:37,168 INFO  L226             Difference]: Without dead ends: 9685
[2025-03-03 15:19:37,171 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 15:19:37,172 INFO  L435           NwaCegarLoop]: 280 mSDtfsCounter, 0 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:37,172 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1109 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 15:19:37,177 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9685 states.
[2025-03-03 15:19:37,243 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9685 to 9685.
[2025-03-03 15:19:37,251 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9685 states, 9684 states have (on average 1.4720156959933912) internal successors, (14255), 9684 states have internal predecessors, (14255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:37,262 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9685 states to 9685 states and 14255 transitions.
[2025-03-03 15:19:37,263 INFO  L78                 Accepts]: Start accepts. Automaton has 9685 states and 14255 transitions. Word has length 143
[2025-03-03 15:19:37,263 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:37,263 INFO  L471      AbstractCegarLoop]: Abstraction has 9685 states and 14255 transitions.
[2025-03-03 15:19:37,263 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:37,263 INFO  L276                IsEmpty]: Start isEmpty. Operand 9685 states and 14255 transitions.
[2025-03-03 15:19:37,264 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 144
[2025-03-03 15:19:37,264 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:37,264 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]
[2025-03-03 15:19:37,264 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2025-03-03 15:19:37,264 INFO  L396      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:37,265 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:37,265 INFO  L85        PathProgramCache]: Analyzing trace with hash 1683799362, now seen corresponding path program 1 times
[2025-03-03 15:19:37,265 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:37,265 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736274126]
[2025-03-03 15:19:37,265 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:37,265 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:37,280 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes.
[2025-03-03 15:19:37,320 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements.
[2025-03-03 15:19:37,320 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:37,320 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:41,170 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:41,170 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:41,170 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736274126]
[2025-03-03 15:19:41,170 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736274126] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:41,170 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:41,170 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51
[2025-03-03 15:19:41,170 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598522887]
[2025-03-03 15:19:41,170 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:41,171 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 51 states
[2025-03-03 15:19:41,171 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:41,171 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants.
[2025-03-03 15:19:41,172 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2420, Unknown=0, NotChecked=0, Total=2550
[2025-03-03 15:19:41,172 INFO  L87              Difference]: Start difference. First operand 9685 states and 14255 transitions. Second operand  has 51 states, 51 states have (on average 2.803921568627451) internal successors, (143), 51 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:57,754 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:57,755 INFO  L93              Difference]: Finished difference Result 19459 states and 28658 transitions.
[2025-03-03 15:19:57,755 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. 
[2025-03-03 15:19:57,755 INFO  L78                 Accepts]: Start accepts. Automaton has  has 51 states, 51 states have (on average 2.803921568627451) internal successors, (143), 51 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143
[2025-03-03 15:19:57,755 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:57,771 INFO  L225             Difference]: With dead ends: 19459
[2025-03-03 15:19:57,771 INFO  L226             Difference]: Without dead ends: 17763
[2025-03-03 15:19:57,778 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1165, Invalid=8147, Unknown=0, NotChecked=0, Total=9312
[2025-03-03 15:19:57,778 INFO  L435           NwaCegarLoop]: 1030 mSDtfsCounter, 2987 mSDsluCounter, 33306 mSDsCounter, 0 mSdLazyCounter, 21766 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2987 SdHoareTripleChecker+Valid, 34336 SdHoareTripleChecker+Invalid, 21785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 21766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:57,778 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2987 Valid, 34336 Invalid, 21785 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 21766 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time]
[2025-03-03 15:19:57,786 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17763 states.
[2025-03-03 15:19:57,880 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17763 to 9711.
[2025-03-03 15:19:57,887 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9711 states, 9710 states have (on average 1.4714727085478887) internal successors, (14288), 9710 states have internal predecessors, (14288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:57,897 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9711 states to 9711 states and 14288 transitions.
[2025-03-03 15:19:57,897 INFO  L78                 Accepts]: Start accepts. Automaton has 9711 states and 14288 transitions. Word has length 143
[2025-03-03 15:19:57,897 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:57,897 INFO  L471      AbstractCegarLoop]: Abstraction has 9711 states and 14288 transitions.
[2025-03-03 15:19:57,897 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 51 states, 51 states have (on average 2.803921568627451) internal successors, (143), 51 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:57,897 INFO  L276                IsEmpty]: Start isEmpty. Operand 9711 states and 14288 transitions.
[2025-03-03 15:19:57,898 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 144
[2025-03-03 15:19:57,898 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:57,898 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]
[2025-03-03 15:19:57,898 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2025-03-03 15:19:57,898 INFO  L396      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:57,898 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:57,898 INFO  L85        PathProgramCache]: Analyzing trace with hash 1512921690, now seen corresponding path program 1 times
[2025-03-03 15:19:57,899 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:57,899 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977302283]
[2025-03-03 15:19:57,899 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:57,899 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:57,910 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes.
[2025-03-03 15:19:57,929 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements.
[2025-03-03 15:19:57,929 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:57,929 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:58,292 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:58,292 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:58,292 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977302283]
[2025-03-03 15:19:58,292 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977302283] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:58,292 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:58,292 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-03-03 15:19:58,293 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327864184]
[2025-03-03 15:19:58,293 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:58,293 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-03-03 15:19:58,293 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:58,293 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-03-03 15:19:58,293 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2025-03-03 15:19:58,294 INFO  L87              Difference]: Start difference. First operand 9711 states and 14288 transitions. Second operand  has 13 states, 13 states have (on average 11.0) internal successors, (143), 13 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:58,731 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:58,731 INFO  L93              Difference]: Finished difference Result 21242 states and 31357 transitions.
[2025-03-03 15:19:58,732 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-03 15:19:58,732 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 11.0) internal successors, (143), 13 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143
[2025-03-03 15:19:58,732 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:58,750 INFO  L225             Difference]: With dead ends: 21242
[2025-03-03 15:19:58,750 INFO  L226             Difference]: Without dead ends: 19216
[2025-03-03 15:19:58,757 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600
[2025-03-03 15:19:58,758 INFO  L435           NwaCegarLoop]: 378 mSDtfsCounter, 1243 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 2163 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:58,758 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 2163 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 15:19:58,767 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19216 states.
[2025-03-03 15:19:58,865 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19216 to 9665.
[2025-03-03 15:19:58,873 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9665 states, 9664 states have (on average 1.4725786423841059) internal successors, (14231), 9664 states have internal predecessors, (14231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:58,883 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9665 states to 9665 states and 14231 transitions.
[2025-03-03 15:19:58,884 INFO  L78                 Accepts]: Start accepts. Automaton has 9665 states and 14231 transitions. Word has length 143
[2025-03-03 15:19:58,884 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:58,884 INFO  L471      AbstractCegarLoop]: Abstraction has 9665 states and 14231 transitions.
[2025-03-03 15:19:58,884 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 11.0) internal successors, (143), 13 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:58,884 INFO  L276                IsEmpty]: Start isEmpty. Operand 9665 states and 14231 transitions.
[2025-03-03 15:19:58,884 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 144
[2025-03-03 15:19:58,884 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:58,884 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]
[2025-03-03 15:19:58,884 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2025-03-03 15:19:58,885 INFO  L396      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:58,885 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:58,885 INFO  L85        PathProgramCache]: Analyzing trace with hash -65369337, now seen corresponding path program 1 times
[2025-03-03 15:19:58,885 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:58,885 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482294059]
[2025-03-03 15:19:58,885 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:58,885 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:58,902 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes.
[2025-03-03 15:19:58,920 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements.
[2025-03-03 15:19:58,921 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:58,921 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:59,248 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:59,248 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:59,248 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482294059]
[2025-03-03 15:19:59,248 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482294059] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:59,248 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:59,248 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-03-03 15:19:59,248 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047000785]
[2025-03-03 15:19:59,248 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:59,248 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-03-03 15:19:59,248 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:59,249 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-03-03 15:19:59,249 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2025-03-03 15:19:59,249 INFO  L87              Difference]: Start difference. First operand 9665 states and 14231 transitions. Second operand  has 12 states, 12 states have (on average 11.916666666666666) internal successors, (143), 12 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:59,593 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:19:59,594 INFO  L93              Difference]: Finished difference Result 20482 states and 30256 transitions.
[2025-03-03 15:19:59,594 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-03-03 15:19:59,594 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 11.916666666666666) internal successors, (143), 12 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143
[2025-03-03 15:19:59,595 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:19:59,612 INFO  L225             Difference]: With dead ends: 20482
[2025-03-03 15:19:59,612 INFO  L226             Difference]: Without dead ends: 18750
[2025-03-03 15:19:59,619 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462
[2025-03-03 15:19:59,620 INFO  L435           NwaCegarLoop]: 367 mSDtfsCounter, 850 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 2380 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 15:19:59,620 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 2380 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 15:19:59,630 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18750 states.
[2025-03-03 15:19:59,727 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18750 to 9464.
[2025-03-03 15:19:59,734 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9464 states, 9463 states have (on average 1.473634154073761) internal successors, (13945), 9463 states have internal predecessors, (13945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:59,743 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9464 states to 9464 states and 13945 transitions.
[2025-03-03 15:19:59,743 INFO  L78                 Accepts]: Start accepts. Automaton has 9464 states and 13945 transitions. Word has length 143
[2025-03-03 15:19:59,744 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:19:59,744 INFO  L471      AbstractCegarLoop]: Abstraction has 9464 states and 13945 transitions.
[2025-03-03 15:19:59,744 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 11.916666666666666) internal successors, (143), 12 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:19:59,744 INFO  L276                IsEmpty]: Start isEmpty. Operand 9464 states and 13945 transitions.
[2025-03-03 15:19:59,746 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 184
[2025-03-03 15:19:59,746 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:19:59,746 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 15:19:59,746 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2025-03-03 15:19:59,746 INFO  L396      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:19:59,747 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:19:59,747 INFO  L85        PathProgramCache]: Analyzing trace with hash -75459391, now seen corresponding path program 1 times
[2025-03-03 15:19:59,747 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:19:59,747 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134728790]
[2025-03-03 15:19:59,747 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:19:59,747 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:19:59,759 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes.
[2025-03-03 15:19:59,770 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements.
[2025-03-03 15:19:59,770 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:19:59,770 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:19:59,852 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:19:59,852 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:19:59,853 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134728790]
[2025-03-03 15:19:59,855 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134728790] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:19:59,855 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:19:59,855 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 15:19:59,855 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675417387]
[2025-03-03 15:19:59,855 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:19:59,855 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 15:19:59,855 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:19:59,856 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 15:19:59,856 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-03 15:19:59,856 INFO  L87              Difference]: Start difference. First operand 9464 states and 13945 transitions. Second operand  has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:20:00,170 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:20:00,171 INFO  L93              Difference]: Finished difference Result 32564 states and 48359 transitions.
[2025-03-03 15:20:00,171 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-03 15:20:00,171 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 183
[2025-03-03 15:20:00,171 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:20:00,194 INFO  L225             Difference]: With dead ends: 32564
[2025-03-03 15:20:00,194 INFO  L226             Difference]: Without dead ends: 23278
[2025-03-03 15:20:00,205 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156
[2025-03-03 15:20:00,205 INFO  L435           NwaCegarLoop]: 211 mSDtfsCounter, 1232 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 15:20:00,205 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1232 Valid, 720 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 15:20:00,215 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23278 states.
[2025-03-03 15:20:00,364 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23278 to 13784.
[2025-03-03 15:20:00,373 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13784 states, 13783 states have (on average 1.4748603351955307) internal successors, (20328), 13783 states have internal predecessors, (20328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:20:00,390 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13784 states to 13784 states and 20328 transitions.
[2025-03-03 15:20:00,390 INFO  L78                 Accepts]: Start accepts. Automaton has 13784 states and 20328 transitions. Word has length 183
[2025-03-03 15:20:00,390 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:20:00,390 INFO  L471      AbstractCegarLoop]: Abstraction has 13784 states and 20328 transitions.
[2025-03-03 15:20:00,390 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:20:00,390 INFO  L276                IsEmpty]: Start isEmpty. Operand 13784 states and 20328 transitions.
[2025-03-03 15:20:00,392 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 184
[2025-03-03 15:20:00,393 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:20:00,393 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 15:20:00,393 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2025-03-03 15:20:00,393 INFO  L396      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:20:00,393 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:20:00,393 INFO  L85        PathProgramCache]: Analyzing trace with hash -1849441279, now seen corresponding path program 1 times
[2025-03-03 15:20:00,393 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:20:00,394 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606695618]
[2025-03-03 15:20:00,394 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:20:00,394 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:20:00,408 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes.
[2025-03-03 15:20:00,419 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements.
[2025-03-03 15:20:00,419 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:20:00,419 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:20:00,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:20:00,504 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:20:00,504 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606695618]
[2025-03-03 15:20:00,504 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606695618] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:20:00,504 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:20:00,504 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 15:20:00,504 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562098314]
[2025-03-03 15:20:00,504 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:20:00,504 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 15:20:00,504 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:20:00,505 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 15:20:00,505 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-03 15:20:00,505 INFO  L87              Difference]: Start difference. First operand 13784 states and 20328 transitions. Second operand  has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:20:00,794 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:20:00,795 INFO  L93              Difference]: Finished difference Result 58664 states and 87120 transitions.
[2025-03-03 15:20:00,795 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-03 15:20:00,795 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 183
[2025-03-03 15:20:00,795 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:20:00,843 INFO  L225             Difference]: With dead ends: 58664
[2025-03-03 15:20:00,843 INFO  L226             Difference]: Without dead ends: 45104
[2025-03-03 15:20:00,866 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156
[2025-03-03 15:20:00,867 INFO  L435           NwaCegarLoop]: 162 mSDtfsCounter, 1643 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 15:20:00,867 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1643 Valid, 569 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 15:20:00,888 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 45104 states.
[2025-03-03 15:20:01,174 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 45104 to 28822.
[2025-03-03 15:20:01,198 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28822 states, 28821 states have (on average 1.4737517782172722) internal successors, (42475), 28821 states have internal predecessors, (42475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:20:01,231 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28822 states to 28822 states and 42475 transitions.
[2025-03-03 15:20:01,232 INFO  L78                 Accepts]: Start accepts. Automaton has 28822 states and 42475 transitions. Word has length 183
[2025-03-03 15:20:01,232 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:20:01,232 INFO  L471      AbstractCegarLoop]: Abstraction has 28822 states and 42475 transitions.
[2025-03-03 15:20:01,232 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:20:01,232 INFO  L276                IsEmpty]: Start isEmpty. Operand 28822 states and 42475 transitions.
[2025-03-03 15:20:01,235 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 184
[2025-03-03 15:20:01,235 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:20:01,235 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 15:20:01,235 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2025-03-03 15:20:01,235 INFO  L396      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:20:01,235 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:20:01,236 INFO  L85        PathProgramCache]: Analyzing trace with hash -41905343, now seen corresponding path program 1 times
[2025-03-03 15:20:01,236 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:20:01,236 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304854902]
[2025-03-03 15:20:01,236 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:20:01,236 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:20:01,250 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes.
[2025-03-03 15:20:01,261 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements.
[2025-03-03 15:20:01,262 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:20:01,262 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:20:01,344 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:20:01,345 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:20:01,345 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304854902]
[2025-03-03 15:20:01,345 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304854902] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:20:01,345 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:20:01,345 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 15:20:01,345 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631684178]
[2025-03-03 15:20:01,345 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:20:01,345 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 15:20:01,345 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:20:01,345 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 15:20:01,346 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-03 15:20:01,346 INFO  L87              Difference]: Start difference. First operand 28822 states and 42475 transitions. Second operand  has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:20:01,721 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:20:01,721 INFO  L93              Difference]: Finished difference Result 115618 states and 171321 transitions.
[2025-03-03 15:20:01,722 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-03 15:20:01,722 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 183
[2025-03-03 15:20:01,722 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:20:01,958 INFO  L225             Difference]: With dead ends: 115618
[2025-03-03 15:20:01,958 INFO  L226             Difference]: Without dead ends: 87020
[2025-03-03 15:20:01,982 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156
[2025-03-03 15:20:01,983 INFO  L435           NwaCegarLoop]: 162 mSDtfsCounter, 1558 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 15:20:01,983 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 567 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 15:20:02,022 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 87020 states.
[2025-03-03 15:20:02,759 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 87020 to 60378.
[2025-03-03 15:20:02,815 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60378 states, 60377 states have (on average 1.4714377991619325) internal successors, (88841), 60377 states have internal predecessors, (88841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:20:02,906 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60378 states to 60378 states and 88841 transitions.
[2025-03-03 15:20:02,906 INFO  L78                 Accepts]: Start accepts. Automaton has 60378 states and 88841 transitions. Word has length 183
[2025-03-03 15:20:02,906 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:20:02,906 INFO  L471      AbstractCegarLoop]: Abstraction has 60378 states and 88841 transitions.
[2025-03-03 15:20:02,906 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:20:02,906 INFO  L276                IsEmpty]: Start isEmpty. Operand 60378 states and 88841 transitions.
[2025-03-03 15:20:02,911 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 184
[2025-03-03 15:20:02,911 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:20:02,912 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 15:20:02,912 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2025-03-03 15:20:02,912 INFO  L396      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:20:02,912 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:20:02,912 INFO  L85        PathProgramCache]: Analyzing trace with hash -328804863, now seen corresponding path program 1 times
[2025-03-03 15:20:02,912 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:20:02,913 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579586112]
[2025-03-03 15:20:02,913 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:20:02,913 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:20:02,927 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes.
[2025-03-03 15:20:02,938 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements.
[2025-03-03 15:20:02,938 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:20:02,939 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:20:03,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:20:03,020 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:20:03,020 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579586112]
[2025-03-03 15:20:03,020 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579586112] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:20:03,020 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:20:03,020 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 15:20:03,020 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459205742]
[2025-03-03 15:20:03,020 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:20:03,021 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 15:20:03,021 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:20:03,021 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 15:20:03,021 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-03 15:20:03,021 INFO  L87              Difference]: Start difference. First operand 60378 states and 88841 transitions. Second operand  has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:20:03,767 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:20:03,767 INFO  L93              Difference]: Finished difference Result 228046 states and 337059 transitions.
[2025-03-03 15:20:03,768 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-03 15:20:03,768 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 183
[2025-03-03 15:20:03,768 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:20:03,976 INFO  L225             Difference]: With dead ends: 228046
[2025-03-03 15:20:03,976 INFO  L226             Difference]: Without dead ends: 167892
[2025-03-03 15:20:04,063 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156
[2025-03-03 15:20:04,063 INFO  L435           NwaCegarLoop]: 162 mSDtfsCounter, 1473 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 15:20:04,063 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 565 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 15:20:04,168 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 167892 states.
[2025-03-03 15:20:05,474 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 167892 to 126450.
[2025-03-03 15:20:05,589 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 126450 states, 126449 states have (on average 1.468710705501823) internal successors, (185717), 126449 states have internal predecessors, (185717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:20:05,778 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 126450 states to 126450 states and 185717 transitions.
[2025-03-03 15:20:05,778 INFO  L78                 Accepts]: Start accepts. Automaton has 126450 states and 185717 transitions. Word has length 183
[2025-03-03 15:20:05,778 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:20:05,778 INFO  L471      AbstractCegarLoop]: Abstraction has 126450 states and 185717 transitions.
[2025-03-03 15:20:05,778 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:20:05,778 INFO  L276                IsEmpty]: Start isEmpty. Operand 126450 states and 185717 transitions.
[2025-03-03 15:20:05,785 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 184
[2025-03-03 15:20:05,785 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:20:05,785 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 15:20:05,785 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2025-03-03 15:20:05,785 INFO  L396      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:20:05,785 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:20:05,785 INFO  L85        PathProgramCache]: Analyzing trace with hash 646836897, now seen corresponding path program 1 times
[2025-03-03 15:20:05,785 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:20:05,785 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951386739]
[2025-03-03 15:20:05,785 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:20:05,785 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:20:05,798 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes.
[2025-03-03 15:20:05,808 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements.
[2025-03-03 15:20:05,808 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:20:05,809 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:20:05,890 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 15:20:05,890 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:20:05,890 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951386739]
[2025-03-03 15:20:05,890 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951386739] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:20:05,890 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:20:05,890 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 15:20:05,890 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851437723]
[2025-03-03 15:20:05,890 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:20:05,890 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 15:20:05,890 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:20:05,891 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 15:20:05,891 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-03 15:20:05,891 INFO  L87              Difference]: Start difference. First operand 126450 states and 185717 transitions. Second operand  has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 15:20:07,654 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:20:07,654 INFO  L93              Difference]: Finished difference Result 426262 states and 627687 transitions.
[2025-03-03 15:20:07,655 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-03 15:20:07,655 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 183
[2025-03-03 15:20:07,655 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:20:08,268 INFO  L225             Difference]: With dead ends: 426262
[2025-03-03 15:20:08,268 INFO  L226             Difference]: Without dead ends: 300036
[2025-03-03 15:20:08,331 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156
[2025-03-03 15:20:08,331 INFO  L435           NwaCegarLoop]: 162 mSDtfsCounter, 1303 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1303 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 15:20:08,331 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1303 Valid, 561 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 15:20:08,467 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 300036 states.