/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 23:39:57,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 23:39:57,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 23:39:57,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 23:39:57,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 23:39:57,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 23:39:57,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 23:39:57,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 23:39:57,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 23:39:57,302 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 23:39:57,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 23:39:57,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 23:39:57,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 23:39:57,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 23:39:57,304 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 23:39:57,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 23:39:57,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 23:39:57,305 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 23:39:57,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 23:39:57,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 23:39:57,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 23:39:57,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 23:39:57,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 23:39:57,306 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 23:39:57,306 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 23:39:57,306 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 23:39:57,306 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 23:39:57,306 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 23:39:57,307 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 23:39:57,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 23:39:57,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 23:39:57,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 23:39:57,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 23:39:57,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 23:39:57,308 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 23:39:57,308 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 23:39:57,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 23:39:57,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 23:39:57,309 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 23:39:57,309 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 23:39:57,309 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 23:39:57,309 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 23:39:57,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 23:39:57,310 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: Use bitabs translation -> true [2023-12-15 23:39:57,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 23:39:57,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 23:39:57,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 23:39:57,520 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 23:39:57,520 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 23:39:57,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c [2023-12-15 23:39:58,593 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 23:39:59,082 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 23:39:59,084 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c [2023-12-15 23:39:59,135 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46b6d5d53/cf4ef2c49fad4e65984581588e87c59b/FLAGb6f19f7e2 [2023-12-15 23:39:59,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46b6d5d53/cf4ef2c49fad4e65984581588e87c59b [2023-12-15 23:39:59,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 23:39:59,153 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 23:39:59,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 23:39:59,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 23:39:59,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 23:39:59,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:39:59" (1/1) ... [2023-12-15 23:39:59,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d4a189d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:39:59, skipping insertion in model container [2023-12-15 23:39:59,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:39:59" (1/1) ... [2023-12-15 23:39:59,405 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 23:40:00,260 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[172160,172173] [2023-12-15 23:40:00,396 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[250199,250212] [2023-12-15 23:40:00,460 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[289422,289435] [2023-12-15 23:40:00,493 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[309133,309146] [2023-12-15 23:40:00,510 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[319011,319024] [2023-12-15 23:40:00,520 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[323922,323935] [2023-12-15 23:40:00,528 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[328750,328763] [2023-12-15 23:40:00,673 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[405185,405198] [2023-12-15 23:40:00,731 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[443553,443566] [2023-12-15 23:40:00,762 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[463065,463078] [2023-12-15 23:40:00,779 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[472989,473002] [2023-12-15 23:40:00,788 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[477943,477956] [2023-12-15 23:40:00,797 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[482814,482827] [2023-12-15 23:40:00,854 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[521320,521333] [2023-12-15 23:40:00,884 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[540838,540851] [2023-12-15 23:40:00,900 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[550762,550775] [2023-12-15 23:40:00,910 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[555716,555729] [2023-12-15 23:40:00,919 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[560575,560588] [2023-12-15 23:40:00,951 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[581321,581334] [2023-12-15 23:40:00,968 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[591188,591201] [2023-12-15 23:40:00,977 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[596115,596128] [2023-12-15 23:40:00,985 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[600957,600970] [2023-12-15 23:40:00,995 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[606379,606392] [2023-12-15 23:40:01,003 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[611215,611228] [2023-12-15 23:40:01,011 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[616142,616155] [2023-12-15 23:40:01,019 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[620984,620997] [2023-12-15 23:40:01,028 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[626027,626040] [2023-12-15 23:40:01,037 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[631036,631049] [2023-12-15 23:40:01,049 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[635974,635987] [2023-12-15 23:40:01,095 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 23:40:01,121 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 23:40:01,407 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[172160,172173] [2023-12-15 23:40:01,511 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[250199,250212] [2023-12-15 23:40:01,567 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[289422,289435] [2023-12-15 23:40:01,597 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[309133,309146] [2023-12-15 23:40:01,616 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[319011,319024] [2023-12-15 23:40:01,624 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[323922,323935] [2023-12-15 23:40:01,635 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[328750,328763] [2023-12-15 23:40:01,734 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[405185,405198] [2023-12-15 23:40:01,784 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[443553,443566] [2023-12-15 23:40:01,846 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[463065,463078] [2023-12-15 23:40:01,861 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[472989,473002] [2023-12-15 23:40:01,870 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[477943,477956] [2023-12-15 23:40:01,878 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[482814,482827] [2023-12-15 23:40:01,931 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[521320,521333] [2023-12-15 23:40:01,960 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[540838,540851] [2023-12-15 23:40:01,975 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[550762,550775] [2023-12-15 23:40:01,983 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[555716,555729] [2023-12-15 23:40:01,991 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[560575,560588] [2023-12-15 23:40:02,023 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[581321,581334] [2023-12-15 23:40:02,038 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[591188,591201] [2023-12-15 23:40:02,046 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[596115,596128] [2023-12-15 23:40:02,053 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[600957,600970] [2023-12-15 23:40:02,062 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[606379,606392] [2023-12-15 23:40:02,070 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[611215,611228] [2023-12-15 23:40:02,077 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[616142,616155] [2023-12-15 23:40:02,085 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[620984,620997] [2023-12-15 23:40:02,096 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[626027,626040] [2023-12-15 23:40:02,104 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[631036,631049] [2023-12-15 23:40:02,112 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[635974,635987] [2023-12-15 23:40:02,148 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 23:40:02,176 INFO L206 MainTranslator]: Completed translation [2023-12-15 23:40:02,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:40:02 WrapperNode [2023-12-15 23:40:02,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 23:40:02,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 23:40:02,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 23:40:02,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 23:40:02,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:40:02" (1/1) ... [2023-12-15 23:40:02,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:40:02" (1/1) ... [2023-12-15 23:40:02,572 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 28250 [2023-12-15 23:40:02,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 23:40:02,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 23:40:02,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 23:40:02,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 23:40:02,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:40:02" (1/1) ... [2023-12-15 23:40:02,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:40:02" (1/1) ... [2023-12-15 23:40:02,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:40:02" (1/1) ... [2023-12-15 23:40:02,787 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]. [2023-12-15 23:40:02,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:40:02" (1/1) ... [2023-12-15 23:40:02,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:40:02" (1/1) ... [2023-12-15 23:40:02,992 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:40:02" (1/1) ... [2023-12-15 23:40:03,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:40:02" (1/1) ... [2023-12-15 23:40:03,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:40:02" (1/1) ... [2023-12-15 23:40:03,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:40:02" (1/1) ... [2023-12-15 23:40:03,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 23:40:03,184 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 23:40:03,184 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 23:40:03,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 23:40:03,185 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:40:02" (1/1) ... [2023-12-15 23:40:03,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 23:40:03,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:40:03,235 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) [2023-12-15 23:40:03,237 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 [2023-12-15 23:40:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 23:40:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 23:40:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 23:40:03,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 23:40:03,777 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 23:40:03,778 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 23:40:10,857 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 23:40:11,107 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 23:40:11,107 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-15 23:40:11,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:40:11 BoogieIcfgContainer [2023-12-15 23:40:11,108 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 23:40:11,109 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 23:40:11,109 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 23:40:11,111 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 23:40:11,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:39:59" (1/3) ... [2023-12-15 23:40:11,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f076317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:40:11, skipping insertion in model container [2023-12-15 23:40:11,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:40:02" (2/3) ... [2023-12-15 23:40:11,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f076317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:40:11, skipping insertion in model container [2023-12-15 23:40:11,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:40:11" (3/3) ... [2023-12-15 23:40:11,113 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c [2023-12-15 23:40:11,125 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 23:40:11,125 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2023-12-15 23:40:11,198 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 23:40:11,202 INFO L357 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, mHoare=true, 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;@7faf15f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 23:40:11,203 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-12-15 23:40:11,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 5465 states, 5435 states have (on average 1.7494020239190433) internal successors, (9508), 5464 states have internal predecessors, (9508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-15 23:40:11,242 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:11,242 INFO L195 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] [2023-12-15 23:40:11,243 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:11,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:11,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1843961460, now seen corresponding path program 1 times [2023-12-15 23:40:11,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:11,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745712520] [2023-12-15 23:40:11,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:11,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:11,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:11,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745712520] [2023-12-15 23:40:11,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745712520] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:11,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:11,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:40:11,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182368992] [2023-12-15 23:40:11,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:11,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:40:11,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:11,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:40:11,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:40:11,815 INFO L87 Difference]: Start difference. First operand has 5465 states, 5435 states have (on average 1.7494020239190433) internal successors, (9508), 5464 states have internal predecessors, (9508), 0 states have call successors, (0), 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 20.2) internal successors, (101), 4 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) [2023-12-15 23:40:15,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:15,114 INFO L93 Difference]: Finished difference Result 7467 states and 12787 transitions. [2023-12-15 23:40:15,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:40:15,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 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 [2023-12-15 23:40:15,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:15,154 INFO L225 Difference]: With dead ends: 7467 [2023-12-15 23:40:15,154 INFO L226 Difference]: Without dead ends: 4951 [2023-12-15 23:40:15,165 INFO L412 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 [2023-12-15 23:40:15,168 INFO L413 NwaCegarLoop]: 4240 mSDtfsCounter, 24929 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4159 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24929 SdHoareTripleChecker+Valid, 4344 SdHoareTripleChecker+Invalid, 4288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 4159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:15,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24929 Valid, 4344 Invalid, 4288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 4159 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-12-15 23:40:15,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4951 states. [2023-12-15 23:40:15,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4951 to 4951. [2023-12-15 23:40:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4951 states, 4922 states have (on average 1.2984559122308006) internal successors, (6391), 4950 states have internal predecessors, (6391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:15,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4951 states to 4951 states and 6391 transitions. [2023-12-15 23:40:15,292 INFO L78 Accepts]: Start accepts. Automaton has 4951 states and 6391 transitions. Word has length 101 [2023-12-15 23:40:15,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:15,292 INFO L495 AbstractCegarLoop]: Abstraction has 4951 states and 6391 transitions. [2023-12-15 23:40:15,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 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) [2023-12-15 23:40:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 4951 states and 6391 transitions. [2023-12-15 23:40:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-15 23:40:15,303 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:15,303 INFO L195 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] [2023-12-15 23:40:15,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 23:40:15,304 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:15,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:15,305 INFO L85 PathProgramCache]: Analyzing trace with hash -564189146, now seen corresponding path program 1 times [2023-12-15 23:40:15,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:15,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381215685] [2023-12-15 23:40:15,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:15,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:15,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:15,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381215685] [2023-12-15 23:40:15,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381215685] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:15,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:15,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:40:15,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388524137] [2023-12-15 23:40:15,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:15,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:40:15,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:15,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:40:15,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:40:15,598 INFO L87 Difference]: Start difference. First operand 4951 states and 6391 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 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) [2023-12-15 23:40:17,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:17,110 INFO L93 Difference]: Finished difference Result 6083 states and 7846 transitions. [2023-12-15 23:40:17,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:40:17,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 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 [2023-12-15 23:40:17,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:17,121 INFO L225 Difference]: With dead ends: 6083 [2023-12-15 23:40:17,121 INFO L226 Difference]: Without dead ends: 3651 [2023-12-15 23:40:17,137 INFO L412 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 [2023-12-15 23:40:17,137 INFO L413 NwaCegarLoop]: 2186 mSDtfsCounter, 14196 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14196 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 2623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:17,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14196 Valid, 2206 Invalid, 2623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2586 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-15 23:40:17,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states. [2023-12-15 23:40:17,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 3651. [2023-12-15 23:40:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3651 states, 3622 states have (on average 1.3169519602429598) internal successors, (4770), 3650 states have internal predecessors, (4770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 4770 transitions. [2023-12-15 23:40:17,188 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 4770 transitions. Word has length 101 [2023-12-15 23:40:17,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:17,190 INFO L495 AbstractCegarLoop]: Abstraction has 3651 states and 4770 transitions. [2023-12-15 23:40:17,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 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) [2023-12-15 23:40:17,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 4770 transitions. [2023-12-15 23:40:17,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-15 23:40:17,198 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:17,198 INFO L195 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] [2023-12-15 23:40:17,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 23:40:17,199 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:17,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:17,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1247482897, now seen corresponding path program 1 times [2023-12-15 23:40:17,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:17,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520274892] [2023-12-15 23:40:17,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:17,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:17,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:17,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520274892] [2023-12-15 23:40:17,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520274892] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:17,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:17,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:40:17,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431501382] [2023-12-15 23:40:17,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:17,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:40:17,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:17,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:40:17,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:40:17,522 INFO L87 Difference]: Start difference. First operand 3651 states and 4770 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 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) [2023-12-15 23:40:18,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:18,962 INFO L93 Difference]: Finished difference Result 4495 states and 5840 transitions. [2023-12-15 23:40:18,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:40:18,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 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 [2023-12-15 23:40:18,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:18,970 INFO L225 Difference]: With dead ends: 4495 [2023-12-15 23:40:18,970 INFO L226 Difference]: Without dead ends: 2719 [2023-12-15 23:40:18,972 INFO L412 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 [2023-12-15 23:40:18,973 INFO L413 NwaCegarLoop]: 1678 mSDtfsCounter, 10619 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10619 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:18,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10619 Valid, 1706 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-15 23:40:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2023-12-15 23:40:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2719. [2023-12-15 23:40:19,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2719 states, 2690 states have (on average 1.3312267657992565) internal successors, (3581), 2718 states have internal predecessors, (3581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:19,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 3581 transitions. [2023-12-15 23:40:19,073 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 3581 transitions. Word has length 101 [2023-12-15 23:40:19,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:19,073 INFO L495 AbstractCegarLoop]: Abstraction has 2719 states and 3581 transitions. [2023-12-15 23:40:19,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 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) [2023-12-15 23:40:19,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 3581 transitions. [2023-12-15 23:40:19,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-15 23:40:19,101 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:19,101 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:40:19,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 23:40:19,102 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:19,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:19,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1413940705, now seen corresponding path program 1 times [2023-12-15 23:40:19,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:19,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711191659] [2023-12-15 23:40:19,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:19,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:19,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:19,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:19,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711191659] [2023-12-15 23:40:19,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711191659] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:19,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:19,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:40:19,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533945710] [2023-12-15 23:40:19,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:19,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:40:19,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:19,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:40:19,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:40:19,325 INFO L87 Difference]: Start difference. First operand 2719 states and 3581 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:21,062 INFO L93 Difference]: Finished difference Result 5190 states and 6870 transitions. [2023-12-15 23:40:21,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:40:21,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2023-12-15 23:40:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:21,090 INFO L225 Difference]: With dead ends: 5190 [2023-12-15 23:40:21,091 INFO L226 Difference]: Without dead ends: 3794 [2023-12-15 23:40:21,095 INFO L412 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 [2023-12-15 23:40:21,097 INFO L413 NwaCegarLoop]: 1651 mSDtfsCounter, 13357 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 2552 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13357 SdHoareTripleChecker+Valid, 2502 SdHoareTripleChecker+Invalid, 2563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:21,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13357 Valid, 2502 Invalid, 2563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2552 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-15 23:40:21,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3794 states. [2023-12-15 23:40:21,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3794 to 3595. [2023-12-15 23:40:21,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3595 states, 3566 states have (on average 1.3611890072910824) internal successors, (4854), 3594 states have internal predecessors, (4854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 4854 transitions. [2023-12-15 23:40:21,182 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 4854 transitions. Word has length 103 [2023-12-15 23:40:21,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:21,183 INFO L495 AbstractCegarLoop]: Abstraction has 3595 states and 4854 transitions. [2023-12-15 23:40:21,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 4854 transitions. [2023-12-15 23:40:21,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-15 23:40:21,188 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:21,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:40:21,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 23:40:21,189 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:21,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:21,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2001631897, now seen corresponding path program 1 times [2023-12-15 23:40:21,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:21,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235803833] [2023-12-15 23:40:21,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:21,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:21,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:21,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:21,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235803833] [2023-12-15 23:40:21,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235803833] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:21,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:21,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:40:21,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918345442] [2023-12-15 23:40:21,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:21,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:40:21,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:21,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:40:21,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:40:21,419 INFO L87 Difference]: Start difference. First operand 3595 states and 4854 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:22,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:22,670 INFO L93 Difference]: Finished difference Result 5207 states and 7044 transitions. [2023-12-15 23:40:22,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:40:22,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2023-12-15 23:40:22,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:22,679 INFO L225 Difference]: With dead ends: 5207 [2023-12-15 23:40:22,679 INFO L226 Difference]: Without dead ends: 3372 [2023-12-15 23:40:22,684 INFO L412 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 [2023-12-15 23:40:22,685 INFO L413 NwaCegarLoop]: 1562 mSDtfsCounter, 9364 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9364 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:22,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9364 Valid, 1574 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-15 23:40:22,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2023-12-15 23:40:22,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 3372. [2023-12-15 23:40:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3372 states, 3343 states have (on average 1.3691295243793) internal successors, (4577), 3371 states have internal predecessors, (4577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 3372 states and 4577 transitions. [2023-12-15 23:40:22,740 INFO L78 Accepts]: Start accepts. Automaton has 3372 states and 4577 transitions. Word has length 105 [2023-12-15 23:40:22,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:22,741 INFO L495 AbstractCegarLoop]: Abstraction has 3372 states and 4577 transitions. [2023-12-15 23:40:22,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:22,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3372 states and 4577 transitions. [2023-12-15 23:40:22,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-15 23:40:22,745 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:22,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:40:22,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 23:40:22,746 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:22,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:22,746 INFO L85 PathProgramCache]: Analyzing trace with hash -807434659, now seen corresponding path program 1 times [2023-12-15 23:40:22,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:22,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784803108] [2023-12-15 23:40:22,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:22,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:22,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:22,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784803108] [2023-12-15 23:40:22,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784803108] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:22,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:22,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:40:22,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481671947] [2023-12-15 23:40:22,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:22,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:40:22,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:22,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:40:22,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:40:22,952 INFO L87 Difference]: Start difference. First operand 3372 states and 4577 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:23,774 INFO L93 Difference]: Finished difference Result 3763 states and 5049 transitions. [2023-12-15 23:40:23,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:40:23,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2023-12-15 23:40:23,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:23,779 INFO L225 Difference]: With dead ends: 3763 [2023-12-15 23:40:23,779 INFO L226 Difference]: Without dead ends: 2161 [2023-12-15 23:40:23,781 INFO L412 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 [2023-12-15 23:40:23,782 INFO L413 NwaCegarLoop]: 1001 mSDtfsCounter, 5826 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5826 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:23,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5826 Valid, 1045 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-15 23:40:23,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2023-12-15 23:40:23,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 2161. [2023-12-15 23:40:23,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2161 states, 2132 states have (on average 1.3813320825515947) internal successors, (2945), 2160 states have internal predecessors, (2945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:23,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 2945 transitions. [2023-12-15 23:40:23,809 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 2945 transitions. Word has length 107 [2023-12-15 23:40:23,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:23,809 INFO L495 AbstractCegarLoop]: Abstraction has 2161 states and 2945 transitions. [2023-12-15 23:40:23,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2945 transitions. [2023-12-15 23:40:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-15 23:40:23,813 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:23,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:40:23,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 23:40:23,813 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:23,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:23,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1740881091, now seen corresponding path program 1 times [2023-12-15 23:40:23,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:23,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014699834] [2023-12-15 23:40:23,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:23,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:23,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:23,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014699834] [2023-12-15 23:40:23,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014699834] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:23,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:23,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:40:23,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704038444] [2023-12-15 23:40:23,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:23,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:40:23,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:23,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:40:23,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:40:23,987 INFO L87 Difference]: Start difference. First operand 2161 states and 2945 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:24,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:24,582 INFO L93 Difference]: Finished difference Result 2834 states and 3838 transitions. [2023-12-15 23:40:24,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:40:24,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2023-12-15 23:40:24,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:24,588 INFO L225 Difference]: With dead ends: 2834 [2023-12-15 23:40:24,588 INFO L226 Difference]: Without dead ends: 1733 [2023-12-15 23:40:24,590 INFO L412 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 [2023-12-15 23:40:24,590 INFO L413 NwaCegarLoop]: 888 mSDtfsCounter, 4688 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4688 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:24,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4688 Valid, 924 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 23:40:24,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2023-12-15 23:40:24,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1733. [2023-12-15 23:40:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3943661971830985) internal successors, (2376), 1732 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:24,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2376 transitions. [2023-12-15 23:40:24,621 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2376 transitions. Word has length 109 [2023-12-15 23:40:24,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:24,621 INFO L495 AbstractCegarLoop]: Abstraction has 1733 states and 2376 transitions. [2023-12-15 23:40:24,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:24,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2376 transitions. [2023-12-15 23:40:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-15 23:40:24,625 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:24,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:40:24,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 23:40:24,626 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:24,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:24,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1649960662, now seen corresponding path program 1 times [2023-12-15 23:40:24,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:24,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467688957] [2023-12-15 23:40:24,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:24,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:25,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:25,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467688957] [2023-12-15 23:40:25,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467688957] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:25,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:25,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:40:25,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503074667] [2023-12-15 23:40:25,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:25,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:40:25,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:25,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:40:25,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:40:25,135 INFO L87 Difference]: Start difference. First operand 1733 states and 2376 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:26,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:26,721 INFO L93 Difference]: Finished difference Result 3063 states and 4220 transitions. [2023-12-15 23:40:26,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:40:26,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2023-12-15 23:40:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:26,731 INFO L225 Difference]: With dead ends: 3063 [2023-12-15 23:40:26,731 INFO L226 Difference]: Without dead ends: 2644 [2023-12-15 23:40:26,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2023-12-15 23:40:26,732 INFO L413 NwaCegarLoop]: 976 mSDtfsCounter, 5082 mSDsluCounter, 2996 mSDsCounter, 0 mSdLazyCounter, 2942 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5082 SdHoareTripleChecker+Valid, 3972 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:26,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5082 Valid, 3972 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2942 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-15 23:40:26,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2023-12-15 23:40:26,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 1733. [2023-12-15 23:40:26,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3937793427230047) internal successors, (2375), 1732 states have internal predecessors, (2375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2375 transitions. [2023-12-15 23:40:26,781 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2375 transitions. Word has length 111 [2023-12-15 23:40:26,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:26,781 INFO L495 AbstractCegarLoop]: Abstraction has 1733 states and 2375 transitions. [2023-12-15 23:40:26,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:26,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2375 transitions. [2023-12-15 23:40:26,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-15 23:40:26,784 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:26,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:40:26,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 23:40:26,784 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:26,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:26,784 INFO L85 PathProgramCache]: Analyzing trace with hash 258839018, now seen corresponding path program 1 times [2023-12-15 23:40:26,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:26,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140521886] [2023-12-15 23:40:26,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:26,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:27,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:27,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:27,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140521886] [2023-12-15 23:40:27,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140521886] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:27,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:27,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:40:27,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543816527] [2023-12-15 23:40:27,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:27,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:40:27,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:27,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:40:27,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:40:27,096 INFO L87 Difference]: Start difference. First operand 1733 states and 2375 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:28,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:28,296 INFO L93 Difference]: Finished difference Result 3128 states and 4308 transitions. [2023-12-15 23:40:28,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:40:28,296 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2023-12-15 23:40:28,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:28,307 INFO L225 Difference]: With dead ends: 3128 [2023-12-15 23:40:28,307 INFO L226 Difference]: Without dead ends: 2944 [2023-12-15 23:40:28,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2023-12-15 23:40:28,325 INFO L413 NwaCegarLoop]: 972 mSDtfsCounter, 4584 mSDsluCounter, 3176 mSDsCounter, 0 mSdLazyCounter, 3174 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4584 SdHoareTripleChecker+Valid, 4148 SdHoareTripleChecker+Invalid, 3178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:28,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4584 Valid, 4148 Invalid, 3178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3174 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-15 23:40:28,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2023-12-15 23:40:28,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1733. [2023-12-15 23:40:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3931924882629108) internal successors, (2374), 1732 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2374 transitions. [2023-12-15 23:40:28,372 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2374 transitions. Word has length 111 [2023-12-15 23:40:28,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:28,373 INFO L495 AbstractCegarLoop]: Abstraction has 1733 states and 2374 transitions. [2023-12-15 23:40:28,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2374 transitions. [2023-12-15 23:40:28,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-15 23:40:28,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:28,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:40:28,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 23:40:28,376 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:28,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:28,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1796391338, now seen corresponding path program 1 times [2023-12-15 23:40:28,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:28,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918231213] [2023-12-15 23:40:28,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:28,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:28,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:28,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:28,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918231213] [2023-12-15 23:40:28,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918231213] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:28,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:28,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 23:40:28,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939055452] [2023-12-15 23:40:28,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:28,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 23:40:28,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:28,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 23:40:28,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-15 23:40:28,878 INFO L87 Difference]: Start difference. First operand 1733 states and 2374 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:30,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:30,515 INFO L93 Difference]: Finished difference Result 3127 states and 4308 transitions. [2023-12-15 23:40:30,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 23:40:30,515 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2023-12-15 23:40:30,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:30,519 INFO L225 Difference]: With dead ends: 3127 [2023-12-15 23:40:30,519 INFO L226 Difference]: Without dead ends: 2936 [2023-12-15 23:40:30,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2023-12-15 23:40:30,521 INFO L413 NwaCegarLoop]: 972 mSDtfsCounter, 7655 mSDsluCounter, 3978 mSDsCounter, 0 mSdLazyCounter, 3722 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7655 SdHoareTripleChecker+Valid, 4950 SdHoareTripleChecker+Invalid, 3728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:30,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7655 Valid, 4950 Invalid, 3728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3722 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-15 23:40:30,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2023-12-15 23:40:30,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1733. [2023-12-15 23:40:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.392018779342723) internal successors, (2372), 1732 states have internal predecessors, (2372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2372 transitions. [2023-12-15 23:40:30,545 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2372 transitions. Word has length 111 [2023-12-15 23:40:30,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:30,545 INFO L495 AbstractCegarLoop]: Abstraction has 1733 states and 2372 transitions. [2023-12-15 23:40:30,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:30,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2372 transitions. [2023-12-15 23:40:30,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-15 23:40:30,547 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:30,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:40:30,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 23:40:30,548 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:30,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:30,549 INFO L85 PathProgramCache]: Analyzing trace with hash 326600490, now seen corresponding path program 1 times [2023-12-15 23:40:30,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:30,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316816407] [2023-12-15 23:40:30,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:30,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:31,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:31,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316816407] [2023-12-15 23:40:31,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316816407] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:31,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:31,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 23:40:31,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179116999] [2023-12-15 23:40:31,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:31,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 23:40:31,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:31,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 23:40:31,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-15 23:40:31,086 INFO L87 Difference]: Start difference. First operand 1733 states and 2372 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:32,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:32,467 INFO L93 Difference]: Finished difference Result 3127 states and 4304 transitions. [2023-12-15 23:40:32,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 23:40:32,467 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2023-12-15 23:40:32,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:32,471 INFO L225 Difference]: With dead ends: 3127 [2023-12-15 23:40:32,471 INFO L226 Difference]: Without dead ends: 2936 [2023-12-15 23:40:32,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2023-12-15 23:40:32,472 INFO L413 NwaCegarLoop]: 972 mSDtfsCounter, 4953 mSDsluCounter, 3978 mSDsCounter, 0 mSdLazyCounter, 3716 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4953 SdHoareTripleChecker+Valid, 4950 SdHoareTripleChecker+Invalid, 3720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:32,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4953 Valid, 4950 Invalid, 3720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3716 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-15 23:40:32,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2023-12-15 23:40:32,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1733. [2023-12-15 23:40:32,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3908450704225352) internal successors, (2370), 1732 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:32,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2370 transitions. [2023-12-15 23:40:32,493 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2370 transitions. Word has length 111 [2023-12-15 23:40:32,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:32,493 INFO L495 AbstractCegarLoop]: Abstraction has 1733 states and 2370 transitions. [2023-12-15 23:40:32,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:32,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2370 transitions. [2023-12-15 23:40:32,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-15 23:40:32,496 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:32,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:40:32,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 23:40:32,496 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:32,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:32,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1875669866, now seen corresponding path program 1 times [2023-12-15 23:40:32,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:32,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815045962] [2023-12-15 23:40:32,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:32,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:32,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:32,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:32,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815045962] [2023-12-15 23:40:32,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815045962] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:32,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:32,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 23:40:32,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651076105] [2023-12-15 23:40:32,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:32,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 23:40:32,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:32,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 23:40:32,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-15 23:40:32,899 INFO L87 Difference]: Start difference. First operand 1733 states and 2370 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:34,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:34,636 INFO L93 Difference]: Finished difference Result 2955 states and 4042 transitions. [2023-12-15 23:40:34,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 23:40:34,636 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2023-12-15 23:40:34,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:34,640 INFO L225 Difference]: With dead ends: 2955 [2023-12-15 23:40:34,640 INFO L226 Difference]: Without dead ends: 2936 [2023-12-15 23:40:34,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2023-12-15 23:40:34,642 INFO L413 NwaCegarLoop]: 972 mSDtfsCounter, 7289 mSDsluCounter, 3971 mSDsCounter, 0 mSdLazyCounter, 3710 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7289 SdHoareTripleChecker+Valid, 4943 SdHoareTripleChecker+Invalid, 3715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:34,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7289 Valid, 4943 Invalid, 3715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3710 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-15 23:40:34,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2023-12-15 23:40:34,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1733. [2023-12-15 23:40:34,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3896713615023475) internal successors, (2368), 1732 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2368 transitions. [2023-12-15 23:40:34,663 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2368 transitions. Word has length 111 [2023-12-15 23:40:34,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:34,663 INFO L495 AbstractCegarLoop]: Abstraction has 1733 states and 2368 transitions. [2023-12-15 23:40:34,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:34,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2368 transitions. [2023-12-15 23:40:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-15 23:40:34,665 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:34,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:40:34,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 23:40:34,666 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:34,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:34,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1597389270, now seen corresponding path program 1 times [2023-12-15 23:40:34,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:34,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720226000] [2023-12-15 23:40:34,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:34,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:35,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:35,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720226000] [2023-12-15 23:40:35,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720226000] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:35,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:35,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 23:40:35,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139726885] [2023-12-15 23:40:35,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:35,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 23:40:35,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:35,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 23:40:35,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-15 23:40:35,048 INFO L87 Difference]: Start difference. First operand 1733 states and 2368 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:36,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:36,698 INFO L93 Difference]: Finished difference Result 3203 states and 4415 transitions. [2023-12-15 23:40:36,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 23:40:36,699 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2023-12-15 23:40:36,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:36,703 INFO L225 Difference]: With dead ends: 3203 [2023-12-15 23:40:36,703 INFO L226 Difference]: Without dead ends: 2984 [2023-12-15 23:40:36,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2023-12-15 23:40:36,704 INFO L413 NwaCegarLoop]: 988 mSDtfsCounter, 4790 mSDsluCounter, 4153 mSDsCounter, 0 mSdLazyCounter, 3796 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4790 SdHoareTripleChecker+Valid, 5141 SdHoareTripleChecker+Invalid, 3801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:36,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4790 Valid, 5141 Invalid, 3801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3796 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-15 23:40:36,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2023-12-15 23:40:36,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 1733. [2023-12-15 23:40:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3884976525821595) internal successors, (2366), 1732 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2366 transitions. [2023-12-15 23:40:36,726 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2366 transitions. Word has length 111 [2023-12-15 23:40:36,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:36,726 INFO L495 AbstractCegarLoop]: Abstraction has 1733 states and 2366 transitions. [2023-12-15 23:40:36,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:36,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2366 transitions. [2023-12-15 23:40:36,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-15 23:40:36,728 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:36,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:40:36,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 23:40:36,729 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:36,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:36,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1513726294, now seen corresponding path program 1 times [2023-12-15 23:40:36,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:36,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601084493] [2023-12-15 23:40:36,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:36,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:37,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:37,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:37,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601084493] [2023-12-15 23:40:37,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601084493] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:37,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:37,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 23:40:37,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662082870] [2023-12-15 23:40:37,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:37,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 23:40:37,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:37,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 23:40:37,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-15 23:40:37,181 INFO L87 Difference]: Start difference. First operand 1733 states and 2366 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:38,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:38,829 INFO L93 Difference]: Finished difference Result 3127 states and 4294 transitions. [2023-12-15 23:40:38,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 23:40:38,829 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2023-12-15 23:40:38,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:38,860 INFO L225 Difference]: With dead ends: 3127 [2023-12-15 23:40:38,860 INFO L226 Difference]: Without dead ends: 2936 [2023-12-15 23:40:38,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2023-12-15 23:40:38,862 INFO L413 NwaCegarLoop]: 1000 mSDtfsCounter, 4868 mSDsluCounter, 4091 mSDsCounter, 0 mSdLazyCounter, 3772 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4868 SdHoareTripleChecker+Valid, 5091 SdHoareTripleChecker+Invalid, 3776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:38,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4868 Valid, 5091 Invalid, 3776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3772 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-15 23:40:38,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2023-12-15 23:40:38,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1733. [2023-12-15 23:40:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3873239436619718) internal successors, (2364), 1732 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2364 transitions. [2023-12-15 23:40:38,902 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2364 transitions. Word has length 111 [2023-12-15 23:40:38,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:38,902 INFO L495 AbstractCegarLoop]: Abstraction has 1733 states and 2364 transitions. [2023-12-15 23:40:38,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:38,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2364 transitions. [2023-12-15 23:40:38,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-15 23:40:38,905 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:38,910 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:40:38,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 23:40:38,910 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:38,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:38,910 INFO L85 PathProgramCache]: Analyzing trace with hash -809053590, now seen corresponding path program 1 times [2023-12-15 23:40:38,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:38,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197738882] [2023-12-15 23:40:38,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:38,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:39,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:39,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:39,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197738882] [2023-12-15 23:40:39,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197738882] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:39,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:39,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 23:40:39,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963462353] [2023-12-15 23:40:39,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:39,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 23:40:39,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:39,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 23:40:39,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-15 23:40:39,299 INFO L87 Difference]: Start difference. First operand 1733 states and 2364 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:41,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:41,001 INFO L93 Difference]: Finished difference Result 3350 states and 4589 transitions. [2023-12-15 23:40:41,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 23:40:41,002 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2023-12-15 23:40:41,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:41,005 INFO L225 Difference]: With dead ends: 3350 [2023-12-15 23:40:41,005 INFO L226 Difference]: Without dead ends: 2636 [2023-12-15 23:40:41,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2023-12-15 23:40:41,007 INFO L413 NwaCegarLoop]: 1001 mSDtfsCounter, 8447 mSDsluCounter, 3910 mSDsCounter, 0 mSdLazyCounter, 3596 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8447 SdHoareTripleChecker+Valid, 4911 SdHoareTripleChecker+Invalid, 3602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:41,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8447 Valid, 4911 Invalid, 3602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3596 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-15 23:40:41,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2023-12-15 23:40:41,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 1733. [2023-12-15 23:40:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.386150234741784) internal successors, (2362), 1732 states have internal predecessors, (2362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:41,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2362 transitions. [2023-12-15 23:40:41,025 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2362 transitions. Word has length 111 [2023-12-15 23:40:41,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:41,026 INFO L495 AbstractCegarLoop]: Abstraction has 1733 states and 2362 transitions. [2023-12-15 23:40:41,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:41,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2362 transitions. [2023-12-15 23:40:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 23:40:41,028 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:41,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:40:41,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 23:40:41,028 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:41,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:41,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1942312309, now seen corresponding path program 1 times [2023-12-15 23:40:41,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:41,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565660911] [2023-12-15 23:40:41,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:41,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:41,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:41,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565660911] [2023-12-15 23:40:41,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565660911] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:41,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:41,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:40:41,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862710839] [2023-12-15 23:40:41,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:41,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:40:41,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:41,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:40:41,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:40:41,296 INFO L87 Difference]: Start difference. First operand 1733 states and 2362 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:42,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:42,852 INFO L93 Difference]: Finished difference Result 3124 states and 4285 transitions. [2023-12-15 23:40:42,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:40:42,852 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2023-12-15 23:40:42,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:42,855 INFO L225 Difference]: With dead ends: 3124 [2023-12-15 23:40:42,855 INFO L226 Difference]: Without dead ends: 2944 [2023-12-15 23:40:42,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2023-12-15 23:40:42,857 INFO L413 NwaCegarLoop]: 1000 mSDtfsCounter, 4511 mSDsluCounter, 3262 mSDsCounter, 0 mSdLazyCounter, 3204 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4511 SdHoareTripleChecker+Valid, 4262 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:42,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4511 Valid, 4262 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3204 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-15 23:40:42,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2023-12-15 23:40:42,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1733. [2023-12-15 23:40:42,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3855633802816902) internal successors, (2361), 1732 states have internal predecessors, (2361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2361 transitions. [2023-12-15 23:40:42,874 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2361 transitions. Word has length 112 [2023-12-15 23:40:42,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:42,874 INFO L495 AbstractCegarLoop]: Abstraction has 1733 states and 2361 transitions. [2023-12-15 23:40:42,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:42,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2361 transitions. [2023-12-15 23:40:42,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 23:40:42,876 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:42,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:40:42,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 23:40:42,876 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:42,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:42,877 INFO L85 PathProgramCache]: Analyzing trace with hash 949221365, now seen corresponding path program 1 times [2023-12-15 23:40:42,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:42,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655473081] [2023-12-15 23:40:42,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:42,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:43,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:43,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655473081] [2023-12-15 23:40:43,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655473081] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:43,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:43,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:40:43,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251925610] [2023-12-15 23:40:43,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:43,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:40:43,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:43,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:40:43,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:40:43,160 INFO L87 Difference]: Start difference. First operand 1733 states and 2361 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:44,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:44,590 INFO L93 Difference]: Finished difference Result 3124 states and 4283 transitions. [2023-12-15 23:40:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:40:44,591 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2023-12-15 23:40:44,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:44,594 INFO L225 Difference]: With dead ends: 3124 [2023-12-15 23:40:44,594 INFO L226 Difference]: Without dead ends: 2944 [2023-12-15 23:40:44,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2023-12-15 23:40:44,595 INFO L413 NwaCegarLoop]: 1000 mSDtfsCounter, 6778 mSDsluCounter, 3262 mSDsCounter, 0 mSdLazyCounter, 3199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6778 SdHoareTripleChecker+Valid, 4262 SdHoareTripleChecker+Invalid, 3203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:44,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6778 Valid, 4262 Invalid, 3203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3199 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-15 23:40:44,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2023-12-15 23:40:44,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1733. [2023-12-15 23:40:44,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3849765258215962) internal successors, (2360), 1732 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:44,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2360 transitions. [2023-12-15 23:40:44,612 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2360 transitions. Word has length 112 [2023-12-15 23:40:44,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:44,612 INFO L495 AbstractCegarLoop]: Abstraction has 1733 states and 2360 transitions. [2023-12-15 23:40:44,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2360 transitions. [2023-12-15 23:40:44,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 23:40:44,614 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:44,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:40:44,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 23:40:44,615 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:44,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:44,615 INFO L85 PathProgramCache]: Analyzing trace with hash -325639403, now seen corresponding path program 1 times [2023-12-15 23:40:44,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:44,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467285416] [2023-12-15 23:40:44,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:44,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:44,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:44,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:44,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467285416] [2023-12-15 23:40:44,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467285416] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:44,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:44,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:40:44,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322695664] [2023-12-15 23:40:44,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:44,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:40:44,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:44,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:40:44,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:40:44,870 INFO L87 Difference]: Start difference. First operand 1733 states and 2360 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:46,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:46,391 INFO L93 Difference]: Finished difference Result 3029 states and 4122 transitions. [2023-12-15 23:40:46,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:40:46,391 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2023-12-15 23:40:46,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:46,408 INFO L225 Difference]: With dead ends: 3029 [2023-12-15 23:40:46,408 INFO L226 Difference]: Without dead ends: 2856 [2023-12-15 23:40:46,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2023-12-15 23:40:46,410 INFO L413 NwaCegarLoop]: 1008 mSDtfsCounter, 6684 mSDsluCounter, 3126 mSDsCounter, 0 mSdLazyCounter, 3262 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6684 SdHoareTripleChecker+Valid, 4134 SdHoareTripleChecker+Invalid, 3266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:46,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6684 Valid, 4134 Invalid, 3266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3262 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-15 23:40:46,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2023-12-15 23:40:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 1733. [2023-12-15 23:40:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3843896713615023) internal successors, (2359), 1732 states have internal predecessors, (2359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2359 transitions. [2023-12-15 23:40:46,439 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2359 transitions. Word has length 112 [2023-12-15 23:40:46,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:46,439 INFO L495 AbstractCegarLoop]: Abstraction has 1733 states and 2359 transitions. [2023-12-15 23:40:46,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2359 transitions. [2023-12-15 23:40:46,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 23:40:46,441 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:46,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:40:46,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 23:40:46,442 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:46,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:46,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1902759851, now seen corresponding path program 1 times [2023-12-15 23:40:46,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:46,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013758175] [2023-12-15 23:40:46,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:46,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:46,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:46,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:46,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013758175] [2023-12-15 23:40:46,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013758175] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:46,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:46,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:40:46,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295481612] [2023-12-15 23:40:46,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:46,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:40:46,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:46,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:40:46,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:40:46,743 INFO L87 Difference]: Start difference. First operand 1733 states and 2359 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:48,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:48,097 INFO L93 Difference]: Finished difference Result 3124 states and 4279 transitions. [2023-12-15 23:40:48,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:40:48,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2023-12-15 23:40:48,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:48,100 INFO L225 Difference]: With dead ends: 3124 [2023-12-15 23:40:48,100 INFO L226 Difference]: Without dead ends: 2944 [2023-12-15 23:40:48,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2023-12-15 23:40:48,101 INFO L413 NwaCegarLoop]: 1000 mSDtfsCounter, 6743 mSDsluCounter, 3265 mSDsCounter, 0 mSdLazyCounter, 3187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6743 SdHoareTripleChecker+Valid, 4265 SdHoareTripleChecker+Invalid, 3191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:48,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6743 Valid, 4265 Invalid, 3191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3187 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-15 23:40:48,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2023-12-15 23:40:48,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1733. [2023-12-15 23:40:48,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3838028169014085) internal successors, (2358), 1732 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2358 transitions. [2023-12-15 23:40:48,134 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2358 transitions. Word has length 112 [2023-12-15 23:40:48,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:48,134 INFO L495 AbstractCegarLoop]: Abstraction has 1733 states and 2358 transitions. [2023-12-15 23:40:48,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2358 transitions. [2023-12-15 23:40:48,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 23:40:48,160 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:48,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:40:48,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 23:40:48,160 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:48,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:48,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1084613269, now seen corresponding path program 1 times [2023-12-15 23:40:48,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:48,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357097134] [2023-12-15 23:40:48,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:48,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:48,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:48,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:48,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357097134] [2023-12-15 23:40:48,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357097134] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:48,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:48,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 23:40:48,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560734777] [2023-12-15 23:40:48,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:48,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 23:40:48,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:48,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 23:40:48,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-15 23:40:48,548 INFO L87 Difference]: Start difference. First operand 1733 states and 2358 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:50,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:50,328 INFO L93 Difference]: Finished difference Result 3205 states and 4405 transitions. [2023-12-15 23:40:50,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 23:40:50,329 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2023-12-15 23:40:50,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:50,333 INFO L225 Difference]: With dead ends: 3205 [2023-12-15 23:40:50,333 INFO L226 Difference]: Without dead ends: 2984 [2023-12-15 23:40:50,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2023-12-15 23:40:50,335 INFO L413 NwaCegarLoop]: 937 mSDtfsCounter, 5056 mSDsluCounter, 3952 mSDsCounter, 0 mSdLazyCounter, 3515 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5056 SdHoareTripleChecker+Valid, 4889 SdHoareTripleChecker+Invalid, 3520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:50,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5056 Valid, 4889 Invalid, 3520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3515 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-15 23:40:50,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2023-12-15 23:40:50,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 1733. [2023-12-15 23:40:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3826291079812207) internal successors, (2356), 1732 states have internal predecessors, (2356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:50,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2356 transitions. [2023-12-15 23:40:50,357 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2356 transitions. Word has length 112 [2023-12-15 23:40:50,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:50,358 INFO L495 AbstractCegarLoop]: Abstraction has 1733 states and 2356 transitions. [2023-12-15 23:40:50,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2356 transitions. [2023-12-15 23:40:50,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 23:40:50,360 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:50,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:40:50,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-15 23:40:50,361 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:50,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:50,361 INFO L85 PathProgramCache]: Analyzing trace with hash -530315659, now seen corresponding path program 1 times [2023-12-15 23:40:50,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:50,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642260785] [2023-12-15 23:40:50,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:50,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:50,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:50,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:50,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642260785] [2023-12-15 23:40:50,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642260785] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:50,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:50,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 23:40:50,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679143203] [2023-12-15 23:40:50,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:50,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 23:40:50,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:50,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 23:40:50,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-15 23:40:50,661 INFO L87 Difference]: Start difference. First operand 1733 states and 2356 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:52,351 INFO L93 Difference]: Finished difference Result 3126 states and 4281 transitions. [2023-12-15 23:40:52,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 23:40:52,351 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2023-12-15 23:40:52,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:52,354 INFO L225 Difference]: With dead ends: 3126 [2023-12-15 23:40:52,354 INFO L226 Difference]: Without dead ends: 2936 [2023-12-15 23:40:52,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2023-12-15 23:40:52,355 INFO L413 NwaCegarLoop]: 1021 mSDtfsCounter, 7037 mSDsluCounter, 4176 mSDsCounter, 0 mSdLazyCounter, 3812 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7037 SdHoareTripleChecker+Valid, 5197 SdHoareTripleChecker+Invalid, 3817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:52,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7037 Valid, 5197 Invalid, 3817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3812 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-15 23:40:52,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2023-12-15 23:40:52,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1733. [2023-12-15 23:40:52,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3814553990610328) internal successors, (2354), 1732 states have internal predecessors, (2354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2354 transitions. [2023-12-15 23:40:52,374 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2354 transitions. Word has length 112 [2023-12-15 23:40:52,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:52,374 INFO L495 AbstractCegarLoop]: Abstraction has 1733 states and 2354 transitions. [2023-12-15 23:40:52,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2354 transitions. [2023-12-15 23:40:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 23:40:52,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:52,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:40:52,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-15 23:40:52,377 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:52,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:52,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1578536085, now seen corresponding path program 1 times [2023-12-15 23:40:52,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:52,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898516579] [2023-12-15 23:40:52,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:52,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:52,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:40:52,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:52,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898516579] [2023-12-15 23:40:52,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898516579] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:52,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:52,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 23:40:52,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788745632] [2023-12-15 23:40:52,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:52,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 23:40:52,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:52,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 23:40:52,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-15 23:40:52,700 INFO L87 Difference]: Start difference. First operand 1733 states and 2354 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2023-12-15 23:40:53,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 23:40:53,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2023-12-15 23:40:53,723 INFO L413 NwaCegarLoop]: 925 mSDtfsCounter, 6624 mSDsluCounter, 3432 mSDsCounter, 0 mSdLazyCounter, 3206 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6624 SdHoareTripleChecker+Valid, 4357 SdHoareTripleChecker+Invalid, 3210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:53,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6624 Valid, 4357 Invalid, 3210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3206 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-15 23:40:53,724 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (28 of 29 remaining) [2023-12-15 23:40:53,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-15 23:40:53,725 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). [2023-12-15 23:40:53,726 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (27 of 29 remaining) [2023-12-15 23:40:53,726 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (26 of 29 remaining) [2023-12-15 23:40:53,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (25 of 29 remaining) [2023-12-15 23:40:53,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (24 of 29 remaining) [2023-12-15 23:40:53,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (23 of 29 remaining) [2023-12-15 23:40:53,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (22 of 29 remaining) [2023-12-15 23:40:53,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (21 of 29 remaining) [2023-12-15 23:40:53,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (20 of 29 remaining) [2023-12-15 23:40:53,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (19 of 29 remaining) [2023-12-15 23:40:53,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (18 of 29 remaining) [2023-12-15 23:40:53,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (17 of 29 remaining) [2023-12-15 23:40:53,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (16 of 29 remaining) [2023-12-15 23:40:53,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (15 of 29 remaining) [2023-12-15 23:40:53,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (14 of 29 remaining) [2023-12-15 23:40:53,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (13 of 29 remaining) [2023-12-15 23:40:53,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (12 of 29 remaining) [2023-12-15 23:40:53,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (11 of 29 remaining) [2023-12-15 23:40:53,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (10 of 29 remaining) [2023-12-15 23:40:53,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (9 of 29 remaining) [2023-12-15 23:40:53,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (8 of 29 remaining) [2023-12-15 23:40:53,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (7 of 29 remaining) [2023-12-15 23:40:53,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (6 of 29 remaining) [2023-12-15 23:40:53,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (5 of 29 remaining) [2023-12-15 23:40:53,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (4 of 29 remaining) [2023-12-15 23:40:53,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (3 of 29 remaining) [2023-12-15 23:40:53,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (2 of 29 remaining) [2023-12-15 23:40:53,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (1 of 29 remaining) [2023-12-15 23:40:53,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (0 of 29 remaining) [2023-12-15 23:40:53,741 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 23:40:53,742 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:40:53,744 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 23:40:53,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 11:40:53 BoogieIcfgContainer [2023-12-15 23:40:53,746 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 23:40:53,746 INFO L158 Benchmark]: Toolchain (without parser) took 54593.51ms. Allocated memory was 162.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 95.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-12-15 23:40:53,746 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 162.5MB. Free memory is still 111.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 23:40:53,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3023.05ms. Allocated memory was 162.5MB in the beginning and 360.7MB in the end (delta: 198.2MB). Free memory was 94.7MB in the beginning and 204.1MB in the end (delta: -109.4MB). Peak memory consumption was 130.8MB. Max. memory is 8.0GB. [2023-12-15 23:40:53,749 INFO L158 Benchmark]: Boogie Procedure Inliner took 394.31ms. Allocated memory is still 360.7MB. Free memory was 204.1MB in the beginning and 204.3MB in the end (delta: -120.2kB). Peak memory consumption was 96.5MB. Max. memory is 8.0GB. [2023-12-15 23:40:53,750 INFO L158 Benchmark]: Boogie Preprocessor took 609.82ms. Allocated memory is still 360.7MB. Free memory was 204.3MB in the beginning and 158.6MB in the end (delta: 45.6MB). Peak memory consumption was 68.7MB. Max. memory is 8.0GB. [2023-12-15 23:40:53,750 INFO L158 Benchmark]: RCFGBuilder took 7923.58ms. Allocated memory was 360.7MB in the beginning and 1.1GB in the end (delta: 716.2MB). Free memory was 158.6MB in the beginning and 845.9MB in the end (delta: -687.3MB). Peak memory consumption was 381.7MB. Max. memory is 8.0GB. [2023-12-15 23:40:53,750 INFO L158 Benchmark]: TraceAbstraction took 42636.84ms. Allocated memory was 1.1GB in the beginning and 1.9GB in the end (delta: 846.2MB). Free memory was 845.4MB in the beginning and 1.7GB in the end (delta: -847.3MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2023-12-15 23:40:53,753 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 162.5MB. Free memory is still 111.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 3023.05ms. Allocated memory was 162.5MB in the beginning and 360.7MB in the end (delta: 198.2MB). Free memory was 94.7MB in the beginning and 204.1MB in the end (delta: -109.4MB). Peak memory consumption was 130.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 394.31ms. Allocated memory is still 360.7MB. Free memory was 204.1MB in the beginning and 204.3MB in the end (delta: -120.2kB). Peak memory consumption was 96.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 609.82ms. Allocated memory is still 360.7MB. Free memory was 204.3MB in the beginning and 158.6MB in the end (delta: 45.6MB). Peak memory consumption was 68.7MB. Max. memory is 8.0GB. * RCFGBuilder took 7923.58ms. Allocated memory was 360.7MB in the beginning and 1.1GB in the end (delta: 716.2MB). Free memory was 158.6MB in the beginning and 845.9MB in the end (delta: -687.3MB). Peak memory consumption was 381.7MB. Max. memory is 8.0GB. * TraceAbstraction took 42636.84ms. Allocated memory was 1.1GB in the beginning and 1.9GB in the end (delta: 846.2MB). Free memory was 845.4MB in the beginning and 1.7GB in the end (delta: -847.3MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 43841]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 43841). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 12353]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 12353). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 18090]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 18090). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 20937]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 20937). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 22351]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 22351). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 23053]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 23053). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 23401]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 23401). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 23735]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 23735). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 29401]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 29401). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 32202]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 32202). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 33603]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 33603). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 34306]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 34306). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 34655]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 34655). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 34990]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 34990). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 37801]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 37801). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 39202]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 39202). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 39905]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 39905). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 40254]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 40254). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 40589]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 40589). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 42069]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 42069). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 42772]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 42772). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 43121]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 43121). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 43456]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 43456). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 44186]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 44186). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 44535]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 44535). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 44870]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 44870). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 45229]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 45229). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 45569]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 45569). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 45913]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 45913). Cancelled while NwaCegarLoop was constructing difference of abstraction (1733states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2315 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5465 locations, 29 error locations. Started 1 CEGAR loops. OverallTime: 42.6s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 33.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 174080 SdHoareTripleChecker+Valid, 30.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174080 mSDsluCounter, 83773 SdHoareTripleChecker+Invalid, 25.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55823 mSDsCounter, 345 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 66312 IncrementalHoareTripleChecker+Invalid, 66657 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 345 mSolverCounterUnsat, 27950 mSDtfsCounter, 66312 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5465occurred in iteration=0, InterpolantAutomatonStates: 221, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 16497 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 2399 NumberOfCodeBlocks, 2399 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2377 ConstructedInterpolants, 0 QuantifiedInterpolants, 16121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown