./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.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_floodmax.3.4.ufo.BOUNDED-6.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 d4091e99c6c703f11d6d31e8eaec6c84e6dd277464e5b390742bbd7adf0ea708
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 15:01:25,058 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 15:01:25,107 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 15:01:25,111 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 15:01:25,114 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 15:01:25,136 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 15:01:25,137 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 15:01:25,138 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 15:01:25,138 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 15:01:25,138 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 15:01:25,139 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 15:01:25,139 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 15:01:25,139 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 15:01:25,139 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 15:01:25,139 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 15:01:25,140 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 15:01:25,140 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 15:01:25,140 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 15:01:25,140 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 15:01:25,140 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 15:01:25,140 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 15:01:25,140 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 15:01:25,140 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 15:01:25,141 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 15:01:25,141 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 15:01:25,141 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 15:01:25,141 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 15:01:25,141 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 15:01:25,141 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 15:01:25,141 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 15:01:25,141 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 15:01:25,141 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 15:01:25,141 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 15:01:25,141 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 15:01:25,142 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 15:01:25,142 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 15:01:25,142 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 15:01:25,142 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 15:01:25,142 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 15:01:25,142 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 15:01:25,142 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 15:01:25,142 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 15:01:25,143 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 15:01:25,143 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 -> d4091e99c6c703f11d6d31e8eaec6c84e6dd277464e5b390742bbd7adf0ea708
[2025-03-03 15:01:25,356 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 15:01:25,362 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 15:01:25,366 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 15:01:25,368 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 15:01:25,368 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 15:01:25,369 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c
[2025-03-03 15:01:26,510 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47c6f0321/6c81c6b51f574717a74e66d7808421c0/FLAG8eb7f3818
[2025-03-03 15:01:26,739 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 15:01:26,740 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c
[2025-03-03 15:01:26,751 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47c6f0321/6c81c6b51f574717a74e66d7808421c0/FLAG8eb7f3818
[2025-03-03 15:01:27,059 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47c6f0321/6c81c6b51f574717a74e66d7808421c0
[2025-03-03 15:01:27,061 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 15:01:27,063 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 15:01:27,064 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 15:01:27,064 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 15:01:27,067 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 15:01:27,068 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:01:27" (1/1) ...
[2025-03-03 15:01:27,068 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5f9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:27, skipping insertion in model container
[2025-03-03 15:01:27,069 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:01:27" (1/1) ...
[2025-03-03 15:01:27,105 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 15:01:27,369 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_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[14145,14158]
[2025-03-03 15:01:27,419 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 15:01:27,430 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 15:01:27,485 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_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[14145,14158]
[2025-03-03 15:01:27,518 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 15:01:27,531 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 15:01:27,532 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:27 WrapperNode
[2025-03-03 15:01:27,532 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 15:01:27,532 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 15:01:27,533 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 15:01:27,533 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 15:01:27,537 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:01:27" (1/1) ...
[2025-03-03 15:01:27,547 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:01:27" (1/1) ...
[2025-03-03 15:01:27,587 INFO  L138                Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1222
[2025-03-03 15:01:27,588 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 15:01:27,588 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 15:01:27,588 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 15:01:27,588 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 15:01:27,595 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:27" (1/1) ...
[2025-03-03 15:01:27,595 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:27" (1/1) ...
[2025-03-03 15:01:27,599 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:27" (1/1) ...
[2025-03-03 15:01:27,616 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:01:27,616 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:27" (1/1) ...
[2025-03-03 15:01:27,616 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:27" (1/1) ...
[2025-03-03 15:01:27,626 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:27" (1/1) ...
[2025-03-03 15:01:27,628 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:27" (1/1) ...
[2025-03-03 15:01:27,629 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:27" (1/1) ...
[2025-03-03 15:01:27,631 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:27" (1/1) ...
[2025-03-03 15:01:27,636 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 15:01:27,637 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 15:01:27,637 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 15:01:27,637 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 15:01:27,637 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:27" (1/1) ...
[2025-03-03 15:01:27,641 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 15:01:27,655 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 15:01:27,669 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:01:27,672 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:01:27,691 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 15:01:27,691 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 15:01:27,691 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 15:01:27,691 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 15:01:27,793 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 15:01:27,795 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 15:01:28,598 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L1083: havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1;
[2025-03-03 15:01:28,598 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L1184: havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1;
[2025-03-03 15:01:28,598 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L822: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1;
[2025-03-03 15:01:28,598 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L1285: havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1;
[2025-03-03 15:01:28,599 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L923: havoc main_~check__tmp~4#1;
[2025-03-03 15:01:28,647 INFO  L?                        ?]: Removed 82 outVars from TransFormulas that were not future-live.
[2025-03-03 15:01:28,648 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 15:01:28,668 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 15:01:28,668 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 15:01:28,668 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:01:28 BoogieIcfgContainer
[2025-03-03 15:01:28,668 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 15:01:28,670 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 15:01:28,670 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 15:01:28,675 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 15:01:28,675 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:01:27" (1/3) ...
[2025-03-03 15:01:28,676 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba2ef84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:01:28, skipping insertion in model container
[2025-03-03 15:01:28,676 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:01:27" (2/3) ...
[2025-03-03 15:01:28,677 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba2ef84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:01:28, skipping insertion in model container
[2025-03-03 15:01:28,677 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:01:28" (3/3) ...
[2025-03-03 15:01:28,678 INFO  L128   eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c
[2025-03-03 15:01:28,688 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 15:01:28,691 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c that has 1 procedures, 294 locations, 1 initial locations, 0 loop locations, and 1 error locations.
[2025-03-03 15:01:28,745 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 15:01:28,755 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;@98f102e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 15:01:28,756 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 15:01:28,761 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 294 states, 292 states have (on average 1.7945205479452055) internal successors, (524), 293 states have internal predecessors, (524), 0 states have call successors, (0), 0 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:01:28,770 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 142
[2025-03-03 15:01:28,771 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:01:28,771 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:01:28,772 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:01:28,776 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:01:28,777 INFO  L85        PathProgramCache]: Analyzing trace with hash -2105733186, now seen corresponding path program 1 times
[2025-03-03 15:01:28,783 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:01:28,783 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046726448]
[2025-03-03 15:01:28,786 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:01:28,786 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:01:28,875 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes.
[2025-03-03 15:01:29,093 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements.
[2025-03-03 15:01:29,094 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:01:29,094 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:01:29,640 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:01:29,641 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:01:29,641 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046726448]
[2025-03-03 15:01:29,642 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046726448] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:01:29,642 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:01:29,642 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 15:01:29,644 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636856695]
[2025-03-03 15:01:29,644 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:01:29,647 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 15:01:29,647 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:01:29,663 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 15:01:29,663 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 15:01:29,666 INFO  L87              Difference]: Start difference. First operand  has 294 states, 292 states have (on average 1.7945205479452055) internal successors, (524), 293 states have internal predecessors, (524), 0 states have call successors, (0), 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 4 states, 4 states have (on average 35.25) internal successors, (141), 4 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:01:29,846 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:01:29,847 INFO  L93              Difference]: Finished difference Result 1411 states and 2527 transitions.
[2025-03-03 15:01:29,848 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 15:01:29,849 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 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:01:29,849 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:01:29,864 INFO  L225             Difference]: With dead ends: 1411
[2025-03-03 15:01:29,867 INFO  L226             Difference]: Without dead ends: 1118
[2025-03-03 15:01:29,876 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:01:29,878 INFO  L435           NwaCegarLoop]: 894 mSDtfsCounter, 1526 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 2352 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 15:01:29,878 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 2352 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 15:01:29,890 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1118 states.
[2025-03-03 15:01:29,931 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 563.
[2025-03-03 15:01:29,933 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 563 states, 562 states have (on average 1.4519572953736655) internal successors, (816), 562 states have internal predecessors, (816), 0 states have call successors, (0), 0 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:01:29,937 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 816 transitions.
[2025-03-03 15:01:29,939 INFO  L78                 Accepts]: Start accepts. Automaton has 563 states and 816 transitions. Word has length 141
[2025-03-03 15:01:29,940 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:01:29,940 INFO  L471      AbstractCegarLoop]: Abstraction has 563 states and 816 transitions.
[2025-03-03 15:01:29,941 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 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:01:29,941 INFO  L276                IsEmpty]: Start isEmpty. Operand 563 states and 816 transitions.
[2025-03-03 15:01:29,943 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2025-03-03 15:01:29,943 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:01:29,943 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:01:29,943 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 15:01:29,943 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:01:29,944 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:01:29,944 INFO  L85        PathProgramCache]: Analyzing trace with hash -436422882, now seen corresponding path program 1 times
[2025-03-03 15:01:29,944 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:01:29,944 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013954994]
[2025-03-03 15:01:29,944 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:01:29,944 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:01:29,968 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes.
[2025-03-03 15:01:29,980 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements.
[2025-03-03 15:01:29,980 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:01:29,980 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:01:30,075 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:01:30,076 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:01:30,076 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013954994]
[2025-03-03 15:01:30,076 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013954994] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:01:30,076 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:01:30,076 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 15:01:30,076 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313402055]
[2025-03-03 15:01:30,076 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:01:30,077 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 15:01:30,077 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:01:30,077 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 15:01:30,077 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 15:01:30,078 INFO  L87              Difference]: Start difference. First operand 563 states and 816 transitions. Second operand  has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 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:01:30,097 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:01:30,098 INFO  L93              Difference]: Finished difference Result 1100 states and 1589 transitions.
[2025-03-03 15:01:30,098 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 15:01:30,099 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 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:01:30,099 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:01:30,101 INFO  L225             Difference]: With dead ends: 1100
[2025-03-03 15:01:30,102 INFO  L226             Difference]: Without dead ends: 565
[2025-03-03 15:01:30,103 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:01:30,105 INFO  L435           NwaCegarLoop]: 427 mSDtfsCounter, 0 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 15:01:30,105 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 848 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 15:01:30,106 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 565 states.
[2025-03-03 15:01:30,124 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565.
[2025-03-03 15:01:30,125 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 565 states, 564 states have (on average 1.450354609929078) internal successors, (818), 564 states have internal predecessors, (818), 0 states have call successors, (0), 0 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:01:30,127 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 818 transitions.
[2025-03-03 15:01:30,130 INFO  L78                 Accepts]: Start accepts. Automaton has 565 states and 818 transitions. Word has length 142
[2025-03-03 15:01:30,130 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:01:30,130 INFO  L471      AbstractCegarLoop]: Abstraction has 565 states and 818 transitions.
[2025-03-03 15:01:30,130 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 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:01:30,130 INFO  L276                IsEmpty]: Start isEmpty. Operand 565 states and 818 transitions.
[2025-03-03 15:01:30,132 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 144
[2025-03-03 15:01:30,132 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:01:30,132 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:01:30,132 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 15:01:30,132 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:01:30,133 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:01:30,133 INFO  L85        PathProgramCache]: Analyzing trace with hash -777873818, now seen corresponding path program 1 times
[2025-03-03 15:01:30,133 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:01:30,133 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874854760]
[2025-03-03 15:01:30,133 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:01:30,133 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:01:30,165 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes.
[2025-03-03 15:01:30,222 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements.
[2025-03-03 15:01:30,222 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:01:30,222 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:01:30,609 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:01:30,609 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:01:30,610 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874854760]
[2025-03-03 15:01:30,610 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874854760] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:01:30,610 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:01:30,610 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 15:01:30,610 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514770225]
[2025-03-03 15:01:30,610 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:01:30,610 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 15:01:30,610 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:01:30,611 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 15:01:30,611 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 15:01:30,611 INFO  L87              Difference]: Start difference. First operand 565 states and 818 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:01:30,634 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:01:30,635 INFO  L93              Difference]: Finished difference Result 1116 states and 1615 transitions.
[2025-03-03 15:01:30,635 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 15:01:30,638 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:01:30,639 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:01:30,641 INFO  L225             Difference]: With dead ends: 1116
[2025-03-03 15:01:30,641 INFO  L226             Difference]: Without dead ends: 565
[2025-03-03 15:01:30,642 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 15:01:30,642 INFO  L435           NwaCegarLoop]: 463 mSDtfsCounter, 20 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 15:01:30,642 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1343 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 15:01:30,643 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 565 states.
[2025-03-03 15:01:30,653 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 564.
[2025-03-03 15:01:30,654 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 564 states, 563 states have (on average 1.447602131438721) internal successors, (815), 563 states have internal predecessors, (815), 0 states have call successors, (0), 0 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:01:30,656 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 815 transitions.
[2025-03-03 15:01:30,656 INFO  L78                 Accepts]: Start accepts. Automaton has 564 states and 815 transitions. Word has length 143
[2025-03-03 15:01:30,656 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:01:30,656 INFO  L471      AbstractCegarLoop]: Abstraction has 564 states and 815 transitions.
[2025-03-03 15:01:30,656 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:01:30,657 INFO  L276                IsEmpty]: Start isEmpty. Operand 564 states and 815 transitions.
[2025-03-03 15:01:30,659 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 144
[2025-03-03 15:01:30,659 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:01:30,660 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:01:30,660 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 15:01:30,660 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:01:30,661 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:01:30,662 INFO  L85        PathProgramCache]: Analyzing trace with hash -236291295, now seen corresponding path program 1 times
[2025-03-03 15:01:30,662 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:01:30,662 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159683680]
[2025-03-03 15:01:30,662 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:01:30,662 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:01:30,684 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes.
[2025-03-03 15:01:30,694 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements.
[2025-03-03 15:01:30,695 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:01:30,695 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:01:30,774 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:01:30,776 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:01:30,776 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159683680]
[2025-03-03 15:01:30,776 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159683680] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:01:30,776 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:01:30,776 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 15:01:30,776 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925421902]
[2025-03-03 15:01:30,776 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:01:30,777 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 15:01:30,777 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:01:30,777 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 15:01:30,778 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 15:01:30,779 INFO  L87              Difference]: Start difference. First operand 564 states and 815 transitions. Second operand  has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 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:01:30,821 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:01:30,822 INFO  L93              Difference]: Finished difference Result 1476 states and 2146 transitions.
[2025-03-03 15:01:30,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 15:01:30,823 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 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:01:30,823 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:01:30,826 INFO  L225             Difference]: With dead ends: 1476
[2025-03-03 15:01:30,827 INFO  L226             Difference]: Without dead ends: 1089
[2025-03-03 15:01:30,827 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:01:30,828 INFO  L435           NwaCegarLoop]: 763 mSDtfsCounter, 352 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 15:01:30,829 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1147 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 15:01:30,830 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1089 states.
[2025-03-03 15:01:30,849 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1087.
[2025-03-03 15:01:30,851 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1087 states, 1086 states have (on average 1.432780847145488) internal successors, (1556), 1086 states have internal predecessors, (1556), 0 states have call successors, (0), 0 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:01:30,854 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1556 transitions.
[2025-03-03 15:01:30,855 INFO  L78                 Accepts]: Start accepts. Automaton has 1087 states and 1556 transitions. Word has length 143
[2025-03-03 15:01:30,856 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:01:30,856 INFO  L471      AbstractCegarLoop]: Abstraction has 1087 states and 1556 transitions.
[2025-03-03 15:01:30,856 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 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:01:30,856 INFO  L276                IsEmpty]: Start isEmpty. Operand 1087 states and 1556 transitions.
[2025-03-03 15:01:30,858 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 144
[2025-03-03 15:01:30,858 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:01:30,858 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:01:30,858 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 15:01:30,858 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:01:30,858 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:01:30,858 INFO  L85        PathProgramCache]: Analyzing trace with hash -2024161117, now seen corresponding path program 1 times
[2025-03-03 15:01:30,858 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:01:30,859 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518497568]
[2025-03-03 15:01:30,859 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:01:30,859 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:01:30,875 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes.
[2025-03-03 15:01:30,935 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements.
[2025-03-03 15:01:30,935 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:01:30,935 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:01:31,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:01:31,195 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:01:31,195 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518497568]
[2025-03-03 15:01:31,195 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518497568] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:01:31,195 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:01:31,195 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 15:01:31,195 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985692748]
[2025-03-03 15:01:31,195 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:01:31,196 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 15:01:31,196 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:01:31,196 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 15:01:31,196 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 15:01:31,197 INFO  L87              Difference]: Start difference. First operand 1087 states and 1556 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:01:31,259 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:01:31,260 INFO  L93              Difference]: Finished difference Result 2576 states and 3680 transitions.
[2025-03-03 15:01:31,260 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 15:01:31,260 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:01:31,260 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:01:31,265 INFO  L225             Difference]: With dead ends: 2576
[2025-03-03 15:01:31,265 INFO  L226             Difference]: Without dead ends: 1518
[2025-03-03 15:01:31,267 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 15:01:31,268 INFO  L435           NwaCegarLoop]: 424 mSDtfsCounter, 370 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 15:01:31,269 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1214 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 15:01:31,270 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1518 states.
[2025-03-03 15:01:31,295 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1516.
[2025-03-03 15:01:31,297 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1516 states, 1515 states have (on average 1.4158415841584158) internal successors, (2145), 1515 states have internal predecessors, (2145), 0 states have call successors, (0), 0 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:01:31,301 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 2145 transitions.
[2025-03-03 15:01:31,302 INFO  L78                 Accepts]: Start accepts. Automaton has 1516 states and 2145 transitions. Word has length 143
[2025-03-03 15:01:31,302 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:01:31,302 INFO  L471      AbstractCegarLoop]: Abstraction has 1516 states and 2145 transitions.
[2025-03-03 15:01:31,302 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:01:31,302 INFO  L276                IsEmpty]: Start isEmpty. Operand 1516 states and 2145 transitions.
[2025-03-03 15:01:31,304 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 149
[2025-03-03 15:01:31,308 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:01:31,308 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 15:01:31,308 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 15:01:31,308 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:01:31,309 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:01:31,309 INFO  L85        PathProgramCache]: Analyzing trace with hash 1343746194, now seen corresponding path program 1 times
[2025-03-03 15:01:31,309 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:01:31,309 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78330626]
[2025-03-03 15:01:31,309 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:01:31,309 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:01:31,343 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes.
[2025-03-03 15:01:31,371 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements.
[2025-03-03 15:01:31,371 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:01:31,371 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:01:31,798 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:01:31,799 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:01:31,800 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78330626]
[2025-03-03 15:01:31,800 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78330626] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:01:31,800 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:01:31,800 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 15:01:31,800 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301864127]
[2025-03-03 15:01:31,800 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:01:31,800 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-03 15:01:31,801 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:01:31,801 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-03 15:01:31,801 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2025-03-03 15:01:31,801 INFO  L87              Difference]: Start difference. First operand 1516 states and 2145 transitions. Second operand  has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 8 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:01:32,432 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:01:32,432 INFO  L93              Difference]: Finished difference Result 5327 states and 7995 transitions.
[2025-03-03 15:01:32,433 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-03-03 15:01:32,433 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 8 states have internal predecessors, (148), 0 states have call successors, (0), 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 148
[2025-03-03 15:01:32,433 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:01:32,446 INFO  L225             Difference]: With dead ends: 5327
[2025-03-03 15:01:32,447 INFO  L226             Difference]: Without dead ends: 4183
[2025-03-03 15:01:32,449 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342
[2025-03-03 15:01:32,449 INFO  L435           NwaCegarLoop]: 325 mSDtfsCounter, 3983 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3983 SdHoareTripleChecker+Valid, 1891 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 15:01:32,450 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3983 Valid, 1891 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 15:01:32,453 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4183 states.
[2025-03-03 15:01:32,524 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4183 to 3151.
[2025-03-03 15:01:32,527 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3151 states, 3150 states have (on average 1.466031746031746) internal successors, (4618), 3150 states have internal predecessors, (4618), 0 states have call successors, (0), 0 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:01:32,537 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3151 states to 3151 states and 4618 transitions.
[2025-03-03 15:01:32,538 INFO  L78                 Accepts]: Start accepts. Automaton has 3151 states and 4618 transitions. Word has length 148
[2025-03-03 15:01:32,538 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:01:32,538 INFO  L471      AbstractCegarLoop]: Abstraction has 3151 states and 4618 transitions.
[2025-03-03 15:01:32,538 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 8 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:01:32,539 INFO  L276                IsEmpty]: Start isEmpty. Operand 3151 states and 4618 transitions.
[2025-03-03 15:01:32,542 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 149
[2025-03-03 15:01:32,542 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:01:32,542 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 15:01:32,542 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 15:01:32,542 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:01:32,543 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:01:32,543 INFO  L85        PathProgramCache]: Analyzing trace with hash 950719184, now seen corresponding path program 1 times
[2025-03-03 15:01:32,543 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:01:32,543 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398548187]
[2025-03-03 15:01:32,543 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:01:32,543 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:01:32,561 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes.
[2025-03-03 15:01:32,586 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements.
[2025-03-03 15:01:32,587 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:01:32,587 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:01:32,816 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:01:32,816 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:01:32,816 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398548187]
[2025-03-03 15:01:32,817 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398548187] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:01:32,817 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:01:32,817 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 15:01:32,817 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554175768]
[2025-03-03 15:01:32,817 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:01:32,817 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 15:01:32,817 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:01:32,818 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 15:01:32,818 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 15:01:32,818 INFO  L87              Difference]: Start difference. First operand 3151 states and 4618 transitions. Second operand  has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:01:32,899 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:01:32,900 INFO  L93              Difference]: Finished difference Result 5257 states and 8034 transitions.
[2025-03-03 15:01:32,900 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 15:01:32,900 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 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 148
[2025-03-03 15:01:32,901 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:01:32,912 INFO  L225             Difference]: With dead ends: 5257
[2025-03-03 15:01:32,912 INFO  L226             Difference]: Without dead ends: 3658
[2025-03-03 15:01:32,915 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 15:01:32,916 INFO  L435           NwaCegarLoop]: 398 mSDtfsCounter, 676 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 15:01:32,916 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 782 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 15:01:32,919 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3658 states.
[2025-03-03 15:01:32,967 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3658 to 3656.
[2025-03-03 15:01:32,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3656 states, 3655 states have (on average 1.479343365253078) internal successors, (5407), 3655 states have internal predecessors, (5407), 0 states have call successors, (0), 0 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:01:32,982 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 5407 transitions.
[2025-03-03 15:01:32,983 INFO  L78                 Accepts]: Start accepts. Automaton has 3656 states and 5407 transitions. Word has length 148
[2025-03-03 15:01:32,983 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:01:32,983 INFO  L471      AbstractCegarLoop]: Abstraction has 3656 states and 5407 transitions.
[2025-03-03 15:01:32,983 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:01:32,983 INFO  L276                IsEmpty]: Start isEmpty. Operand 3656 states and 5407 transitions.
[2025-03-03 15:01:32,986 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 149
[2025-03-03 15:01:32,986 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:01:32,986 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 15:01:32,986 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 15:01:32,987 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:01:32,987 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:01:32,987 INFO  L85        PathProgramCache]: Analyzing trace with hash -1569240750, now seen corresponding path program 1 times
[2025-03-03 15:01:32,987 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:01:32,987 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047671045]
[2025-03-03 15:01:32,987 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:01:32,987 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:01:33,005 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes.
[2025-03-03 15:01:33,058 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements.
[2025-03-03 15:01:33,058 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:01:33,058 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:01:33,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:01:33,248 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:01:33,248 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047671045]
[2025-03-03 15:01:33,248 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047671045] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:01:33,248 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:01:33,248 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 15:01:33,249 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214715970]
[2025-03-03 15:01:33,249 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:01:33,249 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 15:01:33,249 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:01:33,249 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 15:01:33,249 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 15:01:33,250 INFO  L87              Difference]: Start difference. First operand 3656 states and 5407 transitions. Second operand  has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:01:33,355 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:01:33,355 INFO  L93              Difference]: Finished difference Result 14003 states and 20648 transitions.
[2025-03-03 15:01:33,356 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 15:01:33,356 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 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 148
[2025-03-03 15:01:33,356 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:01:33,389 INFO  L225             Difference]: With dead ends: 14003
[2025-03-03 15:01:33,390 INFO  L226             Difference]: Without dead ends: 10410
[2025-03-03 15:01:33,398 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 15:01:33,399 INFO  L435           NwaCegarLoop]: 692 mSDtfsCounter, 771 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 15:01:33,399 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 1417 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 15:01:33,408 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10410 states.
[2025-03-03 15:01:33,575 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10410 to 7037.
[2025-03-03 15:01:33,586 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7037 states, 7036 states have (on average 1.4621944286526436) internal successors, (10288), 7036 states have internal predecessors, (10288), 0 states have call successors, (0), 0 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:01:33,608 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7037 states to 7037 states and 10288 transitions.
[2025-03-03 15:01:33,608 INFO  L78                 Accepts]: Start accepts. Automaton has 7037 states and 10288 transitions. Word has length 148
[2025-03-03 15:01:33,611 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:01:33,611 INFO  L471      AbstractCegarLoop]: Abstraction has 7037 states and 10288 transitions.
[2025-03-03 15:01:33,611 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:01:33,611 INFO  L276                IsEmpty]: Start isEmpty. Operand 7037 states and 10288 transitions.
[2025-03-03 15:01:33,619 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2025-03-03 15:01:33,619 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:01:33,619 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 15:01:33,619 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 15:01:33,620 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:01:33,620 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:01:33,620 INFO  L85        PathProgramCache]: Analyzing trace with hash 513354636, now seen corresponding path program 1 times
[2025-03-03 15:01:33,620 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:01:33,620 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657355394]
[2025-03-03 15:01:33,620 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:01:33,621 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:01:33,636 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes.
[2025-03-03 15:01:33,643 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements.
[2025-03-03 15:01:33,643 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:01:33,643 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:01:33,692 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:01:33,692 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:01:33,692 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657355394]
[2025-03-03 15:01:33,692 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657355394] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:01:33,692 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:01:33,692 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 15:01:33,692 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975732391]
[2025-03-03 15:01:33,692 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:01:33,693 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 15:01:33,693 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:01:33,694 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 15:01:33,694 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 15:01:33,694 INFO  L87              Difference]: Start difference. First operand 7037 states and 10288 transitions. Second operand  has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:01:33,756 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:01:33,757 INFO  L93              Difference]: Finished difference Result 14007 states and 20472 transitions.
[2025-03-03 15:01:33,760 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 15:01:33,761 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 149
[2025-03-03 15:01:33,761 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:01:33,783 INFO  L225             Difference]: With dead ends: 14007
[2025-03-03 15:01:33,783 INFO  L226             Difference]: Without dead ends: 7045
[2025-03-03 15:01:33,793 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:01:33,794 INFO  L435           NwaCegarLoop]: 419 mSDtfsCounter, 0 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 15:01:33,794 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 832 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 15:01:33,801 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7045 states.
[2025-03-03 15:01:33,956 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7045 to 7045.
[2025-03-03 15:01:33,971 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7045 states, 7044 states have (on average 1.4616695059625213) internal successors, (10296), 7044 states have internal predecessors, (10296), 0 states have call successors, (0), 0 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:01:33,994 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7045 states to 7045 states and 10296 transitions.
[2025-03-03 15:01:33,994 INFO  L78                 Accepts]: Start accepts. Automaton has 7045 states and 10296 transitions. Word has length 149
[2025-03-03 15:01:33,995 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:01:33,995 INFO  L471      AbstractCegarLoop]: Abstraction has 7045 states and 10296 transitions.
[2025-03-03 15:01:33,995 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:01:33,995 INFO  L276                IsEmpty]: Start isEmpty. Operand 7045 states and 10296 transitions.
[2025-03-03 15:01:34,001 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2025-03-03 15:01:34,002 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:01:34,002 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 15:01:34,002 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 15:01:34,002 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:01:34,003 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:01:34,004 INFO  L85        PathProgramCache]: Analyzing trace with hash 764824298, now seen corresponding path program 1 times
[2025-03-03 15:01:34,004 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:01:34,004 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624943409]
[2025-03-03 15:01:34,004 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:01:34,004 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:01:34,025 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes.
[2025-03-03 15:01:34,067 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements.
[2025-03-03 15:01:34,067 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:01:34,067 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:01:34,373 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:01:34,373 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:01:34,373 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624943409]
[2025-03-03 15:01:34,373 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624943409] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:01:34,373 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:01:34,373 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 15:01:34,374 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607184280]
[2025-03-03 15:01:34,374 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:01:34,374 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 15:01:34,374 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:01:34,374 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 15:01:34,375 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 15:01:34,375 INFO  L87              Difference]: Start difference. First operand 7045 states and 10296 transitions. Second operand  has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 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:01:34,431 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:01:34,431 INFO  L93              Difference]: Finished difference Result 14039 states and 20517 transitions.
[2025-03-03 15:01:34,431 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 15:01:34,436 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 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 150
[2025-03-03 15:01:34,436 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:01:34,455 INFO  L225             Difference]: With dead ends: 14039
[2025-03-03 15:01:34,456 INFO  L226             Difference]: Without dead ends: 7037
[2025-03-03 15:01:34,465 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 15:01:34,466 INFO  L435           NwaCegarLoop]: 449 mSDtfsCounter, 14 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 15:01:34,466 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1307 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 15:01:34,473 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7037 states.
[2025-03-03 15:01:34,571 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7037 to 7037.
[2025-03-03 15:01:34,581 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7037 states, 7036 states have (on average 1.4610574189880614) internal successors, (10280), 7036 states have internal predecessors, (10280), 0 states have call successors, (0), 0 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:01:34,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7037 states to 7037 states and 10280 transitions.
[2025-03-03 15:01:34,602 INFO  L78                 Accepts]: Start accepts. Automaton has 7037 states and 10280 transitions. Word has length 150
[2025-03-03 15:01:34,602 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:01:34,602 INFO  L471      AbstractCegarLoop]: Abstraction has 7037 states and 10280 transitions.
[2025-03-03 15:01:34,602 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 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:01:34,603 INFO  L276                IsEmpty]: Start isEmpty. Operand 7037 states and 10280 transitions.
[2025-03-03 15:01:34,608 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2025-03-03 15:01:34,608 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:01:34,609 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 15:01:34,609 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 15:01:34,609 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:01:34,610 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:01:34,610 INFO  L85        PathProgramCache]: Analyzing trace with hash 374013327, now seen corresponding path program 1 times
[2025-03-03 15:01:34,610 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:01:34,610 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835605527]
[2025-03-03 15:01:34,610 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:01:34,610 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:01:34,625 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes.
[2025-03-03 15:01:34,638 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements.
[2025-03-03 15:01:34,638 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:01:34,638 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:01:34,694 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:01:34,694 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:01:34,694 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835605527]
[2025-03-03 15:01:34,694 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835605527] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:01:34,694 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:01:34,694 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 15:01:34,695 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757259458]
[2025-03-03 15:01:34,695 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:01:34,695 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 15:01:34,695 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:01:34,695 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 15:01:34,696 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 15:01:34,696 INFO  L87              Difference]: Start difference. First operand 7037 states and 10280 transitions. Second operand  has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 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:01:34,781 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:01:34,782 INFO  L93              Difference]: Finished difference Result 16780 states and 24653 transitions.
[2025-03-03 15:01:34,782 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 15:01:34,782 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 150
[2025-03-03 15:01:34,784 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:01:34,806 INFO  L225             Difference]: With dead ends: 16780
[2025-03-03 15:01:34,806 INFO  L226             Difference]: Without dead ends: 10452
[2025-03-03 15:01:34,816 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:01:34,817 INFO  L435           NwaCegarLoop]: 742 mSDtfsCounter, 337 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 15:01:34,818 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1115 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 15:01:34,827 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10452 states.
[2025-03-03 15:01:34,998 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10452 to 10450.
[2025-03-03 15:01:35,013 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10450 states, 10449 states have (on average 1.4434874150636425) internal successors, (15083), 10449 states have internal predecessors, (15083), 0 states have call successors, (0), 0 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:01:35,044 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10450 states to 10450 states and 15083 transitions.
[2025-03-03 15:01:35,044 INFO  L78                 Accepts]: Start accepts. Automaton has 10450 states and 15083 transitions. Word has length 150
[2025-03-03 15:01:35,044 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:01:35,045 INFO  L471      AbstractCegarLoop]: Abstraction has 10450 states and 15083 transitions.
[2025-03-03 15:01:35,045 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 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:01:35,045 INFO  L276                IsEmpty]: Start isEmpty. Operand 10450 states and 15083 transitions.
[2025-03-03 15:01:35,052 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2025-03-03 15:01:35,052 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:01:35,052 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 15:01:35,052 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 15:01:35,052 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:01:35,053 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:01:35,053 INFO  L85        PathProgramCache]: Analyzing trace with hash -641685711, now seen corresponding path program 1 times
[2025-03-03 15:01:35,053 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:01:35,053 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633194068]
[2025-03-03 15:01:35,053 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:01:35,053 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:01:35,069 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes.
[2025-03-03 15:01:35,080 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements.
[2025-03-03 15:01:35,081 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:01:35,081 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:01:35,133 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:01:35,134 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:01:35,134 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633194068]
[2025-03-03 15:01:35,135 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633194068] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:01:35,135 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:01:35,135 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 15:01:35,135 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621007557]
[2025-03-03 15:01:35,135 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:01:35,135 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 15:01:35,135 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:01:35,136 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 15:01:35,136 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 15:01:35,136 INFO  L87              Difference]: Start difference. First operand 10450 states and 15083 transitions. Second operand  has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:01:35,381 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:01:35,382 INFO  L93              Difference]: Finished difference Result 28880 states and 42060 transitions.
[2025-03-03 15:01:35,382 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 15:01:35,382 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156
[2025-03-03 15:01:35,382 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:01:35,419 INFO  L225             Difference]: With dead ends: 28880
[2025-03-03 15:01:35,419 INFO  L226             Difference]: Without dead ends: 19822
[2025-03-03 15:01:35,435 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:01:35,436 INFO  L435           NwaCegarLoop]: 385 mSDtfsCounter, 256 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 15:01:35,436 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 700 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 15:01:35,455 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19822 states.
[2025-03-03 15:01:35,821 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19822 to 19820.
[2025-03-03 15:01:35,851 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19820 states, 19819 states have (on average 1.4355921085826733) internal successors, (28452), 19819 states have internal predecessors, (28452), 0 states have call successors, (0), 0 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:01:35,905 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19820 states to 19820 states and 28452 transitions.
[2025-03-03 15:01:35,905 INFO  L78                 Accepts]: Start accepts. Automaton has 19820 states and 28452 transitions. Word has length 156
[2025-03-03 15:01:35,906 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:01:35,906 INFO  L471      AbstractCegarLoop]: Abstraction has 19820 states and 28452 transitions.
[2025-03-03 15:01:35,906 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:01:35,906 INFO  L276                IsEmpty]: Start isEmpty. Operand 19820 states and 28452 transitions.
[2025-03-03 15:01:35,919 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2025-03-03 15:01:35,920 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:01:35,920 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 15:01:35,920 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 15:01:35,920 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:01:35,921 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:01:35,921 INFO  L85        PathProgramCache]: Analyzing trace with hash -245930574, now seen corresponding path program 1 times
[2025-03-03 15:01:35,921 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:01:35,921 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020159766]
[2025-03-03 15:01:35,921 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:01:35,921 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:01:35,938 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes.
[2025-03-03 15:01:35,963 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements.
[2025-03-03 15:01:35,963 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:01:35,963 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:01:36,509 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:01:36,509 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:01:36,509 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020159766]
[2025-03-03 15:01:36,509 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020159766] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:01:36,509 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:01:36,509 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-03 15:01:36,509 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747607092]
[2025-03-03 15:01:36,509 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:01:36,509 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-03 15:01:36,510 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:01:36,510 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-03 15:01:36,510 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-03-03 15:01:36,510 INFO  L87              Difference]: Start difference. First operand 19820 states and 28452 transitions. Second operand  has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:01:36,816 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:01:36,817 INFO  L93              Difference]: Finished difference Result 51334 states and 75744 transitions.
[2025-03-03 15:01:36,817 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 15:01:36,818 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 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 156
[2025-03-03 15:01:36,818 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:01:36,899 INFO  L225             Difference]: With dead ends: 51334
[2025-03-03 15:01:36,899 INFO  L226             Difference]: Without dead ends: 37752
[2025-03-03 15:01:36,930 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-03-03 15:01:36,930 INFO  L435           NwaCegarLoop]: 388 mSDtfsCounter, 1016 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 2311 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 15:01:36,930 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 2311 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 15:01:36,965 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37752 states.
[2025-03-03 15:01:37,480 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37752 to 37750.
[2025-03-03 15:01:37,532 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 37750 states, 37749 states have (on average 1.442952131182283) internal successors, (54470), 37749 states have internal predecessors, (54470), 0 states have call successors, (0), 0 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:01:37,619 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37750 states to 37750 states and 54470 transitions.
[2025-03-03 15:01:37,619 INFO  L78                 Accepts]: Start accepts. Automaton has 37750 states and 54470 transitions. Word has length 156
[2025-03-03 15:01:37,620 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:01:37,620 INFO  L471      AbstractCegarLoop]: Abstraction has 37750 states and 54470 transitions.
[2025-03-03 15:01:37,620 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:01:37,620 INFO  L276                IsEmpty]: Start isEmpty. Operand 37750 states and 54470 transitions.
[2025-03-03 15:01:37,640 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2025-03-03 15:01:37,641 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:01:37,641 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 15:01:37,641 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 15:01:37,641 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:01:37,642 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:01:37,642 INFO  L85        PathProgramCache]: Analyzing trace with hash -1063579024, now seen corresponding path program 1 times
[2025-03-03 15:01:37,642 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:01:37,642 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425973408]
[2025-03-03 15:01:37,642 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:01:37,642 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:01:37,657 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes.
[2025-03-03 15:01:37,677 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements.
[2025-03-03 15:01:37,678 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:01:37,678 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:01:37,882 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:01:37,882 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:01:37,882 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425973408]
[2025-03-03 15:01:37,882 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425973408] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:01:37,882 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:01:37,882 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 15:01:37,882 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978046968]
[2025-03-03 15:01:37,883 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:01:37,884 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 15:01:37,884 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:01:37,884 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 15:01:37,884 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 15:01:37,885 INFO  L87              Difference]: Start difference. First operand 37750 states and 54470 transitions. Second operand  has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:01:38,170 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:01:38,170 INFO  L93              Difference]: Finished difference Result 74786 states and 112082 transitions.
[2025-03-03 15:01:38,171 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 15:01:38,171 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 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 156
[2025-03-03 15:01:38,172 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:01:38,312 INFO  L225             Difference]: With dead ends: 74786
[2025-03-03 15:01:38,313 INFO  L226             Difference]: Without dead ends: 66568
[2025-03-03 15:01:38,353 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-03 15:01:38,353 INFO  L435           NwaCegarLoop]: 516 mSDtfsCounter, 936 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 15:01:38,354 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1263 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 15:01:38,409 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 66568 states.
[2025-03-03 15:01:39,279 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 66568 to 56042.
[2025-03-03 15:01:39,353 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 56042 states, 56041 states have (on average 1.47374243857176) internal successors, (82590), 56041 states have internal predecessors, (82590), 0 states have call successors, (0), 0 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:01:39,468 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 56042 states to 56042 states and 82590 transitions.
[2025-03-03 15:01:39,468 INFO  L78                 Accepts]: Start accepts. Automaton has 56042 states and 82590 transitions. Word has length 156
[2025-03-03 15:01:39,468 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:01:39,469 INFO  L471      AbstractCegarLoop]: Abstraction has 56042 states and 82590 transitions.
[2025-03-03 15:01:39,469 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:01:39,469 INFO  L276                IsEmpty]: Start isEmpty. Operand 56042 states and 82590 transitions.
[2025-03-03 15:01:39,496 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2025-03-03 15:01:39,497 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:01:39,497 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 15:01:39,497 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 15:01:39,497 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:01:39,497 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:01:39,497 INFO  L85        PathProgramCache]: Analyzing trace with hash -2074696274, now seen corresponding path program 1 times
[2025-03-03 15:01:39,498 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:01:39,498 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379697194]
[2025-03-03 15:01:39,498 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:01:39,498 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:01:39,517 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes.
[2025-03-03 15:01:39,533 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements.
[2025-03-03 15:01:39,534 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:01:39,534 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:01:39,617 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:01:39,617 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:01:39,617 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379697194]
[2025-03-03 15:01:39,618 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379697194] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:01:39,618 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:01:39,618 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 15:01:39,618 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819372261]
[2025-03-03 15:01:39,618 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:01:39,618 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 15:01:39,618 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:01:39,619 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 15:01:39,619 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 15:01:39,619 INFO  L87              Difference]: Start difference. First operand 56042 states and 82590 transitions. Second operand  has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:01:40,003 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:01:40,003 INFO  L93              Difference]: Finished difference Result 129932 states and 195066 transitions.
[2025-03-03 15:01:40,004 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 15:01:40,004 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156
[2025-03-03 15:01:40,004 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:01:40,225 INFO  L225             Difference]: With dead ends: 129932
[2025-03-03 15:01:40,226 INFO  L226             Difference]: Without dead ends: 87586
[2025-03-03 15:01:40,289 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:01:40,289 INFO  L435           NwaCegarLoop]: 385 mSDtfsCounter, 242 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 15:01:40,289 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 675 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 15:01:40,355 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 87586 states.
[2025-03-03 15:01:41,716 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 87586 to 87584.
[2025-03-03 15:01:41,797 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 87584 states, 87583 states have (on average 1.4688695294748981) internal successors, (128648), 87583 states have internal predecessors, (128648), 0 states have call successors, (0), 0 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:01:41,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 87584 states to 87584 states and 128648 transitions.
[2025-03-03 15:01:41,955 INFO  L78                 Accepts]: Start accepts. Automaton has 87584 states and 128648 transitions. Word has length 156
[2025-03-03 15:01:41,956 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:01:41,956 INFO  L471      AbstractCegarLoop]: Abstraction has 87584 states and 128648 transitions.
[2025-03-03 15:01:41,956 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:01:41,956 INFO  L276                IsEmpty]: Start isEmpty. Operand 87584 states and 128648 transitions.
[2025-03-03 15:01:41,975 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2025-03-03 15:01:41,975 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:01:41,975 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 15:01:41,975 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-03 15:01:41,975 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:01:41,976 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:01:41,976 INFO  L85        PathProgramCache]: Analyzing trace with hash 240227184, now seen corresponding path program 1 times
[2025-03-03 15:01:41,976 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:01:41,976 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872375211]
[2025-03-03 15:01:41,976 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:01:41,976 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:01:41,993 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes.
[2025-03-03 15:01:42,021 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements.
[2025-03-03 15:01:42,022 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:01:42,022 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:01:42,330 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:01:42,330 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:01:42,330 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872375211]
[2025-03-03 15:01:42,330 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872375211] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:01:42,330 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:01:42,331 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 15:01:42,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985248842]
[2025-03-03 15:01:42,331 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:01:42,331 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 15:01:42,331 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:01:42,331 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 15:01:42,331 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 15:01:42,331 INFO  L87              Difference]: Start difference. First operand 87584 states and 128648 transitions. Second operand  has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:01:42,827 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:01:42,827 INFO  L93              Difference]: Finished difference Result 167057 states and 245549 transitions.
[2025-03-03 15:01:42,828 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 15:01:42,828 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 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 156
[2025-03-03 15:01:42,828 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:01:42,963 INFO  L225             Difference]: With dead ends: 167057
[2025-03-03 15:01:42,964 INFO  L226             Difference]: Without dead ends: 79968
[2025-03-03 15:01:42,992 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 15:01:42,993 INFO  L435           NwaCegarLoop]: 456 mSDtfsCounter, 21 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 15:01:42,994 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1319 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 15:01:43,039 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 79968 states.
[2025-03-03 15:01:44,039 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 79968 to 79968.
[2025-03-03 15:01:44,109 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 79968 states, 79967 states have (on average 1.4692810784448584) internal successors, (117494), 79967 states have internal predecessors, (117494), 0 states have call successors, (0), 0 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:01:44,247 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 79968 states to 79968 states and 117494 transitions.
[2025-03-03 15:01:44,248 INFO  L78                 Accepts]: Start accepts. Automaton has 79968 states and 117494 transitions. Word has length 156
[2025-03-03 15:01:44,248 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:01:44,248 INFO  L471      AbstractCegarLoop]: Abstraction has 79968 states and 117494 transitions.
[2025-03-03 15:01:44,248 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:01:44,249 INFO  L276                IsEmpty]: Start isEmpty. Operand 79968 states and 117494 transitions.
[2025-03-03 15:01:44,266 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2025-03-03 15:01:44,266 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:01:44,267 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 15:01:44,267 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 15:01:44,267 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:01:44,267 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:01:44,267 INFO  L85        PathProgramCache]: Analyzing trace with hash 1496409863, now seen corresponding path program 1 times
[2025-03-03 15:01:44,267 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:01:44,267 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010590891]
[2025-03-03 15:01:44,267 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:01:44,267 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:01:44,282 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes.
[2025-03-03 15:01:44,292 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements.
[2025-03-03 15:01:44,292 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:01:44,292 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:01:44,331 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:01:44,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:01:44,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010590891]
[2025-03-03 15:01:44,331 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010590891] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:01:44,331 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:01:44,331 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 15:01:44,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481175342]
[2025-03-03 15:01:44,331 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:01:44,332 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 15:01:44,332 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:01:44,332 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 15:01:44,332 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 15:01:44,332 INFO  L87              Difference]: Start difference. First operand 79968 states and 117494 transitions. Second operand  has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:01:45,046 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:01:45,047 INFO  L93              Difference]: Finished difference Result 198471 states and 291703 transitions.
[2025-03-03 15:01:45,047 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 15:01:45,047 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156
[2025-03-03 15:01:45,047 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:01:45,238 INFO  L225             Difference]: With dead ends: 198471
[2025-03-03 15:01:45,238 INFO  L226             Difference]: Without dead ends: 119998
[2025-03-03 15:01:45,300 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:01:45,301 INFO  L435           NwaCegarLoop]: 773 mSDtfsCounter, 337 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 15:01:45,301 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1142 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 15:01:45,368 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 119998 states.
[2025-03-03 15:01:46,866 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 119998 to 119996.
[2025-03-03 15:01:46,968 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 119996 states, 119995 states have (on average 1.4478436601525064) internal successors, (173734), 119995 states have internal predecessors, (173734), 0 states have call successors, (0), 0 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:01:47,173 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 119996 states to 119996 states and 173734 transitions.
[2025-03-03 15:01:47,173 INFO  L78                 Accepts]: Start accepts. Automaton has 119996 states and 173734 transitions. Word has length 156
[2025-03-03 15:01:47,173 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:01:47,173 INFO  L471      AbstractCegarLoop]: Abstraction has 119996 states and 173734 transitions.
[2025-03-03 15:01:47,173 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:01:47,174 INFO  L276                IsEmpty]: Start isEmpty. Operand 119996 states and 173734 transitions.
[2025-03-03 15:01:47,198 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2025-03-03 15:01:47,199 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:01:47,199 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 15:01:47,199 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-03 15:01:47,199 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:01:47,199 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:01:47,199 INFO  L85        PathProgramCache]: Analyzing trace with hash 901990455, now seen corresponding path program 1 times
[2025-03-03 15:01:47,199 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:01:47,199 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265215975]
[2025-03-03 15:01:47,199 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:01:47,200 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:01:47,214 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes.
[2025-03-03 15:01:47,225 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements.
[2025-03-03 15:01:47,225 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:01:47,225 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:01:47,301 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:01:47,302 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:01:47,302 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265215975]
[2025-03-03 15:01:47,302 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265215975] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:01:47,302 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:01:47,302 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 15:01:47,302 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753928069]
[2025-03-03 15:01:47,302 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:01:47,302 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 15:01:47,303 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:01:47,303 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 15:01:47,303 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 15:01:47,303 INFO  L87              Difference]: Start difference. First operand 119996 states and 173734 transitions. Second operand  has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:01:48,981 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:01:48,981 INFO  L93              Difference]: Finished difference Result 356519 states and 536139 transitions.
[2025-03-03 15:01:48,982 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 15:01:48,982 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 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 159
[2025-03-03 15:01:48,982 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:01:49,513 INFO  L225             Difference]: With dead ends: 356519
[2025-03-03 15:01:49,513 INFO  L226             Difference]: Without dead ends: 272246
[2025-03-03 15:01:49,637 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-03-03 15:01:49,638 INFO  L435           NwaCegarLoop]: 662 mSDtfsCounter, 1171 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 15:01:49,638 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 1658 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 15:01:49,844 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 272246 states.
[2025-03-03 15:01:52,564 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 272246 to 181919.
[2025-03-03 15:01:52,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 181919 states, 181918 states have (on average 1.4657263162523775) internal successors, (266642), 181918 states have internal predecessors, (266642), 0 states have call successors, (0), 0 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:01:53,165 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 181919 states to 181919 states and 266642 transitions.
[2025-03-03 15:01:53,165 INFO  L78                 Accepts]: Start accepts. Automaton has 181919 states and 266642 transitions. Word has length 159
[2025-03-03 15:01:53,165 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:01:53,165 INFO  L471      AbstractCegarLoop]: Abstraction has 181919 states and 266642 transitions.
[2025-03-03 15:01:53,166 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:01:53,166 INFO  L276                IsEmpty]: Start isEmpty. Operand 181919 states and 266642 transitions.
[2025-03-03 15:01:53,217 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2025-03-03 15:01:53,217 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:01:53,217 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 15:01:53,217 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-03 15:01:53,218 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:01:53,218 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:01:53,218 INFO  L85        PathProgramCache]: Analyzing trace with hash 1092040501, now seen corresponding path program 1 times
[2025-03-03 15:01:53,218 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:01:53,218 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072275980]
[2025-03-03 15:01:53,218 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:01:53,218 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:01:53,650 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes.
[2025-03-03 15:01:53,685 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements.
[2025-03-03 15:01:53,685 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:01:53,685 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:01:54,082 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:01:54,083 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:01:54,083 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072275980]
[2025-03-03 15:01:54,083 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072275980] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:01:54,083 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:01:54,083 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-03 15:01:54,083 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105691899]
[2025-03-03 15:01:54,084 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:01:54,084 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 15:01:54,084 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:01:54,084 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 15:01:54,085 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2025-03-03 15:01:54,085 INFO  L87              Difference]: Start difference. First operand 181919 states and 266642 transitions. Second operand  has 10 states, 10 states have (on average 15.9) internal successors, (159), 9 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:01:55,219 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:01:55,220 INFO  L93              Difference]: Finished difference Result 336152 states and 497037 transitions.
[2025-03-03 15:01:55,220 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 15:01:55,220 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 15.9) internal successors, (159), 9 states have internal predecessors, (159), 0 states have call successors, (0), 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 159
[2025-03-03 15:01:55,220 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:01:55,487 INFO  L225             Difference]: With dead ends: 336152
[2025-03-03 15:01:55,488 INFO  L226             Difference]: Without dead ends: 168307
[2025-03-03 15:01:55,579 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132
[2025-03-03 15:01:55,580 INFO  L435           NwaCegarLoop]: 315 mSDtfsCounter, 1405 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1405 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 15:01:55,580 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1405 Valid, 613 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 15:01:55,705 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 168307 states.
[2025-03-03 15:01:57,527 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 168307 to 99297.
[2025-03-03 15:01:57,617 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 99297 states, 99296 states have (on average 1.4576820818562681) internal successors, (144742), 99296 states have internal predecessors, (144742), 0 states have call successors, (0), 0 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:01:57,815 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 99297 states to 99297 states and 144742 transitions.
[2025-03-03 15:01:57,815 INFO  L78                 Accepts]: Start accepts. Automaton has 99297 states and 144742 transitions. Word has length 159
[2025-03-03 15:01:57,816 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:01:57,816 INFO  L471      AbstractCegarLoop]: Abstraction has 99297 states and 144742 transitions.
[2025-03-03 15:01:57,816 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 15.9) internal successors, (159), 9 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:01:57,816 INFO  L276                IsEmpty]: Start isEmpty. Operand 99297 states and 144742 transitions.
[2025-03-03 15:01:57,832 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2025-03-03 15:01:57,833 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:01:57,833 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 15:01:57,833 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-03 15:01:57,833 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:01:57,833 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:01:58,087 INFO  L85        PathProgramCache]: Analyzing trace with hash 475547860, now seen corresponding path program 1 times
[2025-03-03 15:01:58,087 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:01:58,087 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502153567]
[2025-03-03 15:01:58,088 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:01:58,088 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:01:58,101 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes.
[2025-03-03 15:01:58,117 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements.
[2025-03-03 15:01:58,117 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:01:58,117 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:01:58,259 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:01:58,260 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:01:58,260 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502153567]
[2025-03-03 15:01:58,260 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502153567] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:01:58,260 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:01:58,260 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 15:01:58,260 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616151799]
[2025-03-03 15:01:58,260 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:01:58,261 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 15:01:58,261 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:01:58,261 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 15:01:58,261 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 15:01:58,261 INFO  L87              Difference]: Start difference. First operand 99297 states and 144742 transitions. Second operand  has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:01:58,681 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:01:58,682 INFO  L93              Difference]: Finished difference Result 181347 states and 268886 transitions.
[2025-03-03 15:01:58,682 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 15:01:58,682 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 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 159
[2025-03-03 15:01:58,683 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:01:58,841 INFO  L225             Difference]: With dead ends: 181347
[2025-03-03 15:01:58,841 INFO  L226             Difference]: Without dead ends: 99299
[2025-03-03 15:01:58,911 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 15:01:58,911 INFO  L435           NwaCegarLoop]: 380 mSDtfsCounter, 486 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 15:01:58,911 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 803 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 15:01:58,976 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 99299 states.
[2025-03-03 15:02:00,092 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 99299 to 93787.
[2025-03-03 15:02:00,170 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 93787 states, 93786 states have (on average 1.4470816539782057) internal successors, (135716), 93786 states have internal predecessors, (135716), 0 states have call successors, (0), 0 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:02:00,316 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 93787 states to 93787 states and 135716 transitions.
[2025-03-03 15:02:00,316 INFO  L78                 Accepts]: Start accepts. Automaton has 93787 states and 135716 transitions. Word has length 159
[2025-03-03 15:02:00,316 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:02:00,316 INFO  L471      AbstractCegarLoop]: Abstraction has 93787 states and 135716 transitions.
[2025-03-03 15:02:00,317 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:02:00,317 INFO  L276                IsEmpty]: Start isEmpty. Operand 93787 states and 135716 transitions.
[2025-03-03 15:02:00,329 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2025-03-03 15:02:00,329 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:02:00,329 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 15:02:00,329 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-03 15:02:00,330 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:02:00,330 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:02:00,330 INFO  L85        PathProgramCache]: Analyzing trace with hash -535569390, now seen corresponding path program 1 times
[2025-03-03 15:02:00,330 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:02:00,330 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802749030]
[2025-03-03 15:02:00,330 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:02:00,330 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:02:00,343 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes.
[2025-03-03 15:02:00,352 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements.
[2025-03-03 15:02:00,352 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:02:00,352 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:02:00,437 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:02:00,437 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:02:00,438 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802749030]
[2025-03-03 15:02:00,438 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802749030] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:02:00,438 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:02:00,438 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 15:02:00,438 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376230640]
[2025-03-03 15:02:00,438 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:02:00,439 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 15:02:00,439 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:02:00,439 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 15:02:00,440 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 15:02:00,440 INFO  L87              Difference]: Start difference. First operand 93787 states and 135716 transitions. Second operand  has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:02:00,897 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:02:00,898 INFO  L93              Difference]: Finished difference Result 156221 states and 229622 transitions.
[2025-03-03 15:02:00,898 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 15:02:00,898 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 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 159
[2025-03-03 15:02:00,899 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:02:01,110 INFO  L225             Difference]: With dead ends: 156221
[2025-03-03 15:02:01,110 INFO  L226             Difference]: Without dead ends: 141939
[2025-03-03 15:02:01,168 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-03 15:02:01,169 INFO  L435           NwaCegarLoop]: 618 mSDtfsCounter, 735 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 15:02:01,169 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 1519 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 15:02:01,549 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 141939 states.
[2025-03-03 15:02:02,892 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 141939 to 97023.
[2025-03-03 15:02:02,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 97023 states, 97022 states have (on average 1.4492383170827234) internal successors, (140608), 97022 states have internal predecessors, (140608), 0 states have call successors, (0), 0 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:02:03,106 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97023 states to 97023 states and 140608 transitions.
[2025-03-03 15:02:03,107 INFO  L78                 Accepts]: Start accepts. Automaton has 97023 states and 140608 transitions. Word has length 159
[2025-03-03 15:02:03,107 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:02:03,107 INFO  L471      AbstractCegarLoop]: Abstraction has 97023 states and 140608 transitions.
[2025-03-03 15:02:03,107 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:02:03,107 INFO  L276                IsEmpty]: Start isEmpty. Operand 97023 states and 140608 transitions.
[2025-03-03 15:02:03,120 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2025-03-03 15:02:03,120 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:02:03,120 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 15:02:03,120 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-03 15:02:03,120 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:02:03,121 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:02:03,121 INFO  L85        PathProgramCache]: Analyzing trace with hash -1435494698, now seen corresponding path program 1 times
[2025-03-03 15:02:03,121 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:02:03,121 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118214592]
[2025-03-03 15:02:03,121 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:02:03,121 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:02:03,137 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes.
[2025-03-03 15:02:03,163 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements.
[2025-03-03 15:02:03,163 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:02:03,164 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:02:03,824 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:02:03,824 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:02:03,824 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118214592]
[2025-03-03 15:02:03,824 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118214592] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:02:03,824 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:02:03,824 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-03-03 15:02:03,824 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766763368]
[2025-03-03 15:02:03,824 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:02:03,825 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-03-03 15:02:03,825 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:02:03,825 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-03-03 15:02:03,825 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2025-03-03 15:02:03,826 INFO  L87              Difference]: Start difference. First operand 97023 states and 140608 transitions. Second operand  has 13 states, 13 states have (on average 12.23076923076923) internal successors, (159), 13 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:02:04,774 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:02:04,775 INFO  L93              Difference]: Finished difference Result 155120 states and 225077 transitions.
[2025-03-03 15:02:04,776 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2025-03-03 15:02:04,776 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 12.23076923076923) internal successors, (159), 13 states have internal predecessors, (159), 0 states have call successors, (0), 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 159
[2025-03-03 15:02:04,776 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:02:04,956 INFO  L225             Difference]: With dead ends: 155120
[2025-03-03 15:02:04,956 INFO  L226             Difference]: Without dead ends: 119998
[2025-03-03 15:02:05,011 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650
[2025-03-03 15:02:05,012 INFO  L435           NwaCegarLoop]: 499 mSDtfsCounter, 2019 mSDsluCounter, 3819 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2019 SdHoareTripleChecker+Valid, 4318 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 15:02:05,012 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2019 Valid, 4318 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 15:02:05,091 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 119998 states.
[2025-03-03 15:02:06,381 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 119998 to 99283.
[2025-03-03 15:02:06,469 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 99283 states, 99282 states have (on average 1.441832356318366) internal successors, (143148), 99282 states have internal predecessors, (143148), 0 states have call successors, (0), 0 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:02:06,673 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 99283 states to 99283 states and 143148 transitions.
[2025-03-03 15:02:06,673 INFO  L78                 Accepts]: Start accepts. Automaton has 99283 states and 143148 transitions. Word has length 159
[2025-03-03 15:02:06,673 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:02:06,673 INFO  L471      AbstractCegarLoop]: Abstraction has 99283 states and 143148 transitions.
[2025-03-03 15:02:06,674 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 12.23076923076923) internal successors, (159), 13 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:02:06,674 INFO  L276                IsEmpty]: Start isEmpty. Operand 99283 states and 143148 transitions.
[2025-03-03 15:02:06,693 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2025-03-03 15:02:06,693 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:02:06,693 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 15:02:06,693 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-03-03 15:02:06,693 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:02:06,694 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:02:06,694 INFO  L85        PathProgramCache]: Analyzing trace with hash -1569508204, now seen corresponding path program 1 times
[2025-03-03 15:02:06,694 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:02:06,694 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319915707]
[2025-03-03 15:02:06,694 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:02:06,694 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:02:06,712 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes.
[2025-03-03 15:02:06,757 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements.
[2025-03-03 15:02:06,758 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:02:06,758 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:02:06,937 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:02:06,937 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:02:06,937 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319915707]
[2025-03-03 15:02:06,937 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319915707] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:02:06,937 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:02:06,937 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 15:02:06,937 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017165323]
[2025-03-03 15:02:06,937 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:02:06,938 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 15:02:06,938 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:02:06,938 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 15:02:06,938 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 15:02:06,938 INFO  L87              Difference]: Start difference. First operand 99283 states and 143148 transitions. Second operand  has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:02:07,840 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:02:07,841 INFO  L93              Difference]: Finished difference Result 186739 states and 268789 transitions.
[2025-03-03 15:02:07,841 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 15:02:07,841 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 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 159
[2025-03-03 15:02:07,842 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:02:07,960 INFO  L225             Difference]: With dead ends: 186739
[2025-03-03 15:02:07,960 INFO  L226             Difference]: Without dead ends: 87790
[2025-03-03 15:02:08,013 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:02:08,013 INFO  L435           NwaCegarLoop]: 677 mSDtfsCounter, 337 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 15:02:08,014 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1679 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 15:02:08,069 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 87790 states.
[2025-03-03 15:02:08,928 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 87790 to 87749.
[2025-03-03 15:02:08,999 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 87749 states, 87748 states have (on average 1.4356452568719515) internal successors, (125975), 87748 states have internal predecessors, (125975), 0 states have call successors, (0), 0 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:02:09,118 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 87749 states to 87749 states and 125975 transitions.
[2025-03-03 15:02:09,118 INFO  L78                 Accepts]: Start accepts. Automaton has 87749 states and 125975 transitions. Word has length 159
[2025-03-03 15:02:09,118 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:02:09,118 INFO  L471      AbstractCegarLoop]: Abstraction has 87749 states and 125975 transitions.
[2025-03-03 15:02:09,118 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:02:09,118 INFO  L276                IsEmpty]: Start isEmpty. Operand 87749 states and 125975 transitions.
[2025-03-03 15:02:09,131 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2025-03-03 15:02:09,131 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:02:09,131 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 15:02:09,131 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-03-03 15:02:09,132 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:02:09,132 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:02:09,132 INFO  L85        PathProgramCache]: Analyzing trace with hash 318317548, now seen corresponding path program 1 times
[2025-03-03 15:02:09,132 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:02:09,132 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216149145]
[2025-03-03 15:02:09,132 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:02:09,132 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:02:09,146 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.
[2025-03-03 15:02:09,150 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements.
[2025-03-03 15:02:09,150 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:02:09,150 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:02:09,179 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:02:09,179 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:02:09,179 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216149145]
[2025-03-03 15:02:09,179 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216149145] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:02:09,179 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:02:09,179 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 15:02:09,179 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811798025]
[2025-03-03 15:02:09,179 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:02:09,180 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 15:02:09,180 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:02:09,180 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 15:02:09,180 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 15:02:09,180 INFO  L87              Difference]: Start difference. First operand 87749 states and 125975 transitions. Second operand  has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 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:02:09,543 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 15:02:09,544 INFO  L93              Difference]: Finished difference Result 175402 states and 250959 transitions.
[2025-03-03 15:02:09,544 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 15:02:09,544 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 160
[2025-03-03 15:02:09,544 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 15:02:10,052 INFO  L225             Difference]: With dead ends: 175402
[2025-03-03 15:02:10,052 INFO  L226             Difference]: Without dead ends: 122751
[2025-03-03 15:02:10,079 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:02:10,080 INFO  L435           NwaCegarLoop]: 700 mSDtfsCounter, 373 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 15:02:10,080 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1101 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 15:02:10,130 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 122751 states.
[2025-03-03 15:02:11,205 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 122751 to 87749.
[2025-03-03 15:02:11,284 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 87749 states, 87748 states have (on average 1.4356224643296713) internal successors, (125973), 87748 states have internal predecessors, (125973), 0 states have call successors, (0), 0 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:02:11,459 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 87749 states to 87749 states and 125973 transitions.
[2025-03-03 15:02:11,459 INFO  L78                 Accepts]: Start accepts. Automaton has 87749 states and 125973 transitions. Word has length 160
[2025-03-03 15:02:11,459 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 15:02:11,459 INFO  L471      AbstractCegarLoop]: Abstraction has 87749 states and 125973 transitions.
[2025-03-03 15:02:11,459 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 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:02:11,459 INFO  L276                IsEmpty]: Start isEmpty. Operand 87749 states and 125973 transitions.
[2025-03-03 15:02:11,477 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 162
[2025-03-03 15:02:11,478 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 15:02:11,478 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 15:02:11,478 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-03-03 15:02:11,478 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 15:02:11,478 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 15:02:11,478 INFO  L85        PathProgramCache]: Analyzing trace with hash 2072945271, now seen corresponding path program 1 times
[2025-03-03 15:02:11,478 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 15:02:11,479 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032021061]
[2025-03-03 15:02:11,479 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 15:02:11,479 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 15:02:11,507 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes.
[2025-03-03 15:02:11,596 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements.
[2025-03-03 15:02:11,597 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 15:02:11,598 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 15:02:11,776 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:02:11,776 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 15:02:11,776 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032021061]
[2025-03-03 15:02:11,776 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032021061] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 15:02:11,776 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 15:02:11,776 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 15:02:11,776 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728778859]
[2025-03-03 15:02:11,776 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 15:02:11,777 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 15:02:11,777 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 15:02:11,777 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 15:02:11,777 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 15:02:11,777 INFO  L87              Difference]: Start difference. First operand 87749 states and 125973 transitions. Second operand  has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)