./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 4a390ef5
Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-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 5990b1cf211e12a23ca85722a0e539783495fb8504bce43e0d5e789fe089f178
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-4a390ef-m
[2024-10-24 01:48:32,828 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-10-24 01:48:32,898 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-10-24 01:48:32,903 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-10-24 01:48:32,903 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-24 01:48:32,936 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-24 01:48:32,936 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-24 01:48:32,937 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-24 01:48:32,937 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-10-24 01:48:32,938 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-10-24 01:48:32,938 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-24 01:48:32,939 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-24 01:48:32,939 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-24 01:48:32,939 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-10-24 01:48:32,939 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-10-24 01:48:32,941 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-24 01:48:32,941 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-10-24 01:48:32,942 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-10-24 01:48:32,942 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-10-24 01:48:32,942 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-10-24 01:48:32,942 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-10-24 01:48:32,946 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-10-24 01:48:32,947 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-24 01:48:32,947 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-10-24 01:48:32,947 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-10-24 01:48:32,947 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-10-24 01:48:32,947 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-10-24 01:48:32,947 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-10-24 01:48:32,948 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-24 01:48:32,948 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-10-24 01:48:32,948 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-10-24 01:48:32,948 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-10-24 01:48:32,948 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-24 01:48:32,948 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-24 01:48:32,948 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-10-24 01:48:32,949 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-24 01:48:32,949 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-10-24 01:48:32,949 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-24 01:48:32,949 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-24 01:48:32,949 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-24 01:48:32,949 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-10-24 01:48:32,950 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-24 01:48:32,950 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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 -> 5990b1cf211e12a23ca85722a0e539783495fb8504bce43e0d5e789fe089f178
[2024-10-24 01:48:33,193 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-24 01:48:33,226 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-24 01:48:33,230 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-24 01:48:33,231 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-10-24 01:48:33,231 INFO  L274        PluginConnector]: CDTParser initialized
[2024-10-24 01:48:33,232 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c
[2024-10-24 01:48:34,526 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-10-24 01:48:34,824 INFO  L384              CDTParser]: Found 1 translation units.
[2024-10-24 01:48:34,824 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c
[2024-10-24 01:48:34,843 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7128d23ea/6ad2c8de217146bd805b69320cdb1963/FLAGa342cd72c
[2024-10-24 01:48:34,856 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7128d23ea/6ad2c8de217146bd805b69320cdb1963
[2024-10-24 01:48:34,858 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-24 01:48:34,860 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-24 01:48:34,861 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-24 01:48:34,861 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-24 01:48:34,865 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-24 01:48:34,866 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:48:34" (1/1) ...
[2024-10-24 01:48:34,869 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e8f3572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:48:34, skipping insertion in model container
[2024-10-24 01:48:34,869 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:48:34" (1/1) ...
[2024-10-24 01:48:34,930 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-10-24 01:48:35,194 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[18815,18828]
[2024-10-24 01:48:35,223 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[25895,25908]
[2024-10-24 01:48:35,233 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[29420,29433]
[2024-10-24 01:48:35,242 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32798,32811]
[2024-10-24 01:48:35,253 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[36856,36869]
[2024-10-24 01:48:35,274 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[40310,40323]
[2024-10-24 01:48:35,292 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[43875,43888]
[2024-10-24 01:48:35,311 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[47290,47303]
[2024-10-24 01:48:35,323 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[50969,50982]
[2024-10-24 01:48:35,344 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[54551,54564]
[2024-10-24 01:48:35,358 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[58080,58093]
[2024-10-24 01:48:35,380 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-24 01:48:35,394 INFO  L200         MainTranslator]: Completed pre-run
[2024-10-24 01:48:35,467 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[18815,18828]
[2024-10-24 01:48:35,490 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[25895,25908]
[2024-10-24 01:48:35,498 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[29420,29433]
[2024-10-24 01:48:35,504 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32798,32811]
[2024-10-24 01:48:35,511 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[36856,36869]
[2024-10-24 01:48:35,517 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[40310,40323]
[2024-10-24 01:48:35,527 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[43875,43888]
[2024-10-24 01:48:35,537 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[47290,47303]
[2024-10-24 01:48:35,548 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[50969,50982]
[2024-10-24 01:48:35,558 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[54551,54564]
[2024-10-24 01:48:35,567 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[58080,58093]
[2024-10-24 01:48:35,584 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-24 01:48:35,605 INFO  L204         MainTranslator]: Completed translation
[2024-10-24 01:48:35,605 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:48:35 WrapperNode
[2024-10-24 01:48:35,605 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-24 01:48:35,606 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-24 01:48:35,606 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-24 01:48:35,606 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-24 01:48:35,612 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:48:35" (1/1) ...
[2024-10-24 01:48:35,640 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:48:35" (1/1) ...
[2024-10-24 01:48:35,710 INFO  L138                Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2962
[2024-10-24 01:48:35,710 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-24 01:48:35,711 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-24 01:48:35,711 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-24 01:48:35,711 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-10-24 01:48:35,720 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:48:35" (1/1) ...
[2024-10-24 01:48:35,720 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:48:35" (1/1) ...
[2024-10-24 01:48:35,727 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:48:35" (1/1) ...
[2024-10-24 01:48:35,771 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].
[2024-10-24 01:48:35,772 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:48:35" (1/1) ...
[2024-10-24 01:48:35,772 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:48:35" (1/1) ...
[2024-10-24 01:48:35,841 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:48:35" (1/1) ...
[2024-10-24 01:48:35,867 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:48:35" (1/1) ...
[2024-10-24 01:48:35,880 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:48:35" (1/1) ...
[2024-10-24 01:48:35,894 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:48:35" (1/1) ...
[2024-10-24 01:48:35,938 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-24 01:48:35,939 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-24 01:48:35,939 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-10-24 01:48:35,939 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-10-24 01:48:35,940 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:48:35" (1/1) ...
[2024-10-24 01:48:35,944 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-24 01:48:35,955 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-24 01:48:35,974 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)
[2024-10-24 01:48:35,983 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
[2024-10-24 01:48:36,016 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-24 01:48:36,016 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-10-24 01:48:36,016 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-24 01:48:36,016 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-24 01:48:36,170 INFO  L238             CfgBuilder]: Building ICFG
[2024-10-24 01:48:36,172 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-24 01:48:37,387 INFO  L?                        ?]: Removed 576 outVars from TransFormulas that were not future-live.
[2024-10-24 01:48:37,388 INFO  L287             CfgBuilder]: Performing block encoding
[2024-10-24 01:48:37,441 INFO  L309             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-24 01:48:37,444 INFO  L314             CfgBuilder]: Removed 0 assume(true) statements.
[2024-10-24 01:48:37,445 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:48:37 BoogieIcfgContainer
[2024-10-24 01:48:37,445 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-24 01:48:37,446 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-24 01:48:37,447 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-10-24 01:48:37,449 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-10-24 01:48:37,449 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:48:34" (1/3) ...
[2024-10-24 01:48:37,450 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d1cf94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:48:37, skipping insertion in model container
[2024-10-24 01:48:37,450 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:48:35" (2/3) ...
[2024-10-24 01:48:37,450 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d1cf94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:48:37, skipping insertion in model container
[2024-10-24 01:48:37,451 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:48:37" (3/3) ...
[2024-10-24 01:48:37,452 INFO  L112   eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c
[2024-10-24 01:48:37,465 INFO  L209   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-24 01:48:37,465 INFO  L149   ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations.
[2024-10-24 01:48:37,540 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-24 01:48:37,547 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;@221b2546, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-24 01:48:37,547 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2024-10-24 01:48:37,557 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 568 states, 556 states have (on average 1.7859712230215827) internal successors, (993), 567 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:37,575 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2024-10-24 01:48:37,576 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:37,576 INFO  L215           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]
[2024-10-24 01:48:37,577 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:37,582 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:37,582 INFO  L85        PathProgramCache]: Analyzing trace with hash -1518492486, now seen corresponding path program 1 times
[2024-10-24 01:48:37,589 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:37,590 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937000280]
[2024-10-24 01:48:37,590 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:37,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:37,829 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:38,097 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:38,099 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:38,099 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937000280]
[2024-10-24 01:48:38,099 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937000280] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:38,100 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:38,100 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-24 01:48:38,102 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601776248]
[2024-10-24 01:48:38,102 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:38,105 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-10-24 01:48:38,106 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:38,124 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-10-24 01:48:38,125 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-10-24 01:48:38,128 INFO  L87              Difference]: Start difference. First operand  has 568 states, 556 states have (on average 1.7859712230215827) internal successors, (993), 567 states have internal predecessors, (993), 0 states have call successors, (0), 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 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:38,637 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:38,638 INFO  L93              Difference]: Finished difference Result 780 states and 1329 transitions.
[2024-10-24 01:48:38,639 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-10-24 01:48:38,640 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59
[2024-10-24 01:48:38,641 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:38,651 INFO  L225             Difference]: With dead ends: 780
[2024-10-24 01:48:38,651 INFO  L226             Difference]: Without dead ends: 502
[2024-10-24 01:48:38,655 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-10-24 01:48:38,658 INFO  L432           NwaCegarLoop]: 481 mSDtfsCounter, 2431 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2431 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:38,658 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [2431 Valid, 537 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-10-24 01:48:38,676 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 502 states.
[2024-10-24 01:48:38,706 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502.
[2024-10-24 01:48:38,711 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 502 states, 491 states have (on average 1.274949083503055) internal successors, (626), 501 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:38,713 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 626 transitions.
[2024-10-24 01:48:38,717 INFO  L78                 Accepts]: Start accepts. Automaton has 502 states and 626 transitions. Word has length 59
[2024-10-24 01:48:38,717 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:38,717 INFO  L471      AbstractCegarLoop]: Abstraction has 502 states and 626 transitions.
[2024-10-24 01:48:38,718 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:38,718 INFO  L276                IsEmpty]: Start isEmpty. Operand 502 states and 626 transitions.
[2024-10-24 01:48:38,723 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2024-10-24 01:48:38,723 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:38,723 INFO  L215           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]
[2024-10-24 01:48:38,724 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-24 01:48:38,724 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:38,724 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:38,724 INFO  L85        PathProgramCache]: Analyzing trace with hash -1943729877, now seen corresponding path program 1 times
[2024-10-24 01:48:38,724 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:38,725 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394318001]
[2024-10-24 01:48:38,725 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:38,725 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:38,774 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:38,896 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:38,896 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:38,897 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394318001]
[2024-10-24 01:48:38,897 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394318001] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:38,897 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:38,897 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-24 01:48:38,897 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487389293]
[2024-10-24 01:48:38,898 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:38,899 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-10-24 01:48:38,899 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:38,899 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-10-24 01:48:38,900 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-10-24 01:48:38,900 INFO  L87              Difference]: Start difference. First operand 502 states and 626 transitions. Second operand  has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:39,102 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:39,102 INFO  L93              Difference]: Finished difference Result 600 states and 747 transitions.
[2024-10-24 01:48:39,102 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-10-24 01:48:39,103 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59
[2024-10-24 01:48:39,103 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:39,104 INFO  L225             Difference]: With dead ends: 600
[2024-10-24 01:48:39,104 INFO  L226             Difference]: Without dead ends: 350
[2024-10-24 01:48:39,105 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-10-24 01:48:39,106 INFO  L432           NwaCegarLoop]: 234 mSDtfsCounter, 1240 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:39,106 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 254 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-10-24 01:48:39,107 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 350 states.
[2024-10-24 01:48:39,113 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350.
[2024-10-24 01:48:39,114 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 350 states, 339 states have (on average 1.2772861356932153) internal successors, (433), 349 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:39,114 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 433 transitions.
[2024-10-24 01:48:39,115 INFO  L78                 Accepts]: Start accepts. Automaton has 350 states and 433 transitions. Word has length 59
[2024-10-24 01:48:39,115 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:39,115 INFO  L471      AbstractCegarLoop]: Abstraction has 350 states and 433 transitions.
[2024-10-24 01:48:39,115 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:39,115 INFO  L276                IsEmpty]: Start isEmpty. Operand 350 states and 433 transitions.
[2024-10-24 01:48:39,116 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2024-10-24 01:48:39,116 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:39,116 INFO  L215           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]
[2024-10-24 01:48:39,116 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-24 01:48:39,116 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:39,117 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:39,117 INFO  L85        PathProgramCache]: Analyzing trace with hash -19682530, now seen corresponding path program 1 times
[2024-10-24 01:48:39,117 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:39,117 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496652065]
[2024-10-24 01:48:39,117 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:39,117 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:39,141 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:39,203 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:39,203 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:39,204 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496652065]
[2024-10-24 01:48:39,204 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496652065] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:39,204 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:39,204 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-24 01:48:39,204 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918002581]
[2024-10-24 01:48:39,204 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:39,205 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-10-24 01:48:39,205 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:39,205 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-10-24 01:48:39,205 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-10-24 01:48:39,205 INFO  L87              Difference]: Start difference. First operand 350 states and 433 transitions. Second operand  has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:39,356 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:39,356 INFO  L93              Difference]: Finished difference Result 490 states and 615 transitions.
[2024-10-24 01:48:39,356 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-10-24 01:48:39,357 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59
[2024-10-24 01:48:39,357 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:39,358 INFO  L225             Difference]: With dead ends: 490
[2024-10-24 01:48:39,358 INFO  L226             Difference]: Without dead ends: 301
[2024-10-24 01:48:39,359 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-10-24 01:48:39,359 INFO  L432           NwaCegarLoop]: 215 mSDtfsCounter, 1089 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:39,360 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 219 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-24 01:48:39,361 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 301 states.
[2024-10-24 01:48:39,366 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301.
[2024-10-24 01:48:39,366 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 301 states, 290 states have (on average 1.293103448275862) internal successors, (375), 300 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:39,367 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 375 transitions.
[2024-10-24 01:48:39,367 INFO  L78                 Accepts]: Start accepts. Automaton has 301 states and 375 transitions. Word has length 59
[2024-10-24 01:48:39,367 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:39,367 INFO  L471      AbstractCegarLoop]: Abstraction has 301 states and 375 transitions.
[2024-10-24 01:48:39,367 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:39,368 INFO  L276                IsEmpty]: Start isEmpty. Operand 301 states and 375 transitions.
[2024-10-24 01:48:39,368 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2024-10-24 01:48:39,368 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:39,368 INFO  L215           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]
[2024-10-24 01:48:39,368 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-10-24 01:48:39,369 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:39,369 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:39,369 INFO  L85        PathProgramCache]: Analyzing trace with hash -732780502, now seen corresponding path program 1 times
[2024-10-24 01:48:39,369 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:39,369 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364067001]
[2024-10-24 01:48:39,370 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:39,370 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:39,393 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:39,492 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:39,493 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:39,493 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364067001]
[2024-10-24 01:48:39,493 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364067001] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:39,493 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:39,493 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-24 01:48:39,494 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459407892]
[2024-10-24 01:48:39,494 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:39,494 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-10-24 01:48:39,494 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:39,495 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-10-24 01:48:39,495 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-10-24 01:48:39,495 INFO  L87              Difference]: Start difference. First operand 301 states and 375 transitions. Second operand  has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:39,622 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:39,622 INFO  L93              Difference]: Finished difference Result 423 states and 530 transitions.
[2024-10-24 01:48:39,623 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-10-24 01:48:39,623 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61
[2024-10-24 01:48:39,623 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:39,624 INFO  L225             Difference]: With dead ends: 423
[2024-10-24 01:48:39,624 INFO  L226             Difference]: Without dead ends: 260
[2024-10-24 01:48:39,624 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-10-24 01:48:39,625 INFO  L432           NwaCegarLoop]: 193 mSDtfsCounter, 922 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:39,626 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 205 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-24 01:48:39,626 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 260 states.
[2024-10-24 01:48:39,629 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260.
[2024-10-24 01:48:39,630 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 260 states, 249 states have (on average 1.2971887550200802) internal successors, (323), 259 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:39,630 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 323 transitions.
[2024-10-24 01:48:39,630 INFO  L78                 Accepts]: Start accepts. Automaton has 260 states and 323 transitions. Word has length 61
[2024-10-24 01:48:39,631 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:39,631 INFO  L471      AbstractCegarLoop]: Abstraction has 260 states and 323 transitions.
[2024-10-24 01:48:39,631 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:39,631 INFO  L276                IsEmpty]: Start isEmpty. Operand 260 states and 323 transitions.
[2024-10-24 01:48:39,631 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2024-10-24 01:48:39,631 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:39,631 INFO  L215           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]
[2024-10-24 01:48:39,631 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-10-24 01:48:39,632 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:39,632 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:39,632 INFO  L85        PathProgramCache]: Analyzing trace with hash -1082227329, now seen corresponding path program 1 times
[2024-10-24 01:48:39,632 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:39,633 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012312424]
[2024-10-24 01:48:39,633 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:39,633 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:39,666 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:39,886 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:39,886 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:39,886 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012312424]
[2024-10-24 01:48:39,890 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012312424] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:39,890 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:39,890 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-10-24 01:48:39,890 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722459005]
[2024-10-24 01:48:39,890 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:39,891 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-10-24 01:48:39,891 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:39,891 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-10-24 01:48:39,891 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-10-24 01:48:39,891 INFO  L87              Difference]: Start difference. First operand 260 states and 323 transitions. Second operand  has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:40,252 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:40,252 INFO  L93              Difference]: Finished difference Result 496 states and 633 transitions.
[2024-10-24 01:48:40,252 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-10-24 01:48:40,252 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 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 63
[2024-10-24 01:48:40,253 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:40,254 INFO  L225             Difference]: With dead ends: 496
[2024-10-24 01:48:40,254 INFO  L226             Difference]: Without dead ends: 404
[2024-10-24 01:48:40,254 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210
[2024-10-24 01:48:40,255 INFO  L432           NwaCegarLoop]: 194 mSDtfsCounter, 958 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:40,255 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 846 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-24 01:48:40,256 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 404 states.
[2024-10-24 01:48:40,259 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 260.
[2024-10-24 01:48:40,259 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 260 states, 249 states have (on average 1.2931726907630523) internal successors, (322), 259 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:40,260 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 322 transitions.
[2024-10-24 01:48:40,260 INFO  L78                 Accepts]: Start accepts. Automaton has 260 states and 322 transitions. Word has length 63
[2024-10-24 01:48:40,260 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:40,260 INFO  L471      AbstractCegarLoop]: Abstraction has 260 states and 322 transitions.
[2024-10-24 01:48:40,261 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:40,261 INFO  L276                IsEmpty]: Start isEmpty. Operand 260 states and 322 transitions.
[2024-10-24 01:48:40,261 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2024-10-24 01:48:40,261 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:40,261 INFO  L215           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]
[2024-10-24 01:48:40,262 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-10-24 01:48:40,262 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:40,262 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:40,262 INFO  L85        PathProgramCache]: Analyzing trace with hash 1413074335, now seen corresponding path program 1 times
[2024-10-24 01:48:40,262 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:40,262 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953200510]
[2024-10-24 01:48:40,263 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:40,263 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:40,296 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:40,526 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:40,526 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:40,526 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953200510]
[2024-10-24 01:48:40,526 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953200510] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:40,527 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:40,527 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-10-24 01:48:40,529 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034218804]
[2024-10-24 01:48:40,530 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:40,530 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-10-24 01:48:40,530 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:40,530 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-10-24 01:48:40,531 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2024-10-24 01:48:40,531 INFO  L87              Difference]: Start difference. First operand 260 states and 322 transitions. Second operand  has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:40,937 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:40,937 INFO  L93              Difference]: Finished difference Result 468 states and 597 transitions.
[2024-10-24 01:48:40,938 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-10-24 01:48:40,938 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 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 63
[2024-10-24 01:48:40,938 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:40,939 INFO  L225             Difference]: With dead ends: 468
[2024-10-24 01:48:40,940 INFO  L226             Difference]: Without dead ends: 400
[2024-10-24 01:48:40,940 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306
[2024-10-24 01:48:40,941 INFO  L432           NwaCegarLoop]: 221 mSDtfsCounter, 1248 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:40,941 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1248 Valid, 951 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-24 01:48:40,942 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 400 states.
[2024-10-24 01:48:40,944 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 260.
[2024-10-24 01:48:40,945 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 260 states, 249 states have (on average 1.2891566265060241) internal successors, (321), 259 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:40,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 321 transitions.
[2024-10-24 01:48:40,945 INFO  L78                 Accepts]: Start accepts. Automaton has 260 states and 321 transitions. Word has length 63
[2024-10-24 01:48:40,946 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:40,946 INFO  L471      AbstractCegarLoop]: Abstraction has 260 states and 321 transitions.
[2024-10-24 01:48:40,946 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:40,946 INFO  L276                IsEmpty]: Start isEmpty. Operand 260 states and 321 transitions.
[2024-10-24 01:48:40,946 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2024-10-24 01:48:40,947 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:40,947 INFO  L215           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]
[2024-10-24 01:48:40,947 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-10-24 01:48:40,947 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:40,947 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:40,947 INFO  L85        PathProgramCache]: Analyzing trace with hash -1960661089, now seen corresponding path program 1 times
[2024-10-24 01:48:40,948 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:40,948 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60128740]
[2024-10-24 01:48:40,948 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:40,948 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:40,970 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:41,210 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:41,210 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:41,210 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60128740]
[2024-10-24 01:48:41,211 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60128740] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:41,211 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:41,211 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-10-24 01:48:41,211 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291908499]
[2024-10-24 01:48:41,211 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:41,211 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-10-24 01:48:41,211 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:41,212 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-10-24 01:48:41,212 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-10-24 01:48:41,212 INFO  L87              Difference]: Start difference. First operand 260 states and 321 transitions. Second operand  has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:41,620 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:41,621 INFO  L93              Difference]: Finished difference Result 417 states and 519 transitions.
[2024-10-24 01:48:41,621 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-10-24 01:48:41,621 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 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 63
[2024-10-24 01:48:41,621 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:41,623 INFO  L225             Difference]: With dead ends: 417
[2024-10-24 01:48:41,623 INFO  L226             Difference]: Without dead ends: 398
[2024-10-24 01:48:41,623 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306
[2024-10-24 01:48:41,624 INFO  L432           NwaCegarLoop]: 221 mSDtfsCounter, 1295 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:41,624 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 1137 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-24 01:48:41,624 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 398 states.
[2024-10-24 01:48:41,627 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 260.
[2024-10-24 01:48:41,627 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 260 states, 249 states have (on average 1.285140562248996) internal successors, (320), 259 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:41,628 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 320 transitions.
[2024-10-24 01:48:41,628 INFO  L78                 Accepts]: Start accepts. Automaton has 260 states and 320 transitions. Word has length 63
[2024-10-24 01:48:41,628 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:41,628 INFO  L471      AbstractCegarLoop]: Abstraction has 260 states and 320 transitions.
[2024-10-24 01:48:41,628 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:41,629 INFO  L276                IsEmpty]: Start isEmpty. Operand 260 states and 320 transitions.
[2024-10-24 01:48:41,629 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2024-10-24 01:48:41,629 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:41,629 INFO  L215           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]
[2024-10-24 01:48:41,629 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-10-24 01:48:41,629 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:41,630 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:41,630 INFO  L85        PathProgramCache]: Analyzing trace with hash -367822753, now seen corresponding path program 1 times
[2024-10-24 01:48:41,630 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:41,630 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912305236]
[2024-10-24 01:48:41,630 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:41,630 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:41,657 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:41,826 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:41,826 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:41,827 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912305236]
[2024-10-24 01:48:41,827 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912305236] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:41,827 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:41,827 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-24 01:48:41,827 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829016757]
[2024-10-24 01:48:41,827 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:41,827 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-10-24 01:48:41,827 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:41,828 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-10-24 01:48:41,828 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-10-24 01:48:41,828 INFO  L87              Difference]: Start difference. First operand 260 states and 320 transitions. Second operand  has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:42,179 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:42,179 INFO  L93              Difference]: Finished difference Result 515 states and 635 transitions.
[2024-10-24 01:48:42,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-10-24 01:48:42,180 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63
[2024-10-24 01:48:42,180 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:42,181 INFO  L225             Difference]: With dead ends: 515
[2024-10-24 01:48:42,181 INFO  L226             Difference]: Without dead ends: 374
[2024-10-24 01:48:42,182 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132
[2024-10-24 01:48:42,182 INFO  L432           NwaCegarLoop]: 179 mSDtfsCounter, 888 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:42,182 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 823 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-24 01:48:42,183 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 374 states.
[2024-10-24 01:48:42,186 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 260.
[2024-10-24 01:48:42,187 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 260 states, 249 states have (on average 1.2811244979919678) internal successors, (319), 259 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:42,187 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 319 transitions.
[2024-10-24 01:48:42,188 INFO  L78                 Accepts]: Start accepts. Automaton has 260 states and 319 transitions. Word has length 63
[2024-10-24 01:48:42,188 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:42,188 INFO  L471      AbstractCegarLoop]: Abstraction has 260 states and 319 transitions.
[2024-10-24 01:48:42,188 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:42,188 INFO  L276                IsEmpty]: Start isEmpty. Operand 260 states and 319 transitions.
[2024-10-24 01:48:42,189 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2024-10-24 01:48:42,189 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:42,189 INFO  L215           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]
[2024-10-24 01:48:42,189 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-10-24 01:48:42,189 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:42,190 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:42,190 INFO  L85        PathProgramCache]: Analyzing trace with hash 718759200, now seen corresponding path program 1 times
[2024-10-24 01:48:42,193 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:42,193 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553545573]
[2024-10-24 01:48:42,193 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:42,194 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:42,238 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:42,470 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:42,471 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:42,471 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553545573]
[2024-10-24 01:48:42,474 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553545573] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:42,475 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:42,475 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-10-24 01:48:42,475 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985021704]
[2024-10-24 01:48:42,475 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:42,476 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-10-24 01:48:42,476 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:42,476 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-10-24 01:48:42,476 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2024-10-24 01:48:42,477 INFO  L87              Difference]: Start difference. First operand 260 states and 319 transitions. Second operand  has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:42,893 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:42,893 INFO  L93              Difference]: Finished difference Result 449 states and 565 transitions.
[2024-10-24 01:48:42,894 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-10-24 01:48:42,894 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64
[2024-10-24 01:48:42,894 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:42,895 INFO  L225             Difference]: With dead ends: 449
[2024-10-24 01:48:42,895 INFO  L226             Difference]: Without dead ends: 392
[2024-10-24 01:48:42,895 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306
[2024-10-24 01:48:42,896 INFO  L432           NwaCegarLoop]: 211 mSDtfsCounter, 1245 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:42,896 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 895 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-24 01:48:42,897 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 392 states.
[2024-10-24 01:48:42,899 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 260.
[2024-10-24 01:48:42,899 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 260 states, 249 states have (on average 1.2771084337349397) internal successors, (318), 259 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:42,900 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 318 transitions.
[2024-10-24 01:48:42,900 INFO  L78                 Accepts]: Start accepts. Automaton has 260 states and 318 transitions. Word has length 64
[2024-10-24 01:48:42,900 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:42,900 INFO  L471      AbstractCegarLoop]: Abstraction has 260 states and 318 transitions.
[2024-10-24 01:48:42,900 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:42,900 INFO  L276                IsEmpty]: Start isEmpty. Operand 260 states and 318 transitions.
[2024-10-24 01:48:42,901 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2024-10-24 01:48:42,901 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:42,901 INFO  L215           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]
[2024-10-24 01:48:42,901 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-10-24 01:48:42,901 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:42,902 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:42,902 INFO  L85        PathProgramCache]: Analyzing trace with hash -1508275324, now seen corresponding path program 1 times
[2024-10-24 01:48:42,902 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:42,902 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957167647]
[2024-10-24 01:48:42,902 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:42,902 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:42,926 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:43,066 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:43,067 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:43,067 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957167647]
[2024-10-24 01:48:43,067 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957167647] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:43,067 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:43,067 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-10-24 01:48:43,067 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490784476]
[2024-10-24 01:48:43,067 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:43,067 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-10-24 01:48:43,067 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:43,068 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-10-24 01:48:43,068 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2024-10-24 01:48:43,068 INFO  L87              Difference]: Start difference. First operand 260 states and 318 transitions. Second operand  has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:43,480 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:43,480 INFO  L93              Difference]: Finished difference Result 398 states and 487 transitions.
[2024-10-24 01:48:43,480 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-10-24 01:48:43,480 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 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 65
[2024-10-24 01:48:43,480 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:43,482 INFO  L225             Difference]: With dead ends: 398
[2024-10-24 01:48:43,482 INFO  L226             Difference]: Without dead ends: 392
[2024-10-24 01:48:43,482 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306
[2024-10-24 01:48:43,482 INFO  L432           NwaCegarLoop]: 211 mSDtfsCounter, 1240 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:43,482 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 895 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-24 01:48:43,483 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 392 states.
[2024-10-24 01:48:43,485 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 260.
[2024-10-24 01:48:43,486 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 260 states, 249 states have (on average 1.2730923694779117) internal successors, (317), 259 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:43,486 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 317 transitions.
[2024-10-24 01:48:43,486 INFO  L78                 Accepts]: Start accepts. Automaton has 260 states and 317 transitions. Word has length 65
[2024-10-24 01:48:43,487 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:43,487 INFO  L471      AbstractCegarLoop]: Abstraction has 260 states and 317 transitions.
[2024-10-24 01:48:43,487 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:43,487 INFO  L276                IsEmpty]: Start isEmpty. Operand 260 states and 317 transitions.
[2024-10-24 01:48:43,487 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2024-10-24 01:48:43,487 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:43,487 INFO  L215           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]
[2024-10-24 01:48:43,488 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-10-24 01:48:43,488 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:43,488 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:43,488 INFO  L85        PathProgramCache]: Analyzing trace with hash 1207057476, now seen corresponding path program 1 times
[2024-10-24 01:48:43,488 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:43,488 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138481860]
[2024-10-24 01:48:43,488 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:43,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:43,517 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:43,785 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:43,785 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:43,785 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138481860]
[2024-10-24 01:48:43,785 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138481860] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:43,785 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:43,785 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-10-24 01:48:43,785 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509996912]
[2024-10-24 01:48:43,785 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:43,785 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-10-24 01:48:43,786 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:43,786 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-10-24 01:48:43,786 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-10-24 01:48:43,786 INFO  L87              Difference]: Start difference. First operand 260 states and 317 transitions. Second operand  has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:44,414 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:44,415 INFO  L93              Difference]: Finished difference Result 556 states and 708 transitions.
[2024-10-24 01:48:44,415 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2024-10-24 01:48:44,415 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 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 65
[2024-10-24 01:48:44,415 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:44,417 INFO  L225             Difference]: With dead ends: 556
[2024-10-24 01:48:44,417 INFO  L226             Difference]: Without dead ends: 458
[2024-10-24 01:48:44,417 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552
[2024-10-24 01:48:44,418 INFO  L432           NwaCegarLoop]: 277 mSDtfsCounter, 1263 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:44,418 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1263 Valid, 1667 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-10-24 01:48:44,419 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 458 states.
[2024-10-24 01:48:44,421 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 260.
[2024-10-24 01:48:44,422 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 260 states, 249 states have (on average 1.2690763052208835) internal successors, (316), 259 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:44,422 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 316 transitions.
[2024-10-24 01:48:44,422 INFO  L78                 Accepts]: Start accepts. Automaton has 260 states and 316 transitions. Word has length 65
[2024-10-24 01:48:44,422 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:44,423 INFO  L471      AbstractCegarLoop]: Abstraction has 260 states and 316 transitions.
[2024-10-24 01:48:44,423 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:44,423 INFO  L276                IsEmpty]: Start isEmpty. Operand 260 states and 316 transitions.
[2024-10-24 01:48:44,423 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2024-10-24 01:48:44,423 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:44,423 INFO  L215           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]
[2024-10-24 01:48:44,424 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-10-24 01:48:44,424 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:44,424 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:44,424 INFO  L85        PathProgramCache]: Analyzing trace with hash 1230734052, now seen corresponding path program 1 times
[2024-10-24 01:48:44,424 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:44,424 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054106029]
[2024-10-24 01:48:44,424 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:44,425 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:44,447 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:44,604 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:44,604 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:44,604 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054106029]
[2024-10-24 01:48:44,605 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054106029] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:44,605 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:44,605 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-10-24 01:48:44,605 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591825075]
[2024-10-24 01:48:44,605 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:44,605 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-10-24 01:48:44,605 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:44,606 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-10-24 01:48:44,606 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2024-10-24 01:48:44,606 INFO  L87              Difference]: Start difference. First operand 260 states and 316 transitions. Second operand  has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:44,968 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:44,968 INFO  L93              Difference]: Finished difference Result 452 states and 565 transitions.
[2024-10-24 01:48:44,968 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-10-24 01:48:44,969 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 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 65
[2024-10-24 01:48:44,969 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:44,970 INFO  L225             Difference]: With dead ends: 452
[2024-10-24 01:48:44,970 INFO  L226             Difference]: Without dead ends: 392
[2024-10-24 01:48:44,970 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306
[2024-10-24 01:48:44,971 INFO  L432           NwaCegarLoop]: 211 mSDtfsCounter, 1233 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1233 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:44,971 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 895 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-24 01:48:44,972 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 392 states.
[2024-10-24 01:48:44,974 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 260.
[2024-10-24 01:48:44,974 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 260 states, 249 states have (on average 1.2650602409638554) internal successors, (315), 259 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:44,975 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 315 transitions.
[2024-10-24 01:48:44,975 INFO  L78                 Accepts]: Start accepts. Automaton has 260 states and 315 transitions. Word has length 65
[2024-10-24 01:48:44,975 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:44,975 INFO  L471      AbstractCegarLoop]: Abstraction has 260 states and 315 transitions.
[2024-10-24 01:48:44,975 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:44,975 INFO  L276                IsEmpty]: Start isEmpty. Operand 260 states and 315 transitions.
[2024-10-24 01:48:44,976 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2024-10-24 01:48:44,976 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:44,976 INFO  L215           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]
[2024-10-24 01:48:44,976 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-10-24 01:48:44,976 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:44,976 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:44,977 INFO  L85        PathProgramCache]: Analyzing trace with hash -873801820, now seen corresponding path program 1 times
[2024-10-24 01:48:44,977 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:44,977 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870152958]
[2024-10-24 01:48:44,977 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:44,977 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:44,998 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:45,252 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:45,253 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:45,253 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870152958]
[2024-10-24 01:48:45,253 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870152958] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:45,253 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:45,253 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-10-24 01:48:45,253 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324242856]
[2024-10-24 01:48:45,253 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:45,254 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-10-24 01:48:45,254 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:45,254 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-10-24 01:48:45,254 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2024-10-24 01:48:45,254 INFO  L87              Difference]: Start difference. First operand 260 states and 315 transitions. Second operand  has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:46,025 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:46,025 INFO  L93              Difference]: Finished difference Result 655 states and 858 transitions.
[2024-10-24 01:48:46,025 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2024-10-24 01:48:46,026 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 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 65
[2024-10-24 01:48:46,026 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:46,029 INFO  L225             Difference]: With dead ends: 655
[2024-10-24 01:48:46,031 INFO  L226             Difference]: Without dead ends: 582
[2024-10-24 01:48:46,031 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650
[2024-10-24 01:48:46,032 INFO  L432           NwaCegarLoop]: 244 mSDtfsCounter, 2810 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2810 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:46,032 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [2810 Valid, 1120 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-10-24 01:48:46,033 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 582 states.
[2024-10-24 01:48:46,039 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 265.
[2024-10-24 01:48:46,041 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 265 states, 254 states have (on average 1.2598425196850394) internal successors, (320), 264 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:46,042 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 320 transitions.
[2024-10-24 01:48:46,042 INFO  L78                 Accepts]: Start accepts. Automaton has 265 states and 320 transitions. Word has length 65
[2024-10-24 01:48:46,042 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:46,042 INFO  L471      AbstractCegarLoop]: Abstraction has 265 states and 320 transitions.
[2024-10-24 01:48:46,042 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:46,042 INFO  L276                IsEmpty]: Start isEmpty. Operand 265 states and 320 transitions.
[2024-10-24 01:48:46,043 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2024-10-24 01:48:46,044 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:46,044 INFO  L215           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]
[2024-10-24 01:48:46,044 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-10-24 01:48:46,044 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:46,045 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:46,045 INFO  L85        PathProgramCache]: Analyzing trace with hash -1099115196, now seen corresponding path program 1 times
[2024-10-24 01:48:46,045 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:46,045 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3401038]
[2024-10-24 01:48:46,046 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:46,046 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:46,064 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:46,201 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:46,201 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:46,201 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3401038]
[2024-10-24 01:48:46,201 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3401038] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:46,202 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:46,202 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-10-24 01:48:46,202 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090443538]
[2024-10-24 01:48:46,202 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:46,202 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-10-24 01:48:46,202 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:46,203 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-10-24 01:48:46,203 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-10-24 01:48:46,203 INFO  L87              Difference]: Start difference. First operand 265 states and 320 transitions. Second operand  has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:46,551 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:46,551 INFO  L93              Difference]: Finished difference Result 403 states and 489 transitions.
[2024-10-24 01:48:46,552 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2024-10-24 01:48:46,552 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 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 65
[2024-10-24 01:48:46,552 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:46,553 INFO  L225             Difference]: With dead ends: 403
[2024-10-24 01:48:46,553 INFO  L226             Difference]: Without dead ends: 397
[2024-10-24 01:48:46,554 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306
[2024-10-24 01:48:46,554 INFO  L432           NwaCegarLoop]: 208 mSDtfsCounter, 1228 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:46,554 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 880 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-24 01:48:46,555 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 397 states.
[2024-10-24 01:48:46,558 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 265.
[2024-10-24 01:48:46,559 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 265 states, 254 states have (on average 1.2559055118110236) internal successors, (319), 264 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:46,560 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 319 transitions.
[2024-10-24 01:48:46,560 INFO  L78                 Accepts]: Start accepts. Automaton has 265 states and 319 transitions. Word has length 65
[2024-10-24 01:48:46,560 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:46,560 INFO  L471      AbstractCegarLoop]: Abstraction has 265 states and 319 transitions.
[2024-10-24 01:48:46,560 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:46,560 INFO  L276                IsEmpty]: Start isEmpty. Operand 265 states and 319 transitions.
[2024-10-24 01:48:46,561 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2024-10-24 01:48:46,561 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:46,561 INFO  L215           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]
[2024-10-24 01:48:46,561 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-10-24 01:48:46,561 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:46,561 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:46,561 INFO  L85        PathProgramCache]: Analyzing trace with hash 106808155, now seen corresponding path program 1 times
[2024-10-24 01:48:46,562 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:46,562 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11657356]
[2024-10-24 01:48:46,562 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:46,562 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:46,595 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:47,198 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:47,198 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:47,198 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11657356]
[2024-10-24 01:48:47,199 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11657356] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:47,199 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:47,199 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-10-24 01:48:47,199 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212439273]
[2024-10-24 01:48:47,199 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:47,199 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-10-24 01:48:47,199 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:47,200 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-10-24 01:48:47,200 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2024-10-24 01:48:47,200 INFO  L87              Difference]: Start difference. First operand 265 states and 319 transitions. Second operand  has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:47,688 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:47,688 INFO  L93              Difference]: Finished difference Result 452 states and 569 transitions.
[2024-10-24 01:48:47,689 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-10-24 01:48:47,689 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 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 66
[2024-10-24 01:48:47,689 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:47,690 INFO  L225             Difference]: With dead ends: 452
[2024-10-24 01:48:47,690 INFO  L226             Difference]: Without dead ends: 386
[2024-10-24 01:48:47,690 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420
[2024-10-24 01:48:47,691 INFO  L432           NwaCegarLoop]: 374 mSDtfsCounter, 1240 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:47,691 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 1905 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-10-24 01:48:47,692 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 386 states.
[2024-10-24 01:48:47,694 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 253.
[2024-10-24 01:48:47,694 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 253 states, 243 states have (on average 1.2551440329218106) internal successors, (305), 252 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:47,695 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 305 transitions.
[2024-10-24 01:48:47,695 INFO  L78                 Accepts]: Start accepts. Automaton has 253 states and 305 transitions. Word has length 66
[2024-10-24 01:48:47,695 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:47,695 INFO  L471      AbstractCegarLoop]: Abstraction has 253 states and 305 transitions.
[2024-10-24 01:48:47,695 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:47,695 INFO  L276                IsEmpty]: Start isEmpty. Operand 253 states and 305 transitions.
[2024-10-24 01:48:47,696 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2024-10-24 01:48:47,696 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:47,696 INFO  L215           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]
[2024-10-24 01:48:47,696 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-10-24 01:48:47,696 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:47,697 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:47,697 INFO  L85        PathProgramCache]: Analyzing trace with hash -543233893, now seen corresponding path program 1 times
[2024-10-24 01:48:47,697 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:47,697 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956315559]
[2024-10-24 01:48:47,697 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:47,697 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:47,738 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:48,333 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:48,334 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:48,334 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956315559]
[2024-10-24 01:48:48,334 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956315559] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:48,334 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:48,334 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-10-24 01:48:48,338 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158675658]
[2024-10-24 01:48:48,338 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:48,339 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-10-24 01:48:48,339 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:48,339 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-10-24 01:48:48,339 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-10-24 01:48:48,339 INFO  L87              Difference]: Start difference. First operand 253 states and 305 transitions. Second operand  has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:48,785 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:48,785 INFO  L93              Difference]: Finished difference Result 387 states and 487 transitions.
[2024-10-24 01:48:48,785 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-10-24 01:48:48,786 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 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 66
[2024-10-24 01:48:48,786 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:48,786 INFO  L225             Difference]: With dead ends: 387
[2024-10-24 01:48:48,790 INFO  L226             Difference]: Without dead ends: 258
[2024-10-24 01:48:48,791 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272
[2024-10-24 01:48:48,791 INFO  L432           NwaCegarLoop]: 179 mSDtfsCounter, 1066 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:48,791 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 905 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-10-24 01:48:48,792 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 258 states.
[2024-10-24 01:48:48,793 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 178.
[2024-10-24 01:48:48,794 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 178 states, 172 states have (on average 1.25) internal successors, (215), 177 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:48,797 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 215 transitions.
[2024-10-24 01:48:48,798 INFO  L78                 Accepts]: Start accepts. Automaton has 178 states and 215 transitions. Word has length 66
[2024-10-24 01:48:48,798 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:48,798 INFO  L471      AbstractCegarLoop]: Abstraction has 178 states and 215 transitions.
[2024-10-24 01:48:48,798 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:48,798 INFO  L276                IsEmpty]: Start isEmpty. Operand 178 states and 215 transitions.
[2024-10-24 01:48:48,799 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2024-10-24 01:48:48,799 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:48,799 INFO  L215           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]
[2024-10-24 01:48:48,799 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-10-24 01:48:48,799 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:48,799 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:48,800 INFO  L85        PathProgramCache]: Analyzing trace with hash 1410161897, now seen corresponding path program 1 times
[2024-10-24 01:48:48,800 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:48,800 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44428500]
[2024-10-24 01:48:48,800 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:48,800 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:48,827 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:49,421 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:49,421 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:49,421 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44428500]
[2024-10-24 01:48:49,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44428500] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:49,422 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:49,422 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2024-10-24 01:48:49,422 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809925997]
[2024-10-24 01:48:49,422 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:49,422 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-10-24 01:48:49,422 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:49,423 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-10-24 01:48:49,423 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240
[2024-10-24 01:48:49,423 INFO  L87              Difference]: Start difference. First operand 178 states and 215 transitions. Second operand  has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:50,452 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:50,452 INFO  L93              Difference]: Finished difference Result 449 states and 571 transitions.
[2024-10-24 01:48:50,453 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2024-10-24 01:48:50,453 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 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 67
[2024-10-24 01:48:50,453 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:50,454 INFO  L225             Difference]: With dead ends: 449
[2024-10-24 01:48:50,454 INFO  L226             Difference]: Without dead ends: 391
[2024-10-24 01:48:50,455 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=204, Invalid=608, Unknown=0, NotChecked=0, Total=812
[2024-10-24 01:48:50,455 INFO  L432           NwaCegarLoop]: 174 mSDtfsCounter, 1502 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:50,456 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 1998 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-10-24 01:48:50,456 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 391 states.
[2024-10-24 01:48:50,458 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 196.
[2024-10-24 01:48:50,458 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 196 states, 190 states have (on average 1.263157894736842) internal successors, (240), 195 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:50,459 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 240 transitions.
[2024-10-24 01:48:50,459 INFO  L78                 Accepts]: Start accepts. Automaton has 196 states and 240 transitions. Word has length 67
[2024-10-24 01:48:50,459 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:50,459 INFO  L471      AbstractCegarLoop]: Abstraction has 196 states and 240 transitions.
[2024-10-24 01:48:50,459 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:50,460 INFO  L276                IsEmpty]: Start isEmpty. Operand 196 states and 240 transitions.
[2024-10-24 01:48:50,460 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2024-10-24 01:48:50,460 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:50,460 INFO  L215           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]
[2024-10-24 01:48:50,460 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-10-24 01:48:50,460 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:50,461 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:50,461 INFO  L85        PathProgramCache]: Analyzing trace with hash 866774441, now seen corresponding path program 1 times
[2024-10-24 01:48:50,461 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:50,461 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989297681]
[2024-10-24 01:48:50,461 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:50,461 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:50,485 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:50,822 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:50,822 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:50,822 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989297681]
[2024-10-24 01:48:50,822 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989297681] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:50,822 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:50,822 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-10-24 01:48:50,823 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125600236]
[2024-10-24 01:48:50,823 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:50,823 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-10-24 01:48:50,823 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:50,823 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-10-24 01:48:50,824 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2024-10-24 01:48:50,824 INFO  L87              Difference]: Start difference. First operand 196 states and 240 transitions. Second operand  has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:51,233 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:51,233 INFO  L93              Difference]: Finished difference Result 280 states and 350 transitions.
[2024-10-24 01:48:51,234 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-10-24 01:48:51,234 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 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 67
[2024-10-24 01:48:51,234 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:51,235 INFO  L225             Difference]: With dead ends: 280
[2024-10-24 01:48:51,235 INFO  L226             Difference]: Without dead ends: 256
[2024-10-24 01:48:51,235 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506
[2024-10-24 01:48:51,235 INFO  L432           NwaCegarLoop]: 207 mSDtfsCounter, 1030 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:51,235 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 1221 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-24 01:48:51,236 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 256 states.
[2024-10-24 01:48:51,241 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 172.
[2024-10-24 01:48:51,241 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 172 states, 168 states have (on average 1.2619047619047619) internal successors, (212), 171 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:51,242 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 212 transitions.
[2024-10-24 01:48:51,242 INFO  L78                 Accepts]: Start accepts. Automaton has 172 states and 212 transitions. Word has length 67
[2024-10-24 01:48:51,242 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:51,242 INFO  L471      AbstractCegarLoop]: Abstraction has 172 states and 212 transitions.
[2024-10-24 01:48:51,242 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:51,242 INFO  L276                IsEmpty]: Start isEmpty. Operand 172 states and 212 transitions.
[2024-10-24 01:48:51,243 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2024-10-24 01:48:51,243 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:51,243 INFO  L215           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]
[2024-10-24 01:48:51,243 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-10-24 01:48:51,244 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:51,244 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:51,244 INFO  L85        PathProgramCache]: Analyzing trace with hash 1327929860, now seen corresponding path program 1 times
[2024-10-24 01:48:51,244 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:51,244 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230802341]
[2024-10-24 01:48:51,244 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:51,245 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:51,274 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:52,221 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:52,222 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:52,222 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230802341]
[2024-10-24 01:48:52,222 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230802341] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:52,222 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:52,222 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19
[2024-10-24 01:48:52,222 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726516496]
[2024-10-24 01:48:52,223 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:52,223 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2024-10-24 01:48:52,223 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:52,224 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2024-10-24 01:48:52,225 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380
[2024-10-24 01:48:52,225 INFO  L87              Difference]: Start difference. First operand 172 states and 212 transitions. Second operand  has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:54,129 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:54,129 INFO  L93              Difference]: Finished difference Result 538 states and 719 transitions.
[2024-10-24 01:48:54,129 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2024-10-24 01:48:54,130 INFO  L78                 Accepts]: Start accepts. Automaton has  has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 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 68
[2024-10-24 01:48:54,130 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:54,131 INFO  L225             Difference]: With dead ends: 538
[2024-10-24 01:48:54,131 INFO  L226             Difference]: Without dead ends: 480
[2024-10-24 01:48:54,132 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=282, Invalid=1200, Unknown=0, NotChecked=0, Total=1482
[2024-10-24 01:48:54,132 INFO  L432           NwaCegarLoop]: 245 mSDtfsCounter, 1680 mSDsluCounter, 3022 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1680 SdHoareTripleChecker+Valid, 3267 SdHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:54,133 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1680 Valid, 3267 Invalid, 1667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2024-10-24 01:48:54,133 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 480 states.
[2024-10-24 01:48:54,136 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 172.
[2024-10-24 01:48:54,136 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 172 states, 168 states have (on average 1.2619047619047619) internal successors, (212), 171 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:54,136 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 212 transitions.
[2024-10-24 01:48:54,136 INFO  L78                 Accepts]: Start accepts. Automaton has 172 states and 212 transitions. Word has length 68
[2024-10-24 01:48:54,137 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:54,137 INFO  L471      AbstractCegarLoop]: Abstraction has 172 states and 212 transitions.
[2024-10-24 01:48:54,137 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:54,137 INFO  L276                IsEmpty]: Start isEmpty. Operand 172 states and 212 transitions.
[2024-10-24 01:48:54,137 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2024-10-24 01:48:54,137 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:54,137 INFO  L215           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]
[2024-10-24 01:48:54,137 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-10-24 01:48:54,138 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:54,138 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:54,138 INFO  L85        PathProgramCache]: Analyzing trace with hash -2145891223, now seen corresponding path program 1 times
[2024-10-24 01:48:54,138 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:54,138 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446550937]
[2024-10-24 01:48:54,138 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:54,138 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:54,156 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:54,307 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:54,308 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:54,308 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446550937]
[2024-10-24 01:48:54,308 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446550937] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:54,308 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:54,308 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-10-24 01:48:54,308 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888158442]
[2024-10-24 01:48:54,308 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:54,309 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-10-24 01:48:54,309 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:54,309 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-10-24 01:48:54,309 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-10-24 01:48:54,310 INFO  L87              Difference]: Start difference. First operand 172 states and 212 transitions. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:54,535 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:54,535 INFO  L93              Difference]: Finished difference Result 257 states and 323 transitions.
[2024-10-24 01:48:54,535 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-10-24 01:48:54,536 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 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 69
[2024-10-24 01:48:54,536 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:54,536 INFO  L225             Difference]: With dead ends: 257
[2024-10-24 01:48:54,536 INFO  L226             Difference]: Without dead ends: 249
[2024-10-24 01:48:54,537 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272
[2024-10-24 01:48:54,537 INFO  L432           NwaCegarLoop]: 112 mSDtfsCounter, 765 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:54,538 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 473 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-24 01:48:54,538 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 249 states.
[2024-10-24 01:48:54,539 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 172.
[2024-10-24 01:48:54,540 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 172 states, 168 states have (on average 1.25) internal successors, (210), 171 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:54,540 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 210 transitions.
[2024-10-24 01:48:54,540 INFO  L78                 Accepts]: Start accepts. Automaton has 172 states and 210 transitions. Word has length 69
[2024-10-24 01:48:54,540 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:54,541 INFO  L471      AbstractCegarLoop]: Abstraction has 172 states and 210 transitions.
[2024-10-24 01:48:54,541 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:54,541 INFO  L276                IsEmpty]: Start isEmpty. Operand 172 states and 210 transitions.
[2024-10-24 01:48:54,541 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2024-10-24 01:48:54,541 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:54,541 INFO  L215           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]
[2024-10-24 01:48:54,541 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-10-24 01:48:54,542 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:54,542 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:54,542 INFO  L85        PathProgramCache]: Analyzing trace with hash -535879959, now seen corresponding path program 1 times
[2024-10-24 01:48:54,542 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:54,542 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679861870]
[2024-10-24 01:48:54,542 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:54,542 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:54,562 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:54,687 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:54,688 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:54,688 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679861870]
[2024-10-24 01:48:54,688 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679861870] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:54,688 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:54,688 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-10-24 01:48:54,688 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661981973]
[2024-10-24 01:48:54,688 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:54,688 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-10-24 01:48:54,688 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:54,689 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-10-24 01:48:54,689 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-10-24 01:48:54,689 INFO  L87              Difference]: Start difference. First operand 172 states and 210 transitions. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:54,915 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:54,915 INFO  L93              Difference]: Finished difference Result 343 states and 438 transitions.
[2024-10-24 01:48:54,915 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-10-24 01:48:54,915 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 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 69
[2024-10-24 01:48:54,916 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:54,916 INFO  L225             Difference]: With dead ends: 343
[2024-10-24 01:48:54,916 INFO  L226             Difference]: Without dead ends: 269
[2024-10-24 01:48:54,917 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210
[2024-10-24 01:48:54,917 INFO  L432           NwaCegarLoop]: 150 mSDtfsCounter, 536 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:54,917 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 607 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-10-24 01:48:54,918 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 269 states.
[2024-10-24 01:48:54,919 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 172.
[2024-10-24 01:48:54,920 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 172 states, 168 states have (on average 1.2380952380952381) internal successors, (208), 171 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:54,920 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 208 transitions.
[2024-10-24 01:48:54,920 INFO  L78                 Accepts]: Start accepts. Automaton has 172 states and 208 transitions. Word has length 69
[2024-10-24 01:48:54,920 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:54,920 INFO  L471      AbstractCegarLoop]: Abstraction has 172 states and 208 transitions.
[2024-10-24 01:48:54,921 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:54,921 INFO  L276                IsEmpty]: Start isEmpty. Operand 172 states and 208 transitions.
[2024-10-24 01:48:54,921 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2024-10-24 01:48:54,921 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:54,921 INFO  L215           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]
[2024-10-24 01:48:54,921 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-10-24 01:48:54,922 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:54,922 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:54,922 INFO  L85        PathProgramCache]: Analyzing trace with hash 226090286, now seen corresponding path program 1 times
[2024-10-24 01:48:54,922 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:54,922 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287398262]
[2024-10-24 01:48:54,922 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:54,922 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:54,942 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:55,577 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:55,577 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:55,577 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287398262]
[2024-10-24 01:48:55,577 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287398262] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:55,577 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:55,578 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2024-10-24 01:48:55,578 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521454011]
[2024-10-24 01:48:55,578 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:55,578 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2024-10-24 01:48:55,578 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:55,579 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2024-10-24 01:48:55,579 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272
[2024-10-24 01:48:55,579 INFO  L87              Difference]: Start difference. First operand 172 states and 208 transitions. Second operand  has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 16 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:56,864 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:56,864 INFO  L93              Difference]: Finished difference Result 527 states and 698 transitions.
[2024-10-24 01:48:56,865 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2024-10-24 01:48:56,865 INFO  L78                 Accepts]: Start accepts. Automaton has  has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 16 states have internal predecessors, (69), 0 states have call successors, (0), 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 69
[2024-10-24 01:48:56,865 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:56,866 INFO  L225             Difference]: With dead ends: 527
[2024-10-24 01:48:56,866 INFO  L226             Difference]: Without dead ends: 452
[2024-10-24 01:48:56,867 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=300, Invalid=1106, Unknown=0, NotChecked=0, Total=1406
[2024-10-24 01:48:56,868 INFO  L432           NwaCegarLoop]: 364 mSDtfsCounter, 1747 mSDsluCounter, 2410 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1747 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:56,868 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1747 Valid, 2774 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-10-24 01:48:56,869 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 452 states.
[2024-10-24 01:48:56,871 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 137.
[2024-10-24 01:48:56,871 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 137 states, 135 states have (on average 1.237037037037037) internal successors, (167), 136 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:56,871 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 167 transitions.
[2024-10-24 01:48:56,871 INFO  L78                 Accepts]: Start accepts. Automaton has 137 states and 167 transitions. Word has length 69
[2024-10-24 01:48:56,871 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:56,872 INFO  L471      AbstractCegarLoop]: Abstraction has 137 states and 167 transitions.
[2024-10-24 01:48:56,872 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 16 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:56,872 INFO  L276                IsEmpty]: Start isEmpty. Operand 137 states and 167 transitions.
[2024-10-24 01:48:56,872 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2024-10-24 01:48:56,872 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:56,872 INFO  L215           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]
[2024-10-24 01:48:56,872 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-10-24 01:48:56,873 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:56,873 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:56,873 INFO  L85        PathProgramCache]: Analyzing trace with hash 134483598, now seen corresponding path program 1 times
[2024-10-24 01:48:56,873 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:56,873 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882446144]
[2024-10-24 01:48:56,873 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:56,873 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:56,896 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:57,744 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:57,744 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:57,744 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882446144]
[2024-10-24 01:48:57,744 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882446144] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:57,745 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:57,745 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22
[2024-10-24 01:48:57,745 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266843755]
[2024-10-24 01:48:57,745 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:57,745 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2024-10-24 01:48:57,745 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:57,745 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2024-10-24 01:48:57,746 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506
[2024-10-24 01:48:57,746 INFO  L87              Difference]: Start difference. First operand 137 states and 167 transitions. Second operand  has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:59,283 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:48:59,283 INFO  L93              Difference]: Finished difference Result 465 states and 607 transitions.
[2024-10-24 01:48:59,283 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2024-10-24 01:48:59,284 INFO  L78                 Accepts]: Start accepts. Automaton has  has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 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 71
[2024-10-24 01:48:59,284 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:48:59,285 INFO  L225             Difference]: With dead ends: 465
[2024-10-24 01:48:59,285 INFO  L226             Difference]: Without dead ends: 459
[2024-10-24 01:48:59,285 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=266, Invalid=1294, Unknown=0, NotChecked=0, Total=1560
[2024-10-24 01:48:59,286 INFO  L432           NwaCegarLoop]: 388 mSDtfsCounter, 920 mSDsluCounter, 4001 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 4389 SdHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-10-24 01:48:59,286 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 4389 Invalid, 2040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-10-24 01:48:59,287 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 459 states.
[2024-10-24 01:48:59,289 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 156.
[2024-10-24 01:48:59,290 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 156 states, 154 states have (on average 1.2337662337662338) internal successors, (190), 155 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:59,290 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 190 transitions.
[2024-10-24 01:48:59,290 INFO  L78                 Accepts]: Start accepts. Automaton has 156 states and 190 transitions. Word has length 71
[2024-10-24 01:48:59,290 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:48:59,290 INFO  L471      AbstractCegarLoop]: Abstraction has 156 states and 190 transitions.
[2024-10-24 01:48:59,291 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:48:59,291 INFO  L276                IsEmpty]: Start isEmpty. Operand 156 states and 190 transitions.
[2024-10-24 01:48:59,291 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2024-10-24 01:48:59,291 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:48:59,291 INFO  L215           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]
[2024-10-24 01:48:59,292 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-10-24 01:48:59,292 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:48:59,292 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:48:59,292 INFO  L85        PathProgramCache]: Analyzing trace with hash -1358946869, now seen corresponding path program 1 times
[2024-10-24 01:48:59,292 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:48:59,292 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956884039]
[2024-10-24 01:48:59,293 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:48:59,293 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:48:59,324 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:48:59,958 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:48:59,959 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:48:59,959 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956884039]
[2024-10-24 01:48:59,959 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956884039] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:48:59,959 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:48:59,959 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2024-10-24 01:48:59,959 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146652578]
[2024-10-24 01:48:59,959 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:48:59,959 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-10-24 01:48:59,960 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:48:59,960 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-10-24 01:48:59,960 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240
[2024-10-24 01:48:59,960 INFO  L87              Difference]: Start difference. First operand 156 states and 190 transitions. Second operand  has 16 states, 16 states have (on average 4.5) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:00,993 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:49:00,993 INFO  L93              Difference]: Finished difference Result 321 states and 413 transitions.
[2024-10-24 01:49:00,994 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2024-10-24 01:49:00,994 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 4.5) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 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 72
[2024-10-24 01:49:00,994 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:49:00,995 INFO  L225             Difference]: With dead ends: 321
[2024-10-24 01:49:00,995 INFO  L226             Difference]: Without dead ends: 315
[2024-10-24 01:49:00,996 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930
[2024-10-24 01:49:00,997 INFO  L432           NwaCegarLoop]: 202 mSDtfsCounter, 876 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-10-24 01:49:00,997 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 1756 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-10-24 01:49:00,998 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 315 states.
[2024-10-24 01:49:00,999 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 158.
[2024-10-24 01:49:01,000 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 158 states, 156 states have (on average 1.2307692307692308) internal successors, (192), 157 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:01,000 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 192 transitions.
[2024-10-24 01:49:01,000 INFO  L78                 Accepts]: Start accepts. Automaton has 158 states and 192 transitions. Word has length 72
[2024-10-24 01:49:01,000 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:49:01,000 INFO  L471      AbstractCegarLoop]: Abstraction has 158 states and 192 transitions.
[2024-10-24 01:49:01,001 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 4.5) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:01,001 INFO  L276                IsEmpty]: Start isEmpty. Operand 158 states and 192 transitions.
[2024-10-24 01:49:01,001 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2024-10-24 01:49:01,001 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:49:01,001 INFO  L215           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]
[2024-10-24 01:49:01,001 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-10-24 01:49:01,001 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:49:01,002 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:49:01,002 INFO  L85        PathProgramCache]: Analyzing trace with hash 733169193, now seen corresponding path program 1 times
[2024-10-24 01:49:01,002 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:49:01,002 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566974222]
[2024-10-24 01:49:01,002 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:01,003 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:49:01,027 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:01,343 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:01,343 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:49:01,343 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566974222]
[2024-10-24 01:49:01,343 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566974222] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:49:01,343 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:49:01,343 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-10-24 01:49:01,344 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026642582]
[2024-10-24 01:49:01,344 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:49:01,344 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-10-24 01:49:01,344 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:49:01,344 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-10-24 01:49:01,344 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132
[2024-10-24 01:49:01,344 INFO  L87              Difference]: Start difference. First operand 158 states and 192 transitions. Second operand  has 12 states, 12 states have (on average 6.0) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:01,726 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:49:01,726 INFO  L93              Difference]: Finished difference Result 234 states and 298 transitions.
[2024-10-24 01:49:01,726 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-10-24 01:49:01,727 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 6.0) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 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 72
[2024-10-24 01:49:01,727 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:49:01,727 INFO  L225             Difference]: With dead ends: 234
[2024-10-24 01:49:01,727 INFO  L226             Difference]: Without dead ends: 228
[2024-10-24 01:49:01,728 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506
[2024-10-24 01:49:01,728 INFO  L432           NwaCegarLoop]: 211 mSDtfsCounter, 532 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-24 01:49:01,728 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1288 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-24 01:49:01,729 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 228 states.
[2024-10-24 01:49:01,730 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 131.
[2024-10-24 01:49:01,730 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 131 states, 130 states have (on average 1.2384615384615385) internal successors, (161), 130 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)
[2024-10-24 01:49:01,731 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 161 transitions.
[2024-10-24 01:49:01,731 INFO  L78                 Accepts]: Start accepts. Automaton has 131 states and 161 transitions. Word has length 72
[2024-10-24 01:49:01,731 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:49:01,731 INFO  L471      AbstractCegarLoop]: Abstraction has 131 states and 161 transitions.
[2024-10-24 01:49:01,731 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 6.0) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:01,731 INFO  L276                IsEmpty]: Start isEmpty. Operand 131 states and 161 transitions.
[2024-10-24 01:49:01,732 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2024-10-24 01:49:01,732 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:49:01,732 INFO  L215           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]
[2024-10-24 01:49:01,732 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-10-24 01:49:01,732 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:49:01,733 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:49:01,733 INFO  L85        PathProgramCache]: Analyzing trace with hash -668672694, now seen corresponding path program 1 times
[2024-10-24 01:49:01,733 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:49:01,733 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610873864]
[2024-10-24 01:49:01,733 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:01,733 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:49:01,750 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:01,819 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:01,820 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:49:01,820 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610873864]
[2024-10-24 01:49:01,820 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610873864] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:49:01,820 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:49:01,820 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-24 01:49:01,820 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530346357]
[2024-10-24 01:49:01,820 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:49:01,821 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-24 01:49:01,821 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:49:01,821 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-24 01:49:01,821 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-10-24 01:49:01,821 INFO  L87              Difference]: Start difference. First operand 131 states and 161 transitions. Second operand  has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:01,919 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:49:01,919 INFO  L93              Difference]: Finished difference Result 563 states and 793 transitions.
[2024-10-24 01:49:01,919 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-10-24 01:49:01,919 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 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 95
[2024-10-24 01:49:01,920 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:49:01,921 INFO  L225             Difference]: With dead ends: 563
[2024-10-24 01:49:01,921 INFO  L226             Difference]: Without dead ends: 509
[2024-10-24 01:49:01,921 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2024-10-24 01:49:01,922 INFO  L432           NwaCegarLoop]: 156 mSDtfsCounter, 896 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-24 01:49:01,922 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 942 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-24 01:49:01,923 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 509 states.
[2024-10-24 01:49:01,925 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 183.
[2024-10-24 01:49:01,926 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 183 states, 182 states have (on average 1.3021978021978022) internal successors, (237), 182 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:01,926 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 237 transitions.
[2024-10-24 01:49:01,926 INFO  L78                 Accepts]: Start accepts. Automaton has 183 states and 237 transitions. Word has length 95
[2024-10-24 01:49:01,926 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:49:01,927 INFO  L471      AbstractCegarLoop]: Abstraction has 183 states and 237 transitions.
[2024-10-24 01:49:01,927 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:01,927 INFO  L276                IsEmpty]: Start isEmpty. Operand 183 states and 237 transitions.
[2024-10-24 01:49:01,927 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2024-10-24 01:49:01,927 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:49:01,928 INFO  L215           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]
[2024-10-24 01:49:01,928 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-10-24 01:49:01,928 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:49:01,928 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:49:01,928 INFO  L85        PathProgramCache]: Analyzing trace with hash 1525557505, now seen corresponding path program 1 times
[2024-10-24 01:49:01,929 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:49:01,929 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771745226]
[2024-10-24 01:49:01,929 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:01,929 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:49:01,946 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:02,014 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:02,015 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:49:02,015 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771745226]
[2024-10-24 01:49:02,015 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771745226] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:49:02,015 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:49:02,015 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-24 01:49:02,015 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295112074]
[2024-10-24 01:49:02,015 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:49:02,016 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-24 01:49:02,016 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:49:02,016 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-24 01:49:02,016 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-10-24 01:49:02,017 INFO  L87              Difference]: Start difference. First operand 183 states and 237 transitions. Second operand  has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:02,074 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:49:02,075 INFO  L93              Difference]: Finished difference Result 661 states and 934 transitions.
[2024-10-24 01:49:02,075 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-24 01:49:02,075 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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 97
[2024-10-24 01:49:02,075 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:49:02,077 INFO  L225             Difference]: With dead ends: 661
[2024-10-24 01:49:02,077 INFO  L226             Difference]: Without dead ends: 555
[2024-10-24 01:49:02,077 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-10-24 01:49:02,078 INFO  L432           NwaCegarLoop]: 223 mSDtfsCounter, 648 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-24 01:49:02,078 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 662 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-24 01:49:02,078 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 555 states.
[2024-10-24 01:49:02,082 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 287.
[2024-10-24 01:49:02,082 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 287 states, 286 states have (on average 1.3636363636363635) internal successors, (390), 286 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:02,083 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 390 transitions.
[2024-10-24 01:49:02,083 INFO  L78                 Accepts]: Start accepts. Automaton has 287 states and 390 transitions. Word has length 97
[2024-10-24 01:49:02,083 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:49:02,083 INFO  L471      AbstractCegarLoop]: Abstraction has 287 states and 390 transitions.
[2024-10-24 01:49:02,083 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:02,083 INFO  L276                IsEmpty]: Start isEmpty. Operand 287 states and 390 transitions.
[2024-10-24 01:49:02,084 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2024-10-24 01:49:02,084 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:49:02,084 INFO  L215           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]
[2024-10-24 01:49:02,084 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-10-24 01:49:02,084 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:49:02,084 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:49:02,085 INFO  L85        PathProgramCache]: Analyzing trace with hash -696655454, now seen corresponding path program 1 times
[2024-10-24 01:49:02,085 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:49:02,085 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127827084]
[2024-10-24 01:49:02,085 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:02,085 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:49:02,101 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:02,219 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:02,219 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:49:02,219 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127827084]
[2024-10-24 01:49:02,219 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127827084] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:49:02,219 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:49:02,219 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-24 01:49:02,219 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653352866]
[2024-10-24 01:49:02,220 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:49:02,220 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-24 01:49:02,220 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:49:02,220 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-24 01:49:02,220 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-10-24 01:49:02,221 INFO  L87              Difference]: Start difference. First operand 287 states and 390 transitions. Second operand  has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:02,284 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:49:02,285 INFO  L93              Difference]: Finished difference Result 499 states and 699 transitions.
[2024-10-24 01:49:02,285 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-24 01:49:02,286 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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 97
[2024-10-24 01:49:02,286 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:49:02,287 INFO  L225             Difference]: With dead ends: 499
[2024-10-24 01:49:02,287 INFO  L226             Difference]: Without dead ends: 289
[2024-10-24 01:49:02,287 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-10-24 01:49:02,288 INFO  L432           NwaCegarLoop]: 150 mSDtfsCounter, 260 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-24 01:49:02,288 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 375 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-24 01:49:02,288 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 289 states.
[2024-10-24 01:49:02,290 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 287.
[2024-10-24 01:49:02,291 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 287 states, 286 states have (on average 1.3566433566433567) internal successors, (388), 286 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:02,291 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 388 transitions.
[2024-10-24 01:49:02,291 INFO  L78                 Accepts]: Start accepts. Automaton has 287 states and 388 transitions. Word has length 97
[2024-10-24 01:49:02,292 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:49:02,292 INFO  L471      AbstractCegarLoop]: Abstraction has 287 states and 388 transitions.
[2024-10-24 01:49:02,292 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:02,292 INFO  L276                IsEmpty]: Start isEmpty. Operand 287 states and 388 transitions.
[2024-10-24 01:49:02,292 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2024-10-24 01:49:02,292 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:49:02,293 INFO  L215           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]
[2024-10-24 01:49:02,293 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-10-24 01:49:02,293 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:49:02,293 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:49:02,293 INFO  L85        PathProgramCache]: Analyzing trace with hash -763148966, now seen corresponding path program 1 times
[2024-10-24 01:49:02,293 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:49:02,293 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20145516]
[2024-10-24 01:49:02,294 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:02,294 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:49:02,311 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:02,345 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:02,346 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:49:02,346 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20145516]
[2024-10-24 01:49:02,346 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20145516] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:49:02,346 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:49:02,346 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-24 01:49:02,346 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763504785]
[2024-10-24 01:49:02,346 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:49:02,346 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-24 01:49:02,346 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:49:02,347 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-24 01:49:02,347 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-24 01:49:02,348 INFO  L87              Difference]: Start difference. First operand 287 states and 388 transitions. Second operand  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:02,369 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:49:02,370 INFO  L93              Difference]: Finished difference Result 681 states and 956 transitions.
[2024-10-24 01:49:02,370 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-24 01:49:02,370 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97
[2024-10-24 01:49:02,370 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:49:02,371 INFO  L225             Difference]: With dead ends: 681
[2024-10-24 01:49:02,371 INFO  L226             Difference]: Without dead ends: 471
[2024-10-24 01:49:02,372 INFO  L431           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
[2024-10-24 01:49:02,375 INFO  L432           NwaCegarLoop]: 222 mSDtfsCounter, 66 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-24 01:49:02,375 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 369 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-24 01:49:02,376 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 471 states.
[2024-10-24 01:49:02,380 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 469.
[2024-10-24 01:49:02,381 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 469 states, 468 states have (on average 1.3696581196581197) internal successors, (641), 468 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:02,381 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 641 transitions.
[2024-10-24 01:49:02,381 INFO  L78                 Accepts]: Start accepts. Automaton has 469 states and 641 transitions. Word has length 97
[2024-10-24 01:49:02,382 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:49:02,382 INFO  L471      AbstractCegarLoop]: Abstraction has 469 states and 641 transitions.
[2024-10-24 01:49:02,382 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:02,382 INFO  L276                IsEmpty]: Start isEmpty. Operand 469 states and 641 transitions.
[2024-10-24 01:49:02,382 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2024-10-24 01:49:02,382 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:49:02,383 INFO  L215           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]
[2024-10-24 01:49:02,383 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-10-24 01:49:02,383 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:49:02,383 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:49:02,383 INFO  L85        PathProgramCache]: Analyzing trace with hash -713677567, now seen corresponding path program 1 times
[2024-10-24 01:49:02,383 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:49:02,384 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886822450]
[2024-10-24 01:49:02,384 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:02,384 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:49:02,403 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:02,470 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:02,471 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:49:02,471 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886822450]
[2024-10-24 01:49:02,471 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886822450] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:49:02,472 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:49:02,472 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-24 01:49:02,472 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874353464]
[2024-10-24 01:49:02,472 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:49:02,472 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-24 01:49:02,472 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:49:02,473 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-24 01:49:02,473 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-10-24 01:49:02,473 INFO  L87              Difference]: Start difference. First operand 469 states and 641 transitions. Second operand  has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:02,542 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:49:02,543 INFO  L93              Difference]: Finished difference Result 1357 states and 1905 transitions.
[2024-10-24 01:49:02,543 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-24 01:49:02,543 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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 97
[2024-10-24 01:49:02,543 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:49:02,546 INFO  L225             Difference]: With dead ends: 1357
[2024-10-24 01:49:02,546 INFO  L226             Difference]: Without dead ends: 1160
[2024-10-24 01:49:02,547 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-10-24 01:49:02,548 INFO  L432           NwaCegarLoop]: 229 mSDtfsCounter, 613 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-24 01:49:02,548 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 689 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-24 01:49:02,549 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1160 states.
[2024-10-24 01:49:02,557 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 762.
[2024-10-24 01:49:02,558 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 762 states, 761 states have (on average 1.390275952693824) internal successors, (1058), 761 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:02,559 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1058 transitions.
[2024-10-24 01:49:02,559 INFO  L78                 Accepts]: Start accepts. Automaton has 762 states and 1058 transitions. Word has length 97
[2024-10-24 01:49:02,559 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:49:02,559 INFO  L471      AbstractCegarLoop]: Abstraction has 762 states and 1058 transitions.
[2024-10-24 01:49:02,559 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:02,559 INFO  L276                IsEmpty]: Start isEmpty. Operand 762 states and 1058 transitions.
[2024-10-24 01:49:02,560 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2024-10-24 01:49:02,560 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:49:02,560 INFO  L215           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]
[2024-10-24 01:49:02,560 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-10-24 01:49:02,560 INFO  L396      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:49:02,561 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:49:02,561 INFO  L85        PathProgramCache]: Analyzing trace with hash 1161471745, now seen corresponding path program 1 times
[2024-10-24 01:49:02,561 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:49:02,561 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707687609]
[2024-10-24 01:49:02,561 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:02,561 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:49:02,584 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:02,707 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:02,710 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:49:02,710 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707687609]
[2024-10-24 01:49:02,710 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707687609] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:49:02,710 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:49:02,710 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-24 01:49:02,710 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905849406]
[2024-10-24 01:49:02,711 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:49:02,711 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-24 01:49:02,711 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:49:02,711 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-24 01:49:02,711 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-10-24 01:49:02,711 INFO  L87              Difference]: Start difference. First operand 762 states and 1058 transitions. Second operand  has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:02,847 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:49:02,851 INFO  L93              Difference]: Finished difference Result 1552 states and 2183 transitions.
[2024-10-24 01:49:02,851 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-24 01:49:02,852 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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 97
[2024-10-24 01:49:02,852 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:49:02,855 INFO  L225             Difference]: With dead ends: 1552
[2024-10-24 01:49:02,858 INFO  L226             Difference]: Without dead ends: 1355
[2024-10-24 01:49:02,859 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-10-24 01:49:02,863 INFO  L432           NwaCegarLoop]: 230 mSDtfsCounter, 585 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-24 01:49:02,864 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 731 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-24 01:49:02,865 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1355 states.
[2024-10-24 01:49:02,875 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 957.
[2024-10-24 01:49:02,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 957 states, 956 states have (on average 1.397489539748954) internal successors, (1336), 956 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:02,878 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1336 transitions.
[2024-10-24 01:49:02,878 INFO  L78                 Accepts]: Start accepts. Automaton has 957 states and 1336 transitions. Word has length 97
[2024-10-24 01:49:02,878 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:49:02,878 INFO  L471      AbstractCegarLoop]: Abstraction has 957 states and 1336 transitions.
[2024-10-24 01:49:02,878 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:02,878 INFO  L276                IsEmpty]: Start isEmpty. Operand 957 states and 1336 transitions.
[2024-10-24 01:49:02,879 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2024-10-24 01:49:02,879 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:49:02,879 INFO  L215           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]
[2024-10-24 01:49:02,879 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-10-24 01:49:02,879 INFO  L396      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:49:02,880 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:49:02,881 INFO  L85        PathProgramCache]: Analyzing trace with hash -2028950783, now seen corresponding path program 1 times
[2024-10-24 01:49:02,881 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:49:02,881 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226523064]
[2024-10-24 01:49:02,881 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:02,881 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:49:02,900 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:02,968 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:02,968 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:49:02,969 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226523064]
[2024-10-24 01:49:02,969 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226523064] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:49:02,969 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:49:02,969 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-24 01:49:02,969 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277879261]
[2024-10-24 01:49:02,969 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:49:02,970 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-24 01:49:02,970 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:49:02,970 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-24 01:49:02,970 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-10-24 01:49:02,971 INFO  L87              Difference]: Start difference. First operand 957 states and 1336 transitions. Second operand  has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:03,040 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:49:03,040 INFO  L93              Difference]: Finished difference Result 1747 states and 2461 transitions.
[2024-10-24 01:49:03,043 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-24 01:49:03,043 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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 97
[2024-10-24 01:49:03,044 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:49:03,047 INFO  L225             Difference]: With dead ends: 1747
[2024-10-24 01:49:03,047 INFO  L226             Difference]: Without dead ends: 1550
[2024-10-24 01:49:03,048 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-10-24 01:49:03,049 INFO  L432           NwaCegarLoop]: 226 mSDtfsCounter, 641 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-24 01:49:03,049 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 763 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-24 01:49:03,051 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1550 states.
[2024-10-24 01:49:03,061 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1152.
[2024-10-24 01:49:03,062 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1152 states, 1151 states have (on average 1.4022589052997394) internal successors, (1614), 1151 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:03,064 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1614 transitions.
[2024-10-24 01:49:03,064 INFO  L78                 Accepts]: Start accepts. Automaton has 1152 states and 1614 transitions. Word has length 97
[2024-10-24 01:49:03,064 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:49:03,064 INFO  L471      AbstractCegarLoop]: Abstraction has 1152 states and 1614 transitions.
[2024-10-24 01:49:03,064 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:03,065 INFO  L276                IsEmpty]: Start isEmpty. Operand 1152 states and 1614 transitions.
[2024-10-24 01:49:03,065 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2024-10-24 01:49:03,065 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:49:03,065 INFO  L215           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]
[2024-10-24 01:49:03,065 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-10-24 01:49:03,066 INFO  L396      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:49:03,066 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:49:03,066 INFO  L85        PathProgramCache]: Analyzing trace with hash -567395912, now seen corresponding path program 1 times
[2024-10-24 01:49:03,066 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:49:03,066 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166129367]
[2024-10-24 01:49:03,066 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:03,066 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:49:03,084 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:03,135 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:03,136 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:49:03,136 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166129367]
[2024-10-24 01:49:03,136 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166129367] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:49:03,136 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:49:03,136 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-24 01:49:03,136 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484695565]
[2024-10-24 01:49:03,136 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:49:03,136 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-24 01:49:03,137 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:49:03,137 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-24 01:49:03,137 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-24 01:49:03,137 INFO  L87              Difference]: Start difference. First operand 1152 states and 1614 transitions. Second operand  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:03,155 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:49:03,155 INFO  L93              Difference]: Finished difference Result 2884 states and 4061 transitions.
[2024-10-24 01:49:03,155 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-24 01:49:03,156 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98
[2024-10-24 01:49:03,156 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:49:03,159 INFO  L225             Difference]: With dead ends: 2884
[2024-10-24 01:49:03,159 INFO  L226             Difference]: Without dead ends: 1809
[2024-10-24 01:49:03,161 INFO  L431           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
[2024-10-24 01:49:03,161 INFO  L432           NwaCegarLoop]: 222 mSDtfsCounter, 77 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-24 01:49:03,161 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 341 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-24 01:49:03,162 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1809 states.
[2024-10-24 01:49:03,175 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1719.
[2024-10-24 01:49:03,176 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1719 states, 1718 states have (on average 1.3946449359720605) internal successors, (2396), 1718 states have internal predecessors, (2396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:03,178 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2396 transitions.
[2024-10-24 01:49:03,178 INFO  L78                 Accepts]: Start accepts. Automaton has 1719 states and 2396 transitions. Word has length 98
[2024-10-24 01:49:03,178 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:49:03,179 INFO  L471      AbstractCegarLoop]: Abstraction has 1719 states and 2396 transitions.
[2024-10-24 01:49:03,179 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:03,179 INFO  L276                IsEmpty]: Start isEmpty. Operand 1719 states and 2396 transitions.
[2024-10-24 01:49:03,179 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2024-10-24 01:49:03,179 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:49:03,180 INFO  L215           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]
[2024-10-24 01:49:03,180 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-10-24 01:49:03,180 INFO  L396      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:49:03,180 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:49:03,180 INFO  L85        PathProgramCache]: Analyzing trace with hash -1064867383, now seen corresponding path program 1 times
[2024-10-24 01:49:03,180 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:49:03,180 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812249672]
[2024-10-24 01:49:03,180 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:03,181 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:49:03,201 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:03,251 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:03,251 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:49:03,251 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812249672]
[2024-10-24 01:49:03,252 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812249672] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:49:03,252 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:49:03,252 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-24 01:49:03,252 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116843619]
[2024-10-24 01:49:03,252 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:49:03,252 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-24 01:49:03,252 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:49:03,253 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-24 01:49:03,253 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-24 01:49:03,253 INFO  L87              Difference]: Start difference. First operand 1719 states and 2396 transitions. Second operand  has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:03,273 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:49:03,273 INFO  L93              Difference]: Finished difference Result 4871 states and 6793 transitions.
[2024-10-24 01:49:03,274 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-24 01:49:03,274 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99
[2024-10-24 01:49:03,274 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:49:03,280 INFO  L225             Difference]: With dead ends: 4871
[2024-10-24 01:49:03,280 INFO  L226             Difference]: Without dead ends: 3229
[2024-10-24 01:49:03,282 INFO  L431           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
[2024-10-24 01:49:03,282 INFO  L432           NwaCegarLoop]: 215 mSDtfsCounter, 70 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-24 01:49:03,282 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 342 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-24 01:49:03,284 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3229 states.
[2024-10-24 01:49:03,306 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 3095.
[2024-10-24 01:49:03,309 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3095 states, 3094 states have (on average 1.383322559793148) internal successors, (4280), 3094 states have internal predecessors, (4280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:03,313 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3095 states to 3095 states and 4280 transitions.
[2024-10-24 01:49:03,313 INFO  L78                 Accepts]: Start accepts. Automaton has 3095 states and 4280 transitions. Word has length 99
[2024-10-24 01:49:03,313 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:49:03,313 INFO  L471      AbstractCegarLoop]: Abstraction has 3095 states and 4280 transitions.
[2024-10-24 01:49:03,313 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:03,313 INFO  L276                IsEmpty]: Start isEmpty. Operand 3095 states and 4280 transitions.
[2024-10-24 01:49:03,314 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2024-10-24 01:49:03,314 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:49:03,314 INFO  L215           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]
[2024-10-24 01:49:03,314 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-10-24 01:49:03,314 INFO  L396      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:49:03,315 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:49:03,315 INFO  L85        PathProgramCache]: Analyzing trace with hash -1967013372, now seen corresponding path program 1 times
[2024-10-24 01:49:03,315 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:49:03,315 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792592070]
[2024-10-24 01:49:03,315 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:03,315 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:49:03,338 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:03,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:03,390 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:49:03,390 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792592070]
[2024-10-24 01:49:03,390 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792592070] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:49:03,390 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:49:03,390 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-24 01:49:03,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157108037]
[2024-10-24 01:49:03,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:49:03,391 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-24 01:49:03,391 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:49:03,391 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-24 01:49:03,391 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-24 01:49:03,392 INFO  L87              Difference]: Start difference. First operand 3095 states and 4280 transitions. Second operand  has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:03,439 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:49:03,440 INFO  L93              Difference]: Finished difference Result 8867 states and 12214 transitions.
[2024-10-24 01:49:03,440 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-24 01:49:03,440 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100
[2024-10-24 01:49:03,440 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:49:03,457 INFO  L225             Difference]: With dead ends: 8867
[2024-10-24 01:49:03,461 INFO  L226             Difference]: Without dead ends: 5849
[2024-10-24 01:49:03,465 INFO  L431           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
[2024-10-24 01:49:03,466 INFO  L432           NwaCegarLoop]: 207 mSDtfsCounter, 63 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-24 01:49:03,466 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 342 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-24 01:49:03,469 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5849 states.
[2024-10-24 01:49:03,515 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5849 to 5583.
[2024-10-24 01:49:03,520 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5583 states, 5582 states have (on average 1.3649229666786098) internal successors, (7619), 5582 states have internal predecessors, (7619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:03,528 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5583 states to 5583 states and 7619 transitions.
[2024-10-24 01:49:03,530 INFO  L78                 Accepts]: Start accepts. Automaton has 5583 states and 7619 transitions. Word has length 100
[2024-10-24 01:49:03,530 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:49:03,530 INFO  L471      AbstractCegarLoop]: Abstraction has 5583 states and 7619 transitions.
[2024-10-24 01:49:03,530 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:03,530 INFO  L276                IsEmpty]: Start isEmpty. Operand 5583 states and 7619 transitions.
[2024-10-24 01:49:03,530 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2024-10-24 01:49:03,530 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:49:03,531 INFO  L215           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]
[2024-10-24 01:49:03,531 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-10-24 01:49:03,531 INFO  L396      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:49:03,531 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:49:03,531 INFO  L85        PathProgramCache]: Analyzing trace with hash 28912981, now seen corresponding path program 1 times
[2024-10-24 01:49:03,531 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:49:03,531 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714833756]
[2024-10-24 01:49:03,532 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:03,532 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:49:03,552 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:03,611 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:03,612 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:49:03,612 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714833756]
[2024-10-24 01:49:03,612 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714833756] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:49:03,612 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:49:03,612 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-24 01:49:03,612 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315567678]
[2024-10-24 01:49:03,613 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:49:03,613 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-24 01:49:03,613 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:49:03,613 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-24 01:49:03,613 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-24 01:49:03,614 INFO  L87              Difference]: Start difference. First operand 5583 states and 7619 transitions. Second operand  has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:03,667 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:49:03,667 INFO  L93              Difference]: Finished difference Result 16067 states and 21769 transitions.
[2024-10-24 01:49:03,667 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-24 01:49:03,667 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101
[2024-10-24 01:49:03,668 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:49:03,688 INFO  L225             Difference]: With dead ends: 16067
[2024-10-24 01:49:03,688 INFO  L226             Difference]: Without dead ends: 10561
[2024-10-24 01:49:03,696 INFO  L431           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
[2024-10-24 01:49:03,697 INFO  L432           NwaCegarLoop]: 198 mSDtfsCounter, 53 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-24 01:49:03,697 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 341 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-24 01:49:03,702 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10561 states.
[2024-10-24 01:49:03,791 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10561 to 10031.
[2024-10-24 01:49:03,801 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10031 states, 10030 states have (on average 1.3398803589232302) internal successors, (13439), 10030 states have internal predecessors, (13439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:03,814 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10031 states to 10031 states and 13439 transitions.
[2024-10-24 01:49:03,814 INFO  L78                 Accepts]: Start accepts. Automaton has 10031 states and 13439 transitions. Word has length 101
[2024-10-24 01:49:03,814 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:49:03,814 INFO  L471      AbstractCegarLoop]: Abstraction has 10031 states and 13439 transitions.
[2024-10-24 01:49:03,815 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:03,815 INFO  L276                IsEmpty]: Start isEmpty. Operand 10031 states and 13439 transitions.
[2024-10-24 01:49:03,815 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2024-10-24 01:49:03,815 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:49:03,815 INFO  L215           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]
[2024-10-24 01:49:03,815 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-10-24 01:49:03,815 INFO  L396      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:49:03,816 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:49:03,816 INFO  L85        PathProgramCache]: Analyzing trace with hash 1790582352, now seen corresponding path program 1 times
[2024-10-24 01:49:03,816 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:49:03,816 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053756210]
[2024-10-24 01:49:03,816 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:03,816 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:49:03,837 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:04,039 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:04,039 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:49:04,039 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053756210]
[2024-10-24 01:49:04,039 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053756210] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:49:04,040 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:49:04,040 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-24 01:49:04,040 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880701962]
[2024-10-24 01:49:04,040 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:49:04,040 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-24 01:49:04,041 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:49:04,041 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-24 01:49:04,041 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-10-24 01:49:04,041 INFO  L87              Difference]: Start difference. First operand 10031 states and 13439 transitions. Second operand  has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:04,104 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:49:04,104 INFO  L93              Difference]: Finished difference Result 10273 states and 13760 transitions.
[2024-10-24 01:49:04,105 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-24 01:49:04,105 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 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 102
[2024-10-24 01:49:04,105 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:49:04,120 INFO  L225             Difference]: With dead ends: 10273
[2024-10-24 01:49:04,120 INFO  L226             Difference]: Without dead ends: 10271
[2024-10-24 01:49:04,123 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-10-24 01:49:04,124 INFO  L432           NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-24 01:49:04,124 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 766 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-24 01:49:04,129 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10271 states.
[2024-10-24 01:49:04,205 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10271 to 10271.
[2024-10-24 01:49:04,215 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10271 states, 10270 states have (on average 1.3225900681596885) internal successors, (13583), 10270 states have internal predecessors, (13583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:04,228 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10271 states to 10271 states and 13583 transitions.
[2024-10-24 01:49:04,228 INFO  L78                 Accepts]: Start accepts. Automaton has 10271 states and 13583 transitions. Word has length 102
[2024-10-24 01:49:04,228 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:49:04,228 INFO  L471      AbstractCegarLoop]: Abstraction has 10271 states and 13583 transitions.
[2024-10-24 01:49:04,228 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:04,229 INFO  L276                IsEmpty]: Start isEmpty. Operand 10271 states and 13583 transitions.
[2024-10-24 01:49:04,229 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2024-10-24 01:49:04,229 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:49:04,229 INFO  L215           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]
[2024-10-24 01:49:04,229 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-10-24 01:49:04,229 INFO  L396      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:49:04,230 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:49:04,230 INFO  L85        PathProgramCache]: Analyzing trace with hash 193814543, now seen corresponding path program 1 times
[2024-10-24 01:49:04,230 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:49:04,230 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700632807]
[2024-10-24 01:49:04,230 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:04,230 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:49:04,261 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:04,295 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:04,295 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:49:04,295 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700632807]
[2024-10-24 01:49:04,295 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700632807] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:49:04,295 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-24 01:49:04,295 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-24 01:49:04,295 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264051734]
[2024-10-24 01:49:04,295 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:49:04,296 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-24 01:49:04,296 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:49:04,296 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-24 01:49:04,296 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-24 01:49:04,296 INFO  L87              Difference]: Start difference. First operand 10271 states and 13583 transitions. Second operand  has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:04,384 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:49:04,384 INFO  L93              Difference]: Finished difference Result 20787 states and 27513 transitions.
[2024-10-24 01:49:04,384 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-24 01:49:04,385 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102
[2024-10-24 01:49:04,385 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:49:04,398 INFO  L225             Difference]: With dead ends: 20787
[2024-10-24 01:49:04,398 INFO  L226             Difference]: Without dead ends: 10593
[2024-10-24 01:49:04,407 INFO  L431           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
[2024-10-24 01:49:04,408 INFO  L432           NwaCegarLoop]: 180 mSDtfsCounter, 85 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-24 01:49:04,408 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 285 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-24 01:49:04,413 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10593 states.
[2024-10-24 01:49:04,483 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10593 to 10591.
[2024-10-24 01:49:04,492 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10591 states, 10590 states have (on average 1.3056657223796033) internal successors, (13827), 10590 states have internal predecessors, (13827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:04,502 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10591 states to 10591 states and 13827 transitions.
[2024-10-24 01:49:04,502 INFO  L78                 Accepts]: Start accepts. Automaton has 10591 states and 13827 transitions. Word has length 102
[2024-10-24 01:49:04,503 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:49:04,503 INFO  L471      AbstractCegarLoop]: Abstraction has 10591 states and 13827 transitions.
[2024-10-24 01:49:04,503 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:04,503 INFO  L276                IsEmpty]: Start isEmpty. Operand 10591 states and 13827 transitions.
[2024-10-24 01:49:04,505 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2024-10-24 01:49:04,505 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:49:04,505 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-24 01:49:04,505 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-10-24 01:49:04,505 INFO  L396      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:49:04,505 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:49:04,506 INFO  L85        PathProgramCache]: Analyzing trace with hash -788506636, now seen corresponding path program 1 times
[2024-10-24 01:49:04,506 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:49:04,506 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704043279]
[2024-10-24 01:49:04,506 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:04,506 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:49:04,530 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:04,873 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:04,873 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:49:04,873 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704043279]
[2024-10-24 01:49:04,874 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704043279] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-24 01:49:04,874 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039373692]
[2024-10-24 01:49:04,874 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:04,874 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-24 01:49:04,874 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-24 01:49:04,879 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-24 01:49:04,883 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-10-24 01:49:05,096 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:05,100 INFO  L255         TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 15 conjuncts are in the unsatisfiable core
[2024-10-24 01:49:05,106 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-24 01:49:05,741 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:05,746 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-10-24 01:49:07,213 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:07,214 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039373692] provided 0 perfect and 2 imperfect interpolant sequences
[2024-10-24 01:49:07,214 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-10-24 01:49:07,214 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25
[2024-10-24 01:49:07,214 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791532350]
[2024-10-24 01:49:07,214 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-10-24 01:49:07,215 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-10-24 01:49:07,215 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:49:07,216 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-10-24 01:49:07,216 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650
[2024-10-24 01:49:07,216 INFO  L87              Difference]: Start difference. First operand 10591 states and 13827 transitions. Second operand  has 26 states, 26 states have (on average 13.423076923076923) internal successors, (349), 25 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:11,766 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:49:11,766 INFO  L93              Difference]: Finished difference Result 91193 states and 118896 transitions.
[2024-10-24 01:49:11,767 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. 
[2024-10-24 01:49:11,767 INFO  L78                 Accepts]: Start accepts. Automaton has  has 26 states, 26 states have (on average 13.423076923076923) internal successors, (349), 25 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129
[2024-10-24 01:49:11,767 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:49:12,035 INFO  L225             Difference]: With dead ends: 91193
[2024-10-24 01:49:12,036 INFO  L226             Difference]: Without dead ends: 80679
[2024-10-24 01:49:12,055 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4598 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2388, Invalid=12864, Unknown=0, NotChecked=0, Total=15252
[2024-10-24 01:49:12,056 INFO  L432           NwaCegarLoop]: 142 mSDtfsCounter, 3356 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 2971 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3356 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 3037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2024-10-24 01:49:12,057 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [3356 Valid, 1792 Invalid, 3037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2971 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2024-10-24 01:49:12,090 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80679 states.
[2024-10-24 01:49:12,569 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80679 to 53346.
[2024-10-24 01:49:12,617 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 53346 states, 53345 states have (on average 1.2971974880494892) internal successors, (69199), 53345 states have internal predecessors, (69199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:12,680 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53346 states to 53346 states and 69199 transitions.
[2024-10-24 01:49:12,681 INFO  L78                 Accepts]: Start accepts. Automaton has 53346 states and 69199 transitions. Word has length 129
[2024-10-24 01:49:12,681 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:49:12,681 INFO  L471      AbstractCegarLoop]: Abstraction has 53346 states and 69199 transitions.
[2024-10-24 01:49:12,681 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 13.423076923076923) internal successors, (349), 25 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:12,681 INFO  L276                IsEmpty]: Start isEmpty. Operand 53346 states and 69199 transitions.
[2024-10-24 01:49:12,688 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 131
[2024-10-24 01:49:12,688 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:49:12,688 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-24 01:49:12,703 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-10-24 01:49:12,889 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38
[2024-10-24 01:49:12,889 INFO  L396      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:49:12,890 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:49:12,890 INFO  L85        PathProgramCache]: Analyzing trace with hash -700017125, now seen corresponding path program 1 times
[2024-10-24 01:49:12,890 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:49:12,890 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657543386]
[2024-10-24 01:49:12,891 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:12,891 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:49:12,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:13,420 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:13,421 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:49:13,421 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657543386]
[2024-10-24 01:49:13,421 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657543386] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-24 01:49:13,421 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659673684]
[2024-10-24 01:49:13,421 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:13,421 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-24 01:49:13,421 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-24 01:49:13,423 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-24 01:49:13,424 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-10-24 01:49:13,626 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:13,629 INFO  L255         TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-10-24 01:49:13,633 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-24 01:49:14,225 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:14,225 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-10-24 01:49:14,747 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:14,747 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659673684] provided 0 perfect and 2 imperfect interpolant sequences
[2024-10-24 01:49:14,747 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-10-24 01:49:14,747 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 28
[2024-10-24 01:49:14,747 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179865255]
[2024-10-24 01:49:14,747 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-10-24 01:49:14,748 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2024-10-24 01:49:14,748 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:49:14,749 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2024-10-24 01:49:14,749 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756
[2024-10-24 01:49:14,749 INFO  L87              Difference]: Start difference. First operand 53346 states and 69199 transitions. Second operand  has 28 states, 28 states have (on average 12.464285714285714) internal successors, (349), 28 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:20,138 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:49:20,139 INFO  L93              Difference]: Finished difference Result 360302 states and 468892 transitions.
[2024-10-24 01:49:20,139 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. 
[2024-10-24 01:49:20,139 INFO  L78                 Accepts]: Start accepts. Automaton has  has 28 states, 28 states have (on average 12.464285714285714) internal successors, (349), 28 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130
[2024-10-24 01:49:20,139 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:49:20,633 INFO  L225             Difference]: With dead ends: 360302
[2024-10-24 01:49:20,633 INFO  L226             Difference]: Without dead ends: 307071
[2024-10-24 01:49:20,736 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4508 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2073, Invalid=12447, Unknown=0, NotChecked=0, Total=14520
[2024-10-24 01:49:20,736 INFO  L432           NwaCegarLoop]: 213 mSDtfsCounter, 5484 mSDsluCounter, 3189 mSDsCounter, 0 mSdLazyCounter, 3305 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5484 SdHoareTripleChecker+Valid, 3402 SdHoareTripleChecker+Invalid, 3358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 3305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2024-10-24 01:49:20,737 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [5484 Valid, 3402 Invalid, 3358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 3305 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2024-10-24 01:49:21,548 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 307071 states.
[2024-10-24 01:49:24,788 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 307071 to 202275.
[2024-10-24 01:49:24,996 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 202275 states, 202274 states have (on average 1.2914660312249722) internal successors, (261230), 202274 states have internal predecessors, (261230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:25,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 202275 states to 202275 states and 261230 transitions.
[2024-10-24 01:49:25,565 INFO  L78                 Accepts]: Start accepts. Automaton has 202275 states and 261230 transitions. Word has length 130
[2024-10-24 01:49:25,565 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:49:25,565 INFO  L471      AbstractCegarLoop]: Abstraction has 202275 states and 261230 transitions.
[2024-10-24 01:49:25,566 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 28 states have (on average 12.464285714285714) internal successors, (349), 28 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:25,566 INFO  L276                IsEmpty]: Start isEmpty. Operand 202275 states and 261230 transitions.
[2024-10-24 01:49:25,585 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2024-10-24 01:49:25,585 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:49:25,585 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-24 01:49:25,599 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-10-24 01:49:25,786 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39
[2024-10-24 01:49:25,786 INFO  L396      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:49:25,787 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:49:25,787 INFO  L85        PathProgramCache]: Analyzing trace with hash -1748667743, now seen corresponding path program 1 times
[2024-10-24 01:49:25,787 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:49:25,787 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569445543]
[2024-10-24 01:49:25,787 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:25,787 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:49:25,843 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:26,817 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:26,817 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:49:26,817 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569445543]
[2024-10-24 01:49:26,817 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569445543] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-24 01:49:26,817 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889052217]
[2024-10-24 01:49:26,817 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:26,817 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-24 01:49:26,818 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-24 01:49:26,819 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-24 01:49:26,820 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-10-24 01:49:27,103 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:27,107 INFO  L255         TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 15 conjuncts are in the unsatisfiable core
[2024-10-24 01:49:27,117 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-24 01:49:27,487 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2024-10-24 01:49:27,487 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-24 01:49:27,488 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889052217] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-24 01:49:27,488 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-10-24 01:49:27,488 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17
[2024-10-24 01:49:27,488 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792634464]
[2024-10-24 01:49:27,488 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-24 01:49:27,489 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-10-24 01:49:27,489 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:49:27,489 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-10-24 01:49:27,489 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306
[2024-10-24 01:49:27,490 INFO  L87              Difference]: Start difference. First operand 202275 states and 261230 transitions. Second operand  has 8 states, 8 states have (on average 15.25) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:29,460 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:49:29,460 INFO  L93              Difference]: Finished difference Result 606597 states and 783440 transitions.
[2024-10-24 01:49:29,461 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-10-24 01:49:29,461 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 15.25) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131
[2024-10-24 01:49:29,461 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:49:30,472 INFO  L225             Difference]: With dead ends: 606597
[2024-10-24 01:49:30,473 INFO  L226             Difference]: Without dead ends: 404460
[2024-10-24 01:49:30,598 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600
[2024-10-24 01:49:30,602 INFO  L432           NwaCegarLoop]: 182 mSDtfsCounter, 324 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-10-24 01:49:30,603 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 712 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-10-24 01:49:30,760 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 404460 states.
[2024-10-24 01:49:33,784 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 404460 to 202275.
[2024-10-24 01:49:33,943 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 202275 states, 202274 states have (on average 1.2914462560685012) internal successors, (261226), 202274 states have internal predecessors, (261226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:34,794 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 202275 states to 202275 states and 261226 transitions.
[2024-10-24 01:49:34,794 INFO  L78                 Accepts]: Start accepts. Automaton has 202275 states and 261226 transitions. Word has length 131
[2024-10-24 01:49:34,794 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:49:34,794 INFO  L471      AbstractCegarLoop]: Abstraction has 202275 states and 261226 transitions.
[2024-10-24 01:49:34,795 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 15.25) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:34,795 INFO  L276                IsEmpty]: Start isEmpty. Operand 202275 states and 261226 transitions.
[2024-10-24 01:49:34,808 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2024-10-24 01:49:34,809 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:49:34,809 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-24 01:49:34,828 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-10-24 01:49:35,009 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-24 01:49:35,010 INFO  L396      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:49:35,011 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:49:35,012 INFO  L85        PathProgramCache]: Analyzing trace with hash 1345678582, now seen corresponding path program 1 times
[2024-10-24 01:49:35,012 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:49:35,014 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058402826]
[2024-10-24 01:49:35,014 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:35,014 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:49:35,041 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:35,362 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:35,362 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:49:35,362 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058402826]
[2024-10-24 01:49:35,362 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058402826] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-24 01:49:35,362 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710569465]
[2024-10-24 01:49:35,362 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:35,363 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-24 01:49:35,363 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-24 01:49:35,364 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-24 01:49:35,367 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-10-24 01:49:35,578 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:35,581 INFO  L255         TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 22 conjuncts are in the unsatisfiable core
[2024-10-24 01:49:35,583 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-24 01:49:36,711 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:36,711 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-10-24 01:49:38,002 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:38,006 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [710569465] provided 0 perfect and 2 imperfect interpolant sequences
[2024-10-24 01:49:38,006 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-10-24 01:49:38,006 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25
[2024-10-24 01:49:38,007 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281124870]
[2024-10-24 01:49:38,007 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-10-24 01:49:38,007 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-10-24 01:49:38,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-24 01:49:38,008 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-10-24 01:49:38,008 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650
[2024-10-24 01:49:38,008 INFO  L87              Difference]: Start difference. First operand 202275 states and 261226 transitions. Second operand  has 26 states, 26 states have (on average 12.038461538461538) internal successors, (313), 25 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:41,501 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-24 01:49:41,501 INFO  L93              Difference]: Finished difference Result 796636 states and 1034451 transitions.
[2024-10-24 01:49:41,502 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2024-10-24 01:49:41,502 INFO  L78                 Accepts]: Start accepts. Automaton has  has 26 states, 26 states have (on average 12.038461538461538) internal successors, (313), 25 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132
[2024-10-24 01:49:41,502 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-24 01:49:42,592 INFO  L225             Difference]: With dead ends: 796636
[2024-10-24 01:49:42,592 INFO  L226             Difference]: Without dead ends: 594527
[2024-10-24 01:49:42,793 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=473, Invalid=1597, Unknown=0, NotChecked=0, Total=2070
[2024-10-24 01:49:42,794 INFO  L432           NwaCegarLoop]: 115 mSDtfsCounter, 1187 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-10-24 01:49:42,794 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 1097 Invalid, 998 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [36 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-10-24 01:49:43,153 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 594527 states.
[2024-10-24 01:49:49,264 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 594527 to 489965.
[2024-10-24 01:49:49,539 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 489965 states, 489964 states have (on average 1.2896804663199746) internal successors, (631897), 489964 states have internal predecessors, (631897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:50,398 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 489965 states to 489965 states and 631897 transitions.
[2024-10-24 01:49:50,398 INFO  L78                 Accepts]: Start accepts. Automaton has 489965 states and 631897 transitions. Word has length 132
[2024-10-24 01:49:50,399 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-24 01:49:50,399 INFO  L471      AbstractCegarLoop]: Abstraction has 489965 states and 631897 transitions.
[2024-10-24 01:49:50,399 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 12.038461538461538) internal successors, (313), 25 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-24 01:49:50,399 INFO  L276                IsEmpty]: Start isEmpty. Operand 489965 states and 631897 transitions.
[2024-10-24 01:49:51,468 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2024-10-24 01:49:51,471 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-24 01:49:51,471 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-24 01:49:51,486 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2024-10-24 01:49:51,675 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-24 01:49:51,676 INFO  L396      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] ===
[2024-10-24 01:49:51,680 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-24 01:49:51,681 INFO  L85        PathProgramCache]: Analyzing trace with hash 903077242, now seen corresponding path program 1 times
[2024-10-24 01:49:51,681 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-24 01:49:51,681 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944983337]
[2024-10-24 01:49:51,681 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:51,681 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-24 01:49:51,730 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:52,266 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-24 01:49:52,267 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-24 01:49:52,267 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944983337]
[2024-10-24 01:49:52,267 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944983337] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-24 01:49:52,267 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357191275]
[2024-10-24 01:49:52,267 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-24 01:49:52,268 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-24 01:49:52,268 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-24 01:49:52,269 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-24 01:49:52,270 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-10-24 01:49:52,502 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-24 01:49:52,505 INFO  L255         TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 22 conjuncts are in the unsatisfiable core
[2024-10-24 01:49:52,509 INFO  L278         TraceCheckSpWp]: Computing forward predicates...