/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.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 23:40:18,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 23:40:18,417 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:40:18,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 23:40:18,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 23:40:18,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 23:40:18,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 23:40:18,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 23:40:18,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 23:40:18,450 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 23:40:18,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 23:40:18,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 23:40:18,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 23:40:18,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 23:40:18,452 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 23:40:18,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 23:40:18,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 23:40:18,452 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 23:40:18,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 23:40:18,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 23:40:18,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 23:40:18,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 23:40:18,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 23:40:18,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 23:40:18,454 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 23:40:18,454 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 23:40:18,454 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 23:40:18,454 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 23:40:18,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 23:40:18,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 23:40:18,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 23:40:18,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 23:40:18,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 23:40:18,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 23:40:18,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 23:40:18,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 23:40:18,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 23:40:18,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 23:40:18,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 23:40:18,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 23:40:18,457 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 23:40:18,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 23:40:18,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 23:40:18,457 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:40:18,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 23:40:18,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 23:40:18,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 23:40:18,676 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 23:40:18,676 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 23:40:18,677 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.UNBOUNDED.pals.c.v+lhb-reducer.c [2023-12-15 23:40:19,733 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 23:40:20,122 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 23:40:20,123 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2023-12-15 23:40:20,155 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ff03bcf/b45534a20a264048a07c9035b28e8cdc/FLAG9aca7ac3a [2023-12-15 23:40:20,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ff03bcf/b45534a20a264048a07c9035b28e8cdc [2023-12-15 23:40:20,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 23:40:20,170 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 23:40:20,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 23:40:20,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 23:40:20,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 23:40:20,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:40:20" (1/1) ... [2023-12-15 23:40:20,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a475b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:40:20, skipping insertion in model container [2023-12-15 23:40:20,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:40:20" (1/1) ... [2023-12-15 23:40:20,320 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 23:40:20,682 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.UNBOUNDED.pals.c.v+lhb-reducer.c[16849,16862] [2023-12-15 23:40:20,711 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.UNBOUNDED.pals.c.v+lhb-reducer.c[21942,21955] [2023-12-15 23:40:20,723 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.UNBOUNDED.pals.c.v+lhb-reducer.c[23299,23312] [2023-12-15 23:40:20,727 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.UNBOUNDED.pals.c.v+lhb-reducer.c[24107,24120] [2023-12-15 23:40:20,744 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.UNBOUNDED.pals.c.v+lhb-reducer.c[25792,25805] [2023-12-15 23:40:20,749 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.UNBOUNDED.pals.c.v+lhb-reducer.c[26600,26613] [2023-12-15 23:40:20,753 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.UNBOUNDED.pals.c.v+lhb-reducer.c[27736,27749] [2023-12-15 23:40:20,775 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.UNBOUNDED.pals.c.v+lhb-reducer.c[30390,30403] [2023-12-15 23:40:20,781 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.UNBOUNDED.pals.c.v+lhb-reducer.c[31201,31214] [2023-12-15 23:40:20,787 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.UNBOUNDED.pals.c.v+lhb-reducer.c[32340,32353] [2023-12-15 23:40:20,798 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.UNBOUNDED.pals.c.v+lhb-reducer.c[34445,34458] [2023-12-15 23:40:20,817 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.UNBOUNDED.pals.c.v+lhb-reducer.c[38533,38546] [2023-12-15 23:40:20,823 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.UNBOUNDED.pals.c.v+lhb-reducer.c[39344,39357] [2023-12-15 23:40:20,829 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.UNBOUNDED.pals.c.v+lhb-reducer.c[40483,40496] [2023-12-15 23:40:20,837 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.UNBOUNDED.pals.c.v+lhb-reducer.c[42588,42601] [2023-12-15 23:40:20,851 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.UNBOUNDED.pals.c.v+lhb-reducer.c[46127,46140] [2023-12-15 23:40:20,868 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.UNBOUNDED.pals.c.v+lhb-reducer.c[52573,52586] [2023-12-15 23:40:20,872 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.UNBOUNDED.pals.c.v+lhb-reducer.c[53384,53397] [2023-12-15 23:40:20,876 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.UNBOUNDED.pals.c.v+lhb-reducer.c[54527,54540] [2023-12-15 23:40:20,883 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.UNBOUNDED.pals.c.v+lhb-reducer.c[56636,56649] [2023-12-15 23:40:20,894 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.UNBOUNDED.pals.c.v+lhb-reducer.c[60424,60437] [2023-12-15 23:40:20,923 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.UNBOUNDED.pals.c.v+lhb-reducer.c[67072,67085] [2023-12-15 23:40:20,962 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.UNBOUNDED.pals.c.v+lhb-reducer.c[79206,79219] [2023-12-15 23:40:20,965 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.UNBOUNDED.pals.c.v+lhb-reducer.c[80017,80030] [2023-12-15 23:40:20,969 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.UNBOUNDED.pals.c.v+lhb-reducer.c[81156,81169] [2023-12-15 23:40:20,976 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.UNBOUNDED.pals.c.v+lhb-reducer.c[83261,83274] [2023-12-15 23:40:20,989 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.UNBOUNDED.pals.c.v+lhb-reducer.c[86800,86813] [2023-12-15 23:40:21,018 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.UNBOUNDED.pals.c.v+lhb-reducer.c[92697,92710] [2023-12-15 23:40:21,043 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.UNBOUNDED.pals.c.v+lhb-reducer.c[102772,102785] [2023-12-15 23:40:21,454 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 23:40:21,471 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 23:40:21,592 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.UNBOUNDED.pals.c.v+lhb-reducer.c[16849,16862] [2023-12-15 23:40:21,600 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.UNBOUNDED.pals.c.v+lhb-reducer.c[21942,21955] [2023-12-15 23:40:21,607 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.UNBOUNDED.pals.c.v+lhb-reducer.c[23299,23312] [2023-12-15 23:40:21,610 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.UNBOUNDED.pals.c.v+lhb-reducer.c[24107,24120] [2023-12-15 23:40:21,615 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.UNBOUNDED.pals.c.v+lhb-reducer.c[25792,25805] [2023-12-15 23:40:21,617 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.UNBOUNDED.pals.c.v+lhb-reducer.c[26600,26613] [2023-12-15 23:40:21,622 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.UNBOUNDED.pals.c.v+lhb-reducer.c[27736,27749] [2023-12-15 23:40:21,629 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.UNBOUNDED.pals.c.v+lhb-reducer.c[30390,30403] [2023-12-15 23:40:21,632 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.UNBOUNDED.pals.c.v+lhb-reducer.c[31201,31214] [2023-12-15 23:40:21,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.UNBOUNDED.pals.c.v+lhb-reducer.c[32340,32353] [2023-12-15 23:40:21,640 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.UNBOUNDED.pals.c.v+lhb-reducer.c[34445,34458] [2023-12-15 23:40:21,652 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.UNBOUNDED.pals.c.v+lhb-reducer.c[38533,38546] [2023-12-15 23:40:21,655 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.UNBOUNDED.pals.c.v+lhb-reducer.c[39344,39357] [2023-12-15 23:40:21,658 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.UNBOUNDED.pals.c.v+lhb-reducer.c[40483,40496] [2023-12-15 23:40:21,664 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.UNBOUNDED.pals.c.v+lhb-reducer.c[42588,42601] [2023-12-15 23:40:21,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.UNBOUNDED.pals.c.v+lhb-reducer.c[46127,46140] [2023-12-15 23:40:21,688 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.UNBOUNDED.pals.c.v+lhb-reducer.c[52573,52586] [2023-12-15 23:40:21,690 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.UNBOUNDED.pals.c.v+lhb-reducer.c[53384,53397] [2023-12-15 23:40:21,694 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.UNBOUNDED.pals.c.v+lhb-reducer.c[54527,54540] [2023-12-15 23:40:21,699 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.UNBOUNDED.pals.c.v+lhb-reducer.c[56636,56649] [2023-12-15 23:40:21,707 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.UNBOUNDED.pals.c.v+lhb-reducer.c[60424,60437] [2023-12-15 23:40:21,721 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.UNBOUNDED.pals.c.v+lhb-reducer.c[67072,67085] [2023-12-15 23:40:21,744 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.UNBOUNDED.pals.c.v+lhb-reducer.c[79206,79219] [2023-12-15 23:40:21,747 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.UNBOUNDED.pals.c.v+lhb-reducer.c[80017,80030] [2023-12-15 23:40:21,750 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.UNBOUNDED.pals.c.v+lhb-reducer.c[81156,81169] [2023-12-15 23:40:21,755 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.UNBOUNDED.pals.c.v+lhb-reducer.c[83261,83274] [2023-12-15 23:40:21,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.UNBOUNDED.pals.c.v+lhb-reducer.c[86800,86813] [2023-12-15 23:40:21,774 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.UNBOUNDED.pals.c.v+lhb-reducer.c[92697,92710] [2023-12-15 23:40:21,792 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.UNBOUNDED.pals.c.v+lhb-reducer.c[102772,102785] [2023-12-15 23:40:22,093 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 23:40:22,118 INFO L206 MainTranslator]: Completed translation [2023-12-15 23:40:22,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:40:22 WrapperNode [2023-12-15 23:40:22,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 23:40:22,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 23:40:22,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 23:40:22,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 23:40:22,125 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:22" (1/1) ... [2023-12-15 23:40:22,175 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:22" (1/1) ... [2023-12-15 23:40:22,387 INFO L138 Inliner]: procedures = 27, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 12861 [2023-12-15 23:40:22,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 23:40:22,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 23:40:22,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 23:40:22,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 23:40:22,396 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:22" (1/1) ... [2023-12-15 23:40:22,397 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:22" (1/1) ... [2023-12-15 23:40:22,436 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:22" (1/1) ... [2023-12-15 23:40:22,506 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:22,506 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:22" (1/1) ... [2023-12-15 23:40:22,506 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:22" (1/1) ... [2023-12-15 23:40:22,571 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:22" (1/1) ... [2023-12-15 23:40:22,598 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:22" (1/1) ... [2023-12-15 23:40:22,625 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:22" (1/1) ... [2023-12-15 23:40:22,640 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:22" (1/1) ... [2023-12-15 23:40:22,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 23:40:22,770 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 23:40:22,770 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 23:40:22,770 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 23:40:22,771 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:40:22" (1/1) ... [2023-12-15 23:40:22,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 23:40:22,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:40:22,796 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:22,833 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:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 23:40:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 23:40:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 23:40:22,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 23:40:23,159 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 23:40:23,160 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 23:40:26,683 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 23:40:26,754 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 23:40:26,754 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-15 23:40:26,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:40:26 BoogieIcfgContainer [2023-12-15 23:40:26,754 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 23:40:26,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 23:40:26,756 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 23:40:26,758 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 23:40:26,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:40:20" (1/3) ... [2023-12-15 23:40:26,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66810d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:40:26, skipping insertion in model container [2023-12-15 23:40:26,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:40:22" (2/3) ... [2023-12-15 23:40:26,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66810d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:40:26, skipping insertion in model container [2023-12-15 23:40:26,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:40:26" (3/3) ... [2023-12-15 23:40:26,760 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2023-12-15 23:40:26,771 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 23:40:26,771 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2023-12-15 23:40:26,836 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 23:40:26,841 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;@2815c36c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 23:40:26,842 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-12-15 23:40:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 2062 states, 2032 states have (on average 1.8686023622047243) internal successors, (3797), 2061 states have internal predecessors, (3797), 0 states have call successors, (0), 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,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-15 23:40:26,873 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:26,874 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] [2023-12-15 23:40:26,874 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:26,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:26,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1135640583, now seen corresponding path program 1 times [2023-12-15 23:40:26,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:26,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59550473] [2023-12-15 23:40:26,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:26,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:27,396 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,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:27,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59550473] [2023-12-15 23:40:27,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59550473] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:27,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:27,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:40:27,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853033440] [2023-12-15 23:40:27,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:27,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:40:27,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:27,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:40:27,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:40:27,425 INFO L87 Difference]: Start difference. First operand has 2062 states, 2032 states have (on average 1.8686023622047243) internal successors, (3797), 2061 states have internal predecessors, (3797), 0 states have call successors, (0), 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 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:28,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:28,269 INFO L93 Difference]: Finished difference Result 3055 states and 5451 transitions. [2023-12-15 23:40:28,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:40:28,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2023-12-15 23:40:28,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:28,294 INFO L225 Difference]: With dead ends: 3055 [2023-12-15 23:40:28,294 INFO L226 Difference]: Without dead ends: 1560 [2023-12-15 23:40:28,299 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:28,317 INFO L413 NwaCegarLoop]: 1832 mSDtfsCounter, 8183 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8183 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:28,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8183 Valid, 1872 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-15 23:40:28,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2023-12-15 23:40:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1560. [2023-12-15 23:40:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1531 states have (on average 1.3291966035271066) internal successors, (2035), 1559 states have internal predecessors, (2035), 0 states have call successors, (0), 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,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2035 transitions. [2023-12-15 23:40:28,409 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2035 transitions. Word has length 99 [2023-12-15 23:40:28,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:28,409 INFO L495 AbstractCegarLoop]: Abstraction has 1560 states and 2035 transitions. [2023-12-15 23:40:28,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:28,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2035 transitions. [2023-12-15 23:40:28,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-15 23:40:28,413 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:28,413 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] [2023-12-15 23:40:28,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 23:40:28,413 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:28,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:28,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1968753033, now seen corresponding path program 1 times [2023-12-15 23:40:28,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:28,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349486693] [2023-12-15 23:40:28,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:28,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:28,565 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,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:28,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349486693] [2023-12-15 23:40:28,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349486693] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:28,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:28,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:40:28,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131123376] [2023-12-15 23:40:28,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:28,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:40:28,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:28,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:40:28,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:40:28,567 INFO L87 Difference]: Start difference. First operand 1560 states and 2035 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:29,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:29,714 INFO L93 Difference]: Finished difference Result 2547 states and 3434 transitions. [2023-12-15 23:40:29,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:40:29,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2023-12-15 23:40:29,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:29,719 INFO L225 Difference]: With dead ends: 2547 [2023-12-15 23:40:29,719 INFO L226 Difference]: Without dead ends: 1352 [2023-12-15 23:40:29,721 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:29,721 INFO L413 NwaCegarLoop]: 918 mSDtfsCounter, 5239 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5239 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:29,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5239 Valid, 962 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-15 23:40:29,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2023-12-15 23:40:29,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1352. [2023-12-15 23:40:29,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1323 states have (on average 1.3560090702947847) internal successors, (1794), 1351 states have internal predecessors, (1794), 0 states have call successors, (0), 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:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1794 transitions. [2023-12-15 23:40:29,742 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1794 transitions. Word has length 100 [2023-12-15 23:40:29,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:29,742 INFO L495 AbstractCegarLoop]: Abstraction has 1352 states and 1794 transitions. [2023-12-15 23:40:29,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:29,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1794 transitions. [2023-12-15 23:40:29,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-15 23:40:29,745 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:29,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] [2023-12-15 23:40:29,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 23:40:29,745 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:29,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:29,746 INFO L85 PathProgramCache]: Analyzing trace with hash -703352954, now seen corresponding path program 1 times [2023-12-15 23:40:29,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:29,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142610402] [2023-12-15 23:40:29,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:29,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:30,056 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:30,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:30,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142610402] [2023-12-15 23:40:30,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142610402] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:30,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:30,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:40:30,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749211220] [2023-12-15 23:40:30,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:30,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:40:30,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:30,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:40:30,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:40:30,059 INFO L87 Difference]: Start difference. First operand 1352 states and 1794 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:30,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:30,754 INFO L93 Difference]: Finished difference Result 2339 states and 3192 transitions. [2023-12-15 23:40:30,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:40:30,755 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:30,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:30,758 INFO L225 Difference]: With dead ends: 2339 [2023-12-15 23:40:30,758 INFO L226 Difference]: Without dead ends: 1212 [2023-12-15 23:40:30,760 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:30,761 INFO L413 NwaCegarLoop]: 891 mSDtfsCounter, 4812 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4812 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:30,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4812 Valid, 919 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 23:40:30,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2023-12-15 23:40:30,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2023-12-15 23:40:30,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1183 states have (on average 1.3837700760777685) internal successors, (1637), 1211 states have internal predecessors, (1637), 0 states have call successors, (0), 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,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1637 transitions. [2023-12-15 23:40:30,789 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1637 transitions. Word has length 101 [2023-12-15 23:40:30,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:30,789 INFO L495 AbstractCegarLoop]: Abstraction has 1212 states and 1637 transitions. [2023-12-15 23:40:30,789 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:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1637 transitions. [2023-12-15 23:40:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-15 23:40:30,798 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:30,798 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] [2023-12-15 23:40:30,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 23:40:30,798 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:30,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:30,798 INFO L85 PathProgramCache]: Analyzing trace with hash 472316096, now seen corresponding path program 1 times [2023-12-15 23:40:30,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:30,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065027279] [2023-12-15 23:40:30,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:30,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:30,983 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:30,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:30,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065027279] [2023-12-15 23:40:30,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065027279] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:30,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:30,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:40:30,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971242915] [2023-12-15 23:40:30,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:30,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:40:30,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:30,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:40:30,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:40:30,986 INFO L87 Difference]: Start difference. First operand 1212 states and 1637 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:31,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:31,801 INFO L93 Difference]: Finished difference Result 2199 states and 3034 transitions. [2023-12-15 23:40:31,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:40:31,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2023-12-15 23:40:31,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:31,848 INFO L225 Difference]: With dead ends: 2199 [2023-12-15 23:40:31,849 INFO L226 Difference]: Without dead ends: 1172 [2023-12-15 23:40:31,850 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:31,850 INFO L413 NwaCegarLoop]: 655 mSDtfsCounter, 4578 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4578 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:31,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4578 Valid, 707 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-15 23:40:31,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2023-12-15 23:40:31,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1172. [2023-12-15 23:40:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 1143 states have (on average 1.389326334208224) internal successors, (1588), 1171 states have internal predecessors, (1588), 0 states have call successors, (0), 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:31,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1588 transitions. [2023-12-15 23:40:31,864 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1588 transitions. Word has length 102 [2023-12-15 23:40:31,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:31,864 INFO L495 AbstractCegarLoop]: Abstraction has 1172 states and 1588 transitions. [2023-12-15 23:40:31,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:40:31,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1588 transitions. [2023-12-15 23:40:31,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-15 23:40:31,866 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:31,866 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:31,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 23:40:31,866 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:31,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:31,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1771013563, now seen corresponding path program 1 times [2023-12-15 23:40:31,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:31,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528701166] [2023-12-15 23:40:31,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:31,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:32,011 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,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:32,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528701166] [2023-12-15 23:40:32,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528701166] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:32,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:32,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:40:32,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456779739] [2023-12-15 23:40:32,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:32,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:40:32,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:32,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:40:32,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:40:32,014 INFO L87 Difference]: Start difference. First operand 1172 states and 1588 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:32,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:32,586 INFO L93 Difference]: Finished difference Result 2159 states and 2984 transitions. [2023-12-15 23:40:32,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:40:32,587 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:32,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:32,590 INFO L225 Difference]: With dead ends: 2159 [2023-12-15 23:40:32,590 INFO L226 Difference]: Without dead ends: 1110 [2023-12-15 23:40:32,591 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:32,592 INFO L413 NwaCegarLoop]: 835 mSDtfsCounter, 4491 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4491 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:32,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4491 Valid, 847 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 23:40:32,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2023-12-15 23:40:32,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2023-12-15 23:40:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1081 states have (on average 1.4070305272895467) internal successors, (1521), 1109 states have internal predecessors, (1521), 0 states have call successors, (0), 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,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1521 transitions. [2023-12-15 23:40:32,605 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1521 transitions. Word has length 103 [2023-12-15 23:40:32,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:32,605 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1521 transitions. [2023-12-15 23:40:32,605 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:32,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1521 transitions. [2023-12-15 23:40:32,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-15 23:40:32,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:32,607 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] [2023-12-15 23:40:32,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 23:40:32,607 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:32,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:32,608 INFO L85 PathProgramCache]: Analyzing trace with hash -54343083, now seen corresponding path program 1 times [2023-12-15 23:40:32,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:32,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111836255] [2023-12-15 23:40:32,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:32,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:32,709 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,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:32,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111836255] [2023-12-15 23:40:32,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111836255] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:32,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:32,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:40:32,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451537165] [2023-12-15 23:40:32,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:32,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:40:32,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:32,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:40:32,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:40:32,711 INFO L87 Difference]: Start difference. First operand 1110 states and 1521 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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:33,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:33,539 INFO L93 Difference]: Finished difference Result 2676 states and 3716 transitions. [2023-12-15 23:40:33,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:40:33,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2023-12-15 23:40:33,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:33,544 INFO L225 Difference]: With dead ends: 2676 [2023-12-15 23:40:33,544 INFO L226 Difference]: Without dead ends: 1655 [2023-12-15 23:40:33,546 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:33,546 INFO L413 NwaCegarLoop]: 820 mSDtfsCounter, 5989 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5989 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:33,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5989 Valid, 1268 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-15 23:40:33,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2023-12-15 23:40:33,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1553. [2023-12-15 23:40:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1524 states have (on average 1.444225721784777) internal successors, (2201), 1552 states have internal predecessors, (2201), 0 states have call successors, (0), 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:33,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 2201 transitions. [2023-12-15 23:40:33,570 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 2201 transitions. Word has length 104 [2023-12-15 23:40:33,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:33,570 INFO L495 AbstractCegarLoop]: Abstraction has 1553 states and 2201 transitions. [2023-12-15 23:40:33,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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:33,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 2201 transitions. [2023-12-15 23:40:33,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-15 23:40:33,573 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:33,573 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:33,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 23:40:33,573 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:33,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:33,573 INFO L85 PathProgramCache]: Analyzing trace with hash 883423548, now seen corresponding path program 1 times [2023-12-15 23:40:33,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:33,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388920313] [2023-12-15 23:40:33,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:33,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:33,699 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:33,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:33,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388920313] [2023-12-15 23:40:33,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388920313] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:33,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:33,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:40:33,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150105060] [2023-12-15 23:40:33,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:33,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:40:33,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:33,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:40:33,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:40:33,701 INFO L87 Difference]: Start difference. First operand 1553 states and 2201 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:34,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:34,454 INFO L93 Difference]: Finished difference Result 3017 states and 4312 transitions. [2023-12-15 23:40:34,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:40:34,456 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:34,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:34,460 INFO L225 Difference]: With dead ends: 3017 [2023-12-15 23:40:34,460 INFO L226 Difference]: Without dead ends: 1542 [2023-12-15 23:40:34,461 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:34,462 INFO L413 NwaCegarLoop]: 768 mSDtfsCounter, 4296 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4296 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:34,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4296 Valid, 804 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-15 23:40:34,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2023-12-15 23:40:34,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1542. [2023-12-15 23:40:34,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.4454725710508922) internal successors, (2187), 1541 states have internal predecessors, (2187), 0 states have call successors, (0), 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,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2187 transitions. [2023-12-15 23:40:34,484 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2187 transitions. Word has length 105 [2023-12-15 23:40:34,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:34,484 INFO L495 AbstractCegarLoop]: Abstraction has 1542 states and 2187 transitions. [2023-12-15 23:40:34,485 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:34,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2187 transitions. [2023-12-15 23:40:34,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-15 23:40:34,487 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:34,487 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] [2023-12-15 23:40:34,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 23:40:34,488 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:34,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:34,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1511270635, now seen corresponding path program 1 times [2023-12-15 23:40:34,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:34,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267301012] [2023-12-15 23:40:34,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:34,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:34,809 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:34,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:34,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267301012] [2023-12-15 23:40:34,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267301012] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:34,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:34,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:40:34,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103577077] [2023-12-15 23:40:34,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:34,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:40:34,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:34,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:40:34,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:40:34,813 INFO L87 Difference]: Start difference. First operand 1542 states and 2187 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 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,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:36,407 INFO L93 Difference]: Finished difference Result 2762 states and 3927 transitions. [2023-12-15 23:40:36,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:40:36,408 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2023-12-15 23:40:36,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:36,414 INFO L225 Difference]: With dead ends: 2762 [2023-12-15 23:40:36,415 INFO L226 Difference]: Without dead ends: 2378 [2023-12-15 23:40:36,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2023-12-15 23:40:36,416 INFO L413 NwaCegarLoop]: 856 mSDtfsCounter, 6978 mSDsluCounter, 2629 mSDsCounter, 0 mSdLazyCounter, 2903 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6978 SdHoareTripleChecker+Valid, 3485 SdHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:36,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6978 Valid, 3485 Invalid, 2907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2903 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-15 23:40:36,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2023-12-15 23:40:36,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 1542. [2023-12-15 23:40:36,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.444811632518176) internal successors, (2186), 1541 states have internal predecessors, (2186), 0 states have call successors, (0), 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,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2186 transitions. [2023-12-15 23:40:36,445 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2186 transitions. Word has length 106 [2023-12-15 23:40:36,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:36,446 INFO L495 AbstractCegarLoop]: Abstraction has 1542 states and 2186 transitions. [2023-12-15 23:40:36,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 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,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2186 transitions. [2023-12-15 23:40:36,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-15 23:40:36,448 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:36,448 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] [2023-12-15 23:40:36,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 23:40:36,448 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:36,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:36,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1798506288, now seen corresponding path program 1 times [2023-12-15 23:40:36,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:36,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990277170] [2023-12-15 23:40:36,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:36,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:36,760 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:36,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:36,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990277170] [2023-12-15 23:40:36,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990277170] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:36,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:36,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:40:36,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236365777] [2023-12-15 23:40:36,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:36,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:40:36,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:36,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:40:36,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:40:36,762 INFO L87 Difference]: Start difference. First operand 1542 states and 2186 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 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,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:38,338 INFO L93 Difference]: Finished difference Result 2888 states and 4120 transitions. [2023-12-15 23:40:38,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:40:38,339 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2023-12-15 23:40:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:38,346 INFO L225 Difference]: With dead ends: 2888 [2023-12-15 23:40:38,347 INFO L226 Difference]: Without dead ends: 2697 [2023-12-15 23:40:38,348 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:38,348 INFO L413 NwaCegarLoop]: 867 mSDtfsCounter, 6433 mSDsluCounter, 2859 mSDsCounter, 0 mSdLazyCounter, 3138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6433 SdHoareTripleChecker+Valid, 3726 SdHoareTripleChecker+Invalid, 3142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:38,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6433 Valid, 3726 Invalid, 3142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3138 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-15 23:40:38,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2023-12-15 23:40:38,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1542. [2023-12-15 23:40:38,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.4441506939854594) internal successors, (2185), 1541 states have internal predecessors, (2185), 0 states have call successors, (0), 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,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2185 transitions. [2023-12-15 23:40:38,376 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2185 transitions. Word has length 106 [2023-12-15 23:40:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:38,376 INFO L495 AbstractCegarLoop]: Abstraction has 1542 states and 2185 transitions. [2023-12-15 23:40:38,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 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,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2185 transitions. [2023-12-15 23:40:38,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-15 23:40:38,378 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:38,378 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] [2023-12-15 23:40:38,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 23:40:38,378 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:38,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:38,379 INFO L85 PathProgramCache]: Analyzing trace with hash -43154195, now seen corresponding path program 1 times [2023-12-15 23:40:38,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:38,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331288399] [2023-12-15 23:40:38,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:38,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:38,646 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:38,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:38,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331288399] [2023-12-15 23:40:38,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331288399] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:38,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:38,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 23:40:38,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014732824] [2023-12-15 23:40:38,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:38,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 23:40:38,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:38,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 23:40:38,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 23:40:38,647 INFO L87 Difference]: Start difference. First operand 1542 states and 2185 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 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:39,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:39,733 INFO L93 Difference]: Finished difference Result 2661 states and 3645 transitions. [2023-12-15 23:40:39,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 23:40:39,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2023-12-15 23:40:39,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:39,739 INFO L225 Difference]: With dead ends: 2661 [2023-12-15 23:40:39,739 INFO L226 Difference]: Without dead ends: 2001 [2023-12-15 23:40:39,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 23:40:39,741 INFO L413 NwaCegarLoop]: 649 mSDtfsCounter, 6507 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 1931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6507 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:39,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6507 Valid, 1600 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1931 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-15 23:40:39,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2023-12-15 23:40:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1542. [2023-12-15 23:40:39,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.4434897554527428) internal successors, (2184), 1541 states have internal predecessors, (2184), 0 states have call successors, (0), 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:39,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2184 transitions. [2023-12-15 23:40:39,769 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2184 transitions. Word has length 106 [2023-12-15 23:40:39,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:39,770 INFO L495 AbstractCegarLoop]: Abstraction has 1542 states and 2184 transitions. [2023-12-15 23:40:39,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 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:39,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2184 transitions. [2023-12-15 23:40:39,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-15 23:40:39,772 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:39,772 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] [2023-12-15 23:40:39,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 23:40:39,772 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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:39,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:39,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2099836846, now seen corresponding path program 1 times [2023-12-15 23:40:39,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:39,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300279154] [2023-12-15 23:40:39,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:39,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:40,078 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:40,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:40,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300279154] [2023-12-15 23:40:40,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300279154] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:40,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:40,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:40:40,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2770170] [2023-12-15 23:40:40,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:40,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:40:40,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:40,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:40:40,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:40:40,080 INFO L87 Difference]: Start difference. First operand 1542 states and 2184 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:41,565 INFO L93 Difference]: Finished difference Result 2882 states and 4112 transitions. [2023-12-15 23:40:41,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:40:41,568 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2023-12-15 23:40:41,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:41,588 INFO L225 Difference]: With dead ends: 2882 [2023-12-15 23:40:41,588 INFO L226 Difference]: Without dead ends: 2697 [2023-12-15 23:40:41,589 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:41,590 INFO L413 NwaCegarLoop]: 855 mSDtfsCounter, 6360 mSDsluCounter, 2857 mSDsCounter, 0 mSdLazyCounter, 3129 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6360 SdHoareTripleChecker+Valid, 3712 SdHoareTripleChecker+Invalid, 3133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:41,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6360 Valid, 3712 Invalid, 3133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3129 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-15 23:40:41,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2023-12-15 23:40:41,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1542. [2023-12-15 23:40:41,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.4428288169200265) internal successors, (2183), 1541 states have internal predecessors, (2183), 0 states have call successors, (0), 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,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2183 transitions. [2023-12-15 23:40:41,646 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2183 transitions. Word has length 108 [2023-12-15 23:40:41,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:41,647 INFO L495 AbstractCegarLoop]: Abstraction has 1542 states and 2183 transitions. [2023-12-15 23:40:41,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2183 transitions. [2023-12-15 23:40:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-15 23:40:41,649 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:41,649 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] [2023-12-15 23:40:41,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 23:40:41,649 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:41,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:41,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1707868184, now seen corresponding path program 1 times [2023-12-15 23:40:41,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:41,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670720179] [2023-12-15 23:40:41,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:41,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:41,956 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,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:41,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670720179] [2023-12-15 23:40:41,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670720179] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:41,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:41,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:40:41,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081902919] [2023-12-15 23:40:41,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:41,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:40:41,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:41,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:40:41,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:40:41,958 INFO L87 Difference]: Start difference. First operand 1542 states and 2183 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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:43,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:43,402 INFO L93 Difference]: Finished difference Result 3014 states and 4316 transitions. [2023-12-15 23:40:43,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:40:43,403 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2023-12-15 23:40:43,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:43,410 INFO L225 Difference]: With dead ends: 3014 [2023-12-15 23:40:43,410 INFO L226 Difference]: Without dead ends: 2753 [2023-12-15 23:40:43,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2023-12-15 23:40:43,412 INFO L413 NwaCegarLoop]: 978 mSDtfsCounter, 6081 mSDsluCounter, 3286 mSDsCounter, 0 mSdLazyCounter, 3493 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6081 SdHoareTripleChecker+Valid, 4264 SdHoareTripleChecker+Invalid, 3497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:43,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6081 Valid, 4264 Invalid, 3497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3493 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-15 23:40:43,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2023-12-15 23:40:43,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 1542. [2023-12-15 23:40:43,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.44216787838731) internal successors, (2182), 1541 states have internal predecessors, (2182), 0 states have call successors, (0), 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:43,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2182 transitions. [2023-12-15 23:40:43,442 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2182 transitions. Word has length 108 [2023-12-15 23:40:43,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:43,443 INFO L495 AbstractCegarLoop]: Abstraction has 1542 states and 2182 transitions. [2023-12-15 23:40:43,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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:43,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2182 transitions. [2023-12-15 23:40:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-15 23:40:43,445 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:43,445 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] [2023-12-15 23:40:43,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 23:40:43,445 INFO L420 AbstractCegarLoop]: === Iteration 13 === 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:43,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:43,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1111952338, now seen corresponding path program 1 times [2023-12-15 23:40:43,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:43,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31109925] [2023-12-15 23:40:43,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:43,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:43,646 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,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:43,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31109925] [2023-12-15 23:40:43,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31109925] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:43,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:43,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:40:43,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848087315] [2023-12-15 23:40:43,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:43,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:40:43,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:43,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:40:43,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:40:43,648 INFO L87 Difference]: Start difference. First operand 1542 states and 2182 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:44,992 INFO L93 Difference]: Finished difference Result 2882 states and 4110 transitions. [2023-12-15 23:40:44,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:40:44,992 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2023-12-15 23:40:44,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:44,999 INFO L225 Difference]: With dead ends: 2882 [2023-12-15 23:40:44,999 INFO L226 Difference]: Without dead ends: 2697 [2023-12-15 23:40:45,000 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:45,000 INFO L413 NwaCegarLoop]: 867 mSDtfsCounter, 4193 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 3126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4193 SdHoareTripleChecker+Valid, 3733 SdHoareTripleChecker+Invalid, 3130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:45,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4193 Valid, 3733 Invalid, 3130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3126 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-15 23:40:45,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2023-12-15 23:40:45,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1542. [2023-12-15 23:40:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.4415069398545934) internal successors, (2181), 1541 states have internal predecessors, (2181), 0 states have call successors, (0), 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:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2181 transitions. [2023-12-15 23:40:45,023 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2181 transitions. Word has length 108 [2023-12-15 23:40:45,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:45,023 INFO L495 AbstractCegarLoop]: Abstraction has 1542 states and 2181 transitions. [2023-12-15 23:40:45,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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:45,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2181 transitions. [2023-12-15 23:40:45,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-15 23:40:45,036 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:45,036 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] [2023-12-15 23:40:45,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 23:40:45,036 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:45,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:45,037 INFO L85 PathProgramCache]: Analyzing trace with hash -507418736, now seen corresponding path program 1 times [2023-12-15 23:40:45,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:45,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525766441] [2023-12-15 23:40:45,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:45,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:45,568 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:45,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:45,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525766441] [2023-12-15 23:40:45,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525766441] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:45,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:45,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 23:40:45,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765888247] [2023-12-15 23:40:45,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:45,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 23:40:45,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:45,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 23:40:45,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-12-15 23:40:45,570 INFO L87 Difference]: Start difference. First operand 1542 states and 2181 transitions. Second operand has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 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,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:48,984 INFO L93 Difference]: Finished difference Result 4595 states and 6645 transitions. [2023-12-15 23:40:48,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-15 23:40:48,984 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2023-12-15 23:40:48,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:48,994 INFO L225 Difference]: With dead ends: 4595 [2023-12-15 23:40:48,994 INFO L226 Difference]: Without dead ends: 4311 [2023-12-15 23:40:48,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2023-12-15 23:40:48,996 INFO L413 NwaCegarLoop]: 1515 mSDtfsCounter, 11063 mSDsluCounter, 6185 mSDsCounter, 0 mSdLazyCounter, 6619 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11063 SdHoareTripleChecker+Valid, 7700 SdHoareTripleChecker+Invalid, 6982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 6619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:48,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11063 Valid, 7700 Invalid, 6982 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [363 Valid, 6619 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-15 23:40:48,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4311 states. [2023-12-15 23:40:49,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4311 to 1546. [2023-12-15 23:40:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4403427818061965) internal successors, (2185), 1545 states have internal predecessors, (2185), 0 states have call successors, (0), 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:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2185 transitions. [2023-12-15 23:40:49,026 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2185 transitions. Word has length 108 [2023-12-15 23:40:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:49,026 INFO L495 AbstractCegarLoop]: Abstraction has 1546 states and 2185 transitions. [2023-12-15 23:40:49,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 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:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2185 transitions. [2023-12-15 23:40:49,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-15 23:40:49,029 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:49,029 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] [2023-12-15 23:40:49,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 23:40:49,029 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:49,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:49,029 INFO L85 PathProgramCache]: Analyzing trace with hash 899330884, now seen corresponding path program 1 times [2023-12-15 23:40:49,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:49,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093411653] [2023-12-15 23:40:49,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:49,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:49,271 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:49,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:49,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093411653] [2023-12-15 23:40:49,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093411653] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:49,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:49,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:40:49,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870633296] [2023-12-15 23:40:49,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:49,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:40:49,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:49,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:40:49,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:40:49,273 INFO L87 Difference]: Start difference. First operand 1546 states and 2185 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:50,829 INFO L93 Difference]: Finished difference Result 2892 states and 4118 transitions. [2023-12-15 23:40:50,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:40:50,829 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2023-12-15 23:40:50,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:50,833 INFO L225 Difference]: With dead ends: 2892 [2023-12-15 23:40:50,833 INFO L226 Difference]: Without dead ends: 2701 [2023-12-15 23:40:50,834 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:50,834 INFO L413 NwaCegarLoop]: 867 mSDtfsCounter, 4192 mSDsluCounter, 2872 mSDsCounter, 0 mSdLazyCounter, 3120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4192 SdHoareTripleChecker+Valid, 3739 SdHoareTripleChecker+Invalid, 3124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:50,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4192 Valid, 3739 Invalid, 3124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3120 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-15 23:40:50,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2023-12-15 23:40:50,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 1546. [2023-12-15 23:40:50,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4396835860250494) internal successors, (2184), 1545 states have internal predecessors, (2184), 0 states have call successors, (0), 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,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2184 transitions. [2023-12-15 23:40:50,853 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2184 transitions. Word has length 108 [2023-12-15 23:40:50,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:50,853 INFO L495 AbstractCegarLoop]: Abstraction has 1546 states and 2184 transitions. [2023-12-15 23:40:50,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2184 transitions. [2023-12-15 23:40:50,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-15 23:40:50,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:50,855 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] [2023-12-15 23:40:50,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 23:40:50,855 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:50,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:50,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1176238153, now seen corresponding path program 1 times [2023-12-15 23:40:50,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:50,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485951320] [2023-12-15 23:40:50,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:50,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:51,071 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:51,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:51,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485951320] [2023-12-15 23:40:51,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485951320] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:51,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:51,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:40:51,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389676972] [2023-12-15 23:40:51,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:51,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:40:51,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:51,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:40:51,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:40:51,073 INFO L87 Difference]: Start difference. First operand 1546 states and 2184 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:52,642 INFO L93 Difference]: Finished difference Result 2911 states and 4143 transitions. [2023-12-15 23:40:52,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:40:52,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2023-12-15 23:40:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:52,646 INFO L225 Difference]: With dead ends: 2911 [2023-12-15 23:40:52,646 INFO L226 Difference]: Without dead ends: 2701 [2023-12-15 23:40:52,647 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:52,648 INFO L413 NwaCegarLoop]: 867 mSDtfsCounter, 4123 mSDsluCounter, 2878 mSDsCounter, 0 mSdLazyCounter, 3111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4123 SdHoareTripleChecker+Valid, 3745 SdHoareTripleChecker+Invalid, 3115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:52,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4123 Valid, 3745 Invalid, 3115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3111 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-15 23:40:52,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2023-12-15 23:40:52,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 1546. [2023-12-15 23:40:52,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4383651944627553) internal successors, (2182), 1545 states have internal predecessors, (2182), 0 states have call successors, (0), 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,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2182 transitions. [2023-12-15 23:40:52,675 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2182 transitions. Word has length 108 [2023-12-15 23:40:52,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:52,675 INFO L495 AbstractCegarLoop]: Abstraction has 1546 states and 2182 transitions. [2023-12-15 23:40:52,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2182 transitions. [2023-12-15 23:40:52,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-15 23:40:52,677 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:52,677 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] [2023-12-15 23:40:52,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 23:40:52,678 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:52,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:52,678 INFO L85 PathProgramCache]: Analyzing trace with hash -121651885, now seen corresponding path program 1 times [2023-12-15 23:40:52,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:52,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521797792] [2023-12-15 23:40:52,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:52,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:52,900 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,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:52,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521797792] [2023-12-15 23:40:52,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521797792] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:52,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:52,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:40:52,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550800721] [2023-12-15 23:40:52,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:52,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:40:52,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:52,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:40:52,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:40:52,903 INFO L87 Difference]: Start difference. First operand 1546 states and 2182 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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:54,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:54,542 INFO L93 Difference]: Finished difference Result 3119 states and 4452 transitions. [2023-12-15 23:40:54,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:40:54,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2023-12-15 23:40:54,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:54,546 INFO L225 Difference]: With dead ends: 3119 [2023-12-15 23:40:54,546 INFO L226 Difference]: Without dead ends: 2753 [2023-12-15 23:40:54,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2023-12-15 23:40:54,548 INFO L413 NwaCegarLoop]: 958 mSDtfsCounter, 6281 mSDsluCounter, 3074 mSDsCounter, 0 mSdLazyCounter, 3277 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6281 SdHoareTripleChecker+Valid, 4032 SdHoareTripleChecker+Invalid, 3281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:54,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6281 Valid, 4032 Invalid, 3281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3277 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-15 23:40:54,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2023-12-15 23:40:54,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 1546. [2023-12-15 23:40:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4370468029004615) internal successors, (2180), 1545 states have internal predecessors, (2180), 0 states have call successors, (0), 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:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2180 transitions. [2023-12-15 23:40:54,565 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2180 transitions. Word has length 108 [2023-12-15 23:40:54,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:54,566 INFO L495 AbstractCegarLoop]: Abstraction has 1546 states and 2180 transitions. [2023-12-15 23:40:54,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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:54,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2180 transitions. [2023-12-15 23:40:54,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-15 23:40:54,568 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:54,568 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] [2023-12-15 23:40:54,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 23:40:54,568 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:54,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:54,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1711979523, now seen corresponding path program 1 times [2023-12-15 23:40:54,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:54,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200916980] [2023-12-15 23:40:54,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:54,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:54,778 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:54,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:54,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200916980] [2023-12-15 23:40:54,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200916980] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:54,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:54,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:40:54,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503297140] [2023-12-15 23:40:54,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:54,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:40:54,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:54,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:40:54,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:40:54,780 INFO L87 Difference]: Start difference. First operand 1546 states and 2180 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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:56,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:56,136 INFO L93 Difference]: Finished difference Result 2911 states and 4139 transitions. [2023-12-15 23:40:56,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:40:56,136 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2023-12-15 23:40:56,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:56,142 INFO L225 Difference]: With dead ends: 2911 [2023-12-15 23:40:56,142 INFO L226 Difference]: Without dead ends: 2701 [2023-12-15 23:40:56,143 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:56,144 INFO L413 NwaCegarLoop]: 867 mSDtfsCounter, 6366 mSDsluCounter, 2875 mSDsCounter, 0 mSdLazyCounter, 3106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6366 SdHoareTripleChecker+Valid, 3742 SdHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:56,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6366 Valid, 3742 Invalid, 3110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3106 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-15 23:40:56,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2023-12-15 23:40:56,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 1546. [2023-12-15 23:40:56,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4357284113381674) internal successors, (2178), 1545 states have internal predecessors, (2178), 0 states have call successors, (0), 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:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2178 transitions. [2023-12-15 23:40:56,167 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2178 transitions. Word has length 108 [2023-12-15 23:40:56,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:56,167 INFO L495 AbstractCegarLoop]: Abstraction has 1546 states and 2178 transitions. [2023-12-15 23:40:56,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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:56,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2178 transitions. [2023-12-15 23:40:56,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-15 23:40:56,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:56,169 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] [2023-12-15 23:40:56,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 23:40:56,170 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:56,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:56,170 INFO L85 PathProgramCache]: Analyzing trace with hash -567046043, now seen corresponding path program 1 times [2023-12-15 23:40:56,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:56,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760925531] [2023-12-15 23:40:56,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:56,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:56,508 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:56,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:56,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760925531] [2023-12-15 23:40:56,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760925531] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:56,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:56,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 23:40:56,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831821307] [2023-12-15 23:40:56,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:56,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 23:40:56,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:56,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 23:40:56,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-15 23:40:56,511 INFO L87 Difference]: Start difference. First operand 1546 states and 2178 transitions. Second operand has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 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:58,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:58,531 INFO L93 Difference]: Finished difference Result 3035 states and 4300 transitions. [2023-12-15 23:40:58,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-15 23:40:58,531 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2023-12-15 23:40:58,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:58,535 INFO L225 Difference]: With dead ends: 3035 [2023-12-15 23:40:58,535 INFO L226 Difference]: Without dead ends: 2821 [2023-12-15 23:40:58,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2023-12-15 23:40:58,536 INFO L413 NwaCegarLoop]: 885 mSDtfsCounter, 6383 mSDsluCounter, 5137 mSDsCounter, 0 mSdLazyCounter, 5111 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6383 SdHoareTripleChecker+Valid, 6022 SdHoareTripleChecker+Invalid, 5118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 5111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:58,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6383 Valid, 6022 Invalid, 5118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 5111 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-15 23:40:58,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2821 states. [2023-12-15 23:40:58,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2821 to 1568. [2023-12-15 23:40:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4372969460688758) internal successors, (2212), 1567 states have internal predecessors, (2212), 0 states have call successors, (0), 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:58,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2212 transitions. [2023-12-15 23:40:58,559 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2212 transitions. Word has length 108 [2023-12-15 23:40:58,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:58,559 INFO L495 AbstractCegarLoop]: Abstraction has 1568 states and 2212 transitions. [2023-12-15 23:40:58,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 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:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2212 transitions. [2023-12-15 23:40:58,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-15 23:40:58,561 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:58,561 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] [2023-12-15 23:40:58,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 23:40:58,561 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:58,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:58,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1864936081, now seen corresponding path program 1 times [2023-12-15 23:40:58,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:58,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558399109] [2023-12-15 23:40:58,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:58,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:40:58,783 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:58,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:40:58,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558399109] [2023-12-15 23:40:58,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558399109] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:40:58,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:40:58,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:40:58,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689970918] [2023-12-15 23:40:58,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:40:58,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:40:58,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:40:58,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:40:58,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:40:58,785 INFO L87 Difference]: Start difference. First operand 1568 states and 2212 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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:59,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:40:59,796 INFO L93 Difference]: Finished difference Result 2453 states and 3483 transitions. [2023-12-15 23:40:59,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 23:40:59,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2023-12-15 23:40:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:40:59,798 INFO L225 Difference]: With dead ends: 2453 [2023-12-15 23:40:59,798 INFO L226 Difference]: Without dead ends: 1803 [2023-12-15 23:40:59,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-12-15 23:40:59,800 INFO L413 NwaCegarLoop]: 886 mSDtfsCounter, 3147 mSDsluCounter, 2558 mSDsCounter, 0 mSdLazyCounter, 2786 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3147 SdHoareTripleChecker+Valid, 3444 SdHoareTripleChecker+Invalid, 2791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-15 23:40:59,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3147 Valid, 3444 Invalid, 2791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2786 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-15 23:40:59,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2023-12-15 23:40:59,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1546. [2023-12-15 23:40:59,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4344100197758733) internal successors, (2176), 1545 states have internal predecessors, (2176), 0 states have call successors, (0), 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:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2176 transitions. [2023-12-15 23:40:59,814 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2176 transitions. Word has length 108 [2023-12-15 23:40:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:40:59,815 INFO L495 AbstractCegarLoop]: Abstraction has 1546 states and 2176 transitions. [2023-12-15 23:40:59,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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:59,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2176 transitions. [2023-12-15 23:40:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-15 23:40:59,817 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:40:59,817 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:59,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-15 23:40:59,817 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:40:59,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:40:59,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1029293072, now seen corresponding path program 1 times [2023-12-15 23:40:59,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:40:59,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280581225] [2023-12-15 23:40:59,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:40:59,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:40:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:41:00,019 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:41:00,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:41:00,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280581225] [2023-12-15 23:41:00,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280581225] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:41:00,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:41:00,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:41:00,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646872440] [2023-12-15 23:41:00,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:41:00,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:41:00,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:41:00,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:41:00,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:41:00,021 INFO L87 Difference]: Start difference. First operand 1546 states and 2176 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 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:41:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:41:01,625 INFO L93 Difference]: Finished difference Result 3037 states and 4328 transitions. [2023-12-15 23:41:01,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:41:01,626 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 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:41:01,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:41:01,630 INFO L225 Difference]: With dead ends: 3037 [2023-12-15 23:41:01,630 INFO L226 Difference]: Without dead ends: 2753 [2023-12-15 23:41:01,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2023-12-15 23:41:01,631 INFO L413 NwaCegarLoop]: 1326 mSDtfsCounter, 3652 mSDsluCounter, 3853 mSDsCounter, 0 mSdLazyCounter, 4145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3652 SdHoareTripleChecker+Valid, 5179 SdHoareTripleChecker+Invalid, 4150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-15 23:41:01,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3652 Valid, 5179 Invalid, 4150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4145 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-15 23:41:01,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2023-12-15 23:41:01,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 1542. [2023-12-15 23:41:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.434897554527429) internal successors, (2171), 1541 states have internal predecessors, (2171), 0 states have call successors, (0), 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:41:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2171 transitions. [2023-12-15 23:41:01,656 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2171 transitions. Word has length 109 [2023-12-15 23:41:01,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:41:01,656 INFO L495 AbstractCegarLoop]: Abstraction has 1542 states and 2171 transitions. [2023-12-15 23:41:01,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 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:41:01,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2171 transitions. [2023-12-15 23:41:01,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 23:41:01,658 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:41:01,658 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] [2023-12-15 23:41:01,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-15 23:41:01,658 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:41:01,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:41:01,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1096308357, now seen corresponding path program 1 times [2023-12-15 23:41:01,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:41:01,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267518239] [2023-12-15 23:41:01,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:41:01,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:41:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:41:01,989 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:41:01,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:41:01,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267518239] [2023-12-15 23:41:01,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267518239] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:41:01,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:41:01,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 23:41:01,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131575076] [2023-12-15 23:41:01,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:41:01,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 23:41:01,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:41:01,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 23:41:01,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-12-15 23:41:01,991 INFO L87 Difference]: Start difference. First operand 1542 states and 2171 transitions. Second operand has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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:41:04,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:41:04,308 INFO L93 Difference]: Finished difference Result 4265 states and 6150 transitions. [2023-12-15 23:41:04,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-15 23:41:04,309 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2023-12-15 23:41:04,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:41:04,330 INFO L225 Difference]: With dead ends: 4265 [2023-12-15 23:41:04,330 INFO L226 Difference]: Without dead ends: 4050 [2023-12-15 23:41:04,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2023-12-15 23:41:04,350 INFO L413 NwaCegarLoop]: 1290 mSDtfsCounter, 10313 mSDsluCounter, 4435 mSDsCounter, 0 mSdLazyCounter, 4861 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10313 SdHoareTripleChecker+Valid, 5725 SdHoareTripleChecker+Invalid, 5196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 4861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-15 23:41:04,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10313 Valid, 5725 Invalid, 5196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 4861 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-15 23:41:04,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4050 states. [2023-12-15 23:41:04,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4050 to 1546. [2023-12-15 23:41:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4337508239947265) internal successors, (2175), 1545 states have internal predecessors, (2175), 0 states have call successors, (0), 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:41:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2175 transitions. [2023-12-15 23:41:04,374 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2175 transitions. Word has length 110 [2023-12-15 23:41:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:41:04,374 INFO L495 AbstractCegarLoop]: Abstraction has 1546 states and 2175 transitions. [2023-12-15 23:41:04,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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:41:04,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2175 transitions. [2023-12-15 23:41:04,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 23:41:04,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:41:04,376 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] [2023-12-15 23:41:04,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-15 23:41:04,376 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:41:04,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:41:04,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1547475906, now seen corresponding path program 1 times [2023-12-15 23:41:04,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:41:04,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980925478] [2023-12-15 23:41:04,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:41:04,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:41:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:41:04,592 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:41:04,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:41:04,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980925478] [2023-12-15 23:41:04,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980925478] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:41:04,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:41:04,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:41:04,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604273734] [2023-12-15 23:41:04,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:41:04,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:41:04,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:41:04,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:41:04,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:41:04,594 INFO L87 Difference]: Start difference. First operand 1546 states and 2175 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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:41:05,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:41:05,659 INFO L93 Difference]: Finished difference Result 2884 states and 4097 transitions. [2023-12-15 23:41:05,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:41:05,660 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2023-12-15 23:41:05,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:41:05,663 INFO L225 Difference]: With dead ends: 2884 [2023-12-15 23:41:05,663 INFO L226 Difference]: Without dead ends: 2701 [2023-12-15 23:41:05,664 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:41:05,664 INFO L413 NwaCegarLoop]: 859 mSDtfsCounter, 6321 mSDsluCounter, 2869 mSDsCounter, 0 mSdLazyCounter, 3079 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6321 SdHoareTripleChecker+Valid, 3728 SdHoareTripleChecker+Invalid, 3083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-15 23:41:05,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6321 Valid, 3728 Invalid, 3083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3079 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-15 23:41:05,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2023-12-15 23:41:05,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 1546. [2023-12-15 23:41:05,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4330916282135795) internal successors, (2174), 1545 states have internal predecessors, (2174), 0 states have call successors, (0), 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:41:05,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2174 transitions. [2023-12-15 23:41:05,680 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2174 transitions. Word has length 110 [2023-12-15 23:41:05,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:41:05,680 INFO L495 AbstractCegarLoop]: Abstraction has 1546 states and 2174 transitions. [2023-12-15 23:41:05,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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:41:05,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2174 transitions. [2023-12-15 23:41:05,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 23:41:05,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:41:05,682 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] [2023-12-15 23:41:05,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-15 23:41:05,682 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:41:05,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:41:05,683 INFO L85 PathProgramCache]: Analyzing trace with hash 325696877, now seen corresponding path program 1 times [2023-12-15 23:41:05,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:41:05,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288408127] [2023-12-15 23:41:05,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:41:05,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:41:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:41:05,872 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:41:05,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:41:05,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288408127] [2023-12-15 23:41:05,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288408127] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:41:05,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:41:05,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:41:05,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152188500] [2023-12-15 23:41:05,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:41:05,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:41:05,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:41:05,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:41:05,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:41:05,874 INFO L87 Difference]: Start difference. First operand 1546 states and 2174 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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:41:07,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:41:07,209 INFO L93 Difference]: Finished difference Result 2928 states and 4169 transitions. [2023-12-15 23:41:07,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 23:41:07,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2023-12-15 23:41:07,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:41:07,213 INFO L225 Difference]: With dead ends: 2928 [2023-12-15 23:41:07,213 INFO L226 Difference]: Without dead ends: 2721 [2023-12-15 23:41:07,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2023-12-15 23:41:07,214 INFO L413 NwaCegarLoop]: 1341 mSDtfsCounter, 4877 mSDsluCounter, 4706 mSDsCounter, 0 mSdLazyCounter, 4522 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4877 SdHoareTripleChecker+Valid, 6047 SdHoareTripleChecker+Invalid, 4525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-15 23:41:07,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4877 Valid, 6047 Invalid, 4525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4522 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-15 23:41:07,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2023-12-15 23:41:07,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 1546. [2023-12-15 23:41:07,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4324324324324325) internal successors, (2173), 1545 states have internal predecessors, (2173), 0 states have call successors, (0), 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:41:07,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2173 transitions. [2023-12-15 23:41:07,231 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2173 transitions. Word has length 110 [2023-12-15 23:41:07,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:41:07,231 INFO L495 AbstractCegarLoop]: Abstraction has 1546 states and 2173 transitions. [2023-12-15 23:41:07,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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:41:07,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2173 transitions. [2023-12-15 23:41:07,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 23:41:07,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:41:07,233 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] [2023-12-15 23:41:07,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-15 23:41:07,233 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:41:07,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:41:07,234 INFO L85 PathProgramCache]: Analyzing trace with hash -583741300, now seen corresponding path program 1 times [2023-12-15 23:41:07,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:41:07,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127050765] [2023-12-15 23:41:07,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:41:07,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:41:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:41:07,404 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:41:07,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:41:07,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127050765] [2023-12-15 23:41:07,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127050765] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:41:07,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:41:07,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:41:07,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101551858] [2023-12-15 23:41:07,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:41:07,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:41:07,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:41:07,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:41:07,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:41:07,406 INFO L87 Difference]: Start difference. First operand 1546 states and 2173 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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:41:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:41:08,387 INFO L93 Difference]: Finished difference Result 2892 states and 4103 transitions. [2023-12-15 23:41:08,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:41:08,387 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2023-12-15 23:41:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:41:08,390 INFO L225 Difference]: With dead ends: 2892 [2023-12-15 23:41:08,390 INFO L226 Difference]: Without dead ends: 2701 [2023-12-15 23:41:08,391 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:41:08,391 INFO L413 NwaCegarLoop]: 899 mSDtfsCounter, 4041 mSDsluCounter, 2971 mSDsCounter, 0 mSdLazyCounter, 3203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4041 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 3207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-15 23:41:08,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4041 Valid, 3870 Invalid, 3207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3203 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-15 23:41:08,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2023-12-15 23:41:08,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 1546. [2023-12-15 23:41:08,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4317732366512854) internal successors, (2172), 1545 states have internal predecessors, (2172), 0 states have call successors, (0), 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:41:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2172 transitions. [2023-12-15 23:41:08,408 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2172 transitions. Word has length 110 [2023-12-15 23:41:08,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:41:08,408 INFO L495 AbstractCegarLoop]: Abstraction has 1546 states and 2172 transitions. [2023-12-15 23:41:08,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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:41:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2172 transitions. [2023-12-15 23:41:08,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 23:41:08,410 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:41:08,410 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] [2023-12-15 23:41:08,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-15 23:41:08,410 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:41:08,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:41:08,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1881631338, now seen corresponding path program 1 times [2023-12-15 23:41:08,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:41:08,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838769059] [2023-12-15 23:41:08,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:41:08,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:41:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:41:08,794 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:41:08,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:41:08,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838769059] [2023-12-15 23:41:08,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838769059] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:41:08,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:41:08,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 23:41:08,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314717586] [2023-12-15 23:41:08,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:41:08,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 23:41:08,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:41:08,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 23:41:08,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-12-15 23:41:08,796 INFO L87 Difference]: Start difference. First operand 1546 states and 2172 transitions. Second operand has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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:41:11,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:41:11,424 INFO L93 Difference]: Finished difference Result 4295 states and 6177 transitions. [2023-12-15 23:41:11,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-15 23:41:11,425 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2023-12-15 23:41:11,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:41:11,429 INFO L225 Difference]: With dead ends: 4295 [2023-12-15 23:41:11,429 INFO L226 Difference]: Without dead ends: 4065 [2023-12-15 23:41:11,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2023-12-15 23:41:11,430 INFO L413 NwaCegarLoop]: 1281 mSDtfsCounter, 10472 mSDsluCounter, 4839 mSDsCounter, 0 mSdLazyCounter, 5051 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10472 SdHoareTripleChecker+Valid, 6120 SdHoareTripleChecker+Invalid, 5398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 5051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-15 23:41:11,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10472 Valid, 6120 Invalid, 5398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 5051 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-15 23:41:11,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4065 states. [2023-12-15 23:41:11,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4065 to 1550. [2023-12-15 23:41:11,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.430637738330046) internal successors, (2176), 1549 states have internal predecessors, (2176), 0 states have call successors, (0), 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:41:11,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2176 transitions. [2023-12-15 23:41:11,449 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2176 transitions. Word has length 110 [2023-12-15 23:41:11,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:41:11,450 INFO L495 AbstractCegarLoop]: Abstraction has 1550 states and 2176 transitions. [2023-12-15 23:41:11,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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:41:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2176 transitions. [2023-12-15 23:41:11,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 23:41:11,452 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:41:11,452 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] [2023-12-15 23:41:11,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-15 23:41:11,452 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:41:11,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:41:11,452 INFO L85 PathProgramCache]: Analyzing trace with hash 169130540, now seen corresponding path program 1 times [2023-12-15 23:41:11,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:41:11,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650836663] [2023-12-15 23:41:11,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:41:11,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:41:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:41:11,653 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:41:11,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:41:11,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650836663] [2023-12-15 23:41:11,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650836663] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:41:11,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:41:11,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:41:11,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142962407] [2023-12-15 23:41:11,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:41:11,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:41:11,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:41:11,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:41:11,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:41:11,654 INFO L87 Difference]: Start difference. First operand 1550 states and 2176 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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:41:12,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:41:12,988 INFO L93 Difference]: Finished difference Result 2936 states and 4173 transitions. [2023-12-15 23:41:12,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 23:41:12,988 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2023-12-15 23:41:12,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:41:12,990 INFO L225 Difference]: With dead ends: 2936 [2023-12-15 23:41:12,990 INFO L226 Difference]: Without dead ends: 2721 [2023-12-15 23:41:12,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2023-12-15 23:41:12,991 INFO L413 NwaCegarLoop]: 1131 mSDtfsCounter, 5095 mSDsluCounter, 4230 mSDsCounter, 0 mSdLazyCounter, 4045 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5095 SdHoareTripleChecker+Valid, 5361 SdHoareTripleChecker+Invalid, 4050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-15 23:41:12,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5095 Valid, 5361 Invalid, 4050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4045 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-15 23:41:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2023-12-15 23:41:13,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 1550. [2023-12-15 23:41:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.4299802761341223) internal successors, (2175), 1549 states have internal predecessors, (2175), 0 states have call successors, (0), 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:41:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2175 transitions. [2023-12-15 23:41:13,007 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2175 transitions. Word has length 110 [2023-12-15 23:41:13,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:41:13,008 INFO L495 AbstractCegarLoop]: Abstraction has 1550 states and 2175 transitions. [2023-12-15 23:41:13,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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:41:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2175 transitions. [2023-12-15 23:41:13,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 23:41:13,009 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:41:13,009 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] [2023-12-15 23:41:13,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-15 23:41:13,010 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:41:13,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:41:13,010 INFO L85 PathProgramCache]: Analyzing trace with hash 656800929, now seen corresponding path program 1 times [2023-12-15 23:41:13,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:41:13,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962331438] [2023-12-15 23:41:13,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:41:13,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:41:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:41:13,188 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:41:13,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:41:13,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962331438] [2023-12-15 23:41:13,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962331438] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:41:13,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:41:13,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:41:13,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93326147] [2023-12-15 23:41:13,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:41:13,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:41:13,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:41:13,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:41:13,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:41:13,190 INFO L87 Difference]: Start difference. First operand 1550 states and 2175 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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:41:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:41:14,254 INFO L93 Difference]: Finished difference Result 2890 states and 4099 transitions. [2023-12-15 23:41:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:41:14,254 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2023-12-15 23:41:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:41:14,257 INFO L225 Difference]: With dead ends: 2890 [2023-12-15 23:41:14,257 INFO L226 Difference]: Without dead ends: 2705 [2023-12-15 23:41:14,257 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:41:14,258 INFO L413 NwaCegarLoop]: 937 mSDtfsCounter, 3959 mSDsluCounter, 3090 mSDsCounter, 0 mSdLazyCounter, 3322 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3959 SdHoareTripleChecker+Valid, 4027 SdHoareTripleChecker+Invalid, 3326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:41:14,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3959 Valid, 4027 Invalid, 3326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3322 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-15 23:41:14,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2705 states. [2023-12-15 23:41:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2705 to 1550. [2023-12-15 23:41:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.4293228139381986) internal successors, (2174), 1549 states have internal predecessors, (2174), 0 states have call successors, (0), 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:41:14,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2174 transitions. [2023-12-15 23:41:14,273 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2174 transitions. Word has length 110 [2023-12-15 23:41:14,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:41:14,273 INFO L495 AbstractCegarLoop]: Abstraction has 1550 states and 2174 transitions. [2023-12-15 23:41:14,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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:41:14,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2174 transitions. [2023-12-15 23:41:14,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 23:41:14,275 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:41:14,275 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] [2023-12-15 23:41:14,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-15 23:41:14,275 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:41:14,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:41:14,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1204907087, now seen corresponding path program 1 times [2023-12-15 23:41:14,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:41:14,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128928685] [2023-12-15 23:41:14,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:41:14,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:41:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:41:14,594 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:41:14,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:41:14,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128928685] [2023-12-15 23:41:14,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128928685] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:41:14,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:41:14,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 23:41:14,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36409417] [2023-12-15 23:41:14,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:41:14,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 23:41:14,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:41:14,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 23:41:14,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-12-15 23:41:14,596 INFO L87 Difference]: Start difference. First operand 1550 states and 2174 transitions. Second operand has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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:41:16,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:41:16,901 INFO L93 Difference]: Finished difference Result 4363 states and 6272 transitions. [2023-12-15 23:41:16,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-15 23:41:16,902 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2023-12-15 23:41:16,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:41:16,906 INFO L225 Difference]: With dead ends: 4363 [2023-12-15 23:41:16,906 INFO L226 Difference]: Without dead ends: 4099 [2023-12-15 23:41:16,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2023-12-15 23:41:16,907 INFO L413 NwaCegarLoop]: 1228 mSDtfsCounter, 10663 mSDsluCounter, 5442 mSDsCounter, 0 mSdLazyCounter, 5558 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10663 SdHoareTripleChecker+Valid, 6670 SdHoareTripleChecker+Invalid, 5920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 5558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-15 23:41:16,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10663 Valid, 6670 Invalid, 5920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 5558 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-15 23:41:16,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4099 states. [2023-12-15 23:41:16,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 1558. [2023-12-15 23:41:16,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1529 states have (on average 1.4270765206017004) internal successors, (2182), 1557 states have internal predecessors, (2182), 0 states have call successors, (0), 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:41:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2182 transitions. [2023-12-15 23:41:16,925 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2182 transitions. Word has length 110 [2023-12-15 23:41:16,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:41:16,925 INFO L495 AbstractCegarLoop]: Abstraction has 1558 states and 2182 transitions. [2023-12-15 23:41:16,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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:41:16,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2182 transitions. [2023-12-15 23:41:16,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 23:41:16,927 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:41:16,927 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] [2023-12-15 23:41:16,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-15 23:41:16,927 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-15 23:41:16,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:41:16,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1039298331, now seen corresponding path program 1 times [2023-12-15 23:41:16,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:41:16,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281774838] [2023-12-15 23:41:16,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:41:16,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:41:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:41:17,120 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:41:17,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:41:17,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281774838] [2023-12-15 23:41:17,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281774838] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:41:17,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:41:17,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:41:17,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066124020] [2023-12-15 23:41:17,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:41:17,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:41:17,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:41:17,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:41:17,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:41:17,121 INFO L87 Difference]: Start difference. First operand 1558 states and 2182 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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:41:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 23:41:17,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-12-15 23:41:17,697 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 1339 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 23:41:17,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 898 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 23:41:17,698 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (28 of 29 remaining) [2023-12-15 23:41:17,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-15 23:41:17,699 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). [2023-12-15 23:41:17,700 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (27 of 29 remaining) [2023-12-15 23:41:17,700 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (26 of 29 remaining) [2023-12-15 23:41:17,700 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (25 of 29 remaining) [2023-12-15 23:41:17,700 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (24 of 29 remaining) [2023-12-15 23:41:17,700 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (23 of 29 remaining) [2023-12-15 23:41:17,700 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (22 of 29 remaining) [2023-12-15 23:41:17,700 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (21 of 29 remaining) [2023-12-15 23:41:17,700 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (20 of 29 remaining) [2023-12-15 23:41:17,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (19 of 29 remaining) [2023-12-15 23:41:17,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (18 of 29 remaining) [2023-12-15 23:41:17,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (17 of 29 remaining) [2023-12-15 23:41:17,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (16 of 29 remaining) [2023-12-15 23:41:17,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (15 of 29 remaining) [2023-12-15 23:41:17,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (14 of 29 remaining) [2023-12-15 23:41:17,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (13 of 29 remaining) [2023-12-15 23:41:17,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (12 of 29 remaining) [2023-12-15 23:41:17,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (11 of 29 remaining) [2023-12-15 23:41:17,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (10 of 29 remaining) [2023-12-15 23:41:17,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (9 of 29 remaining) [2023-12-15 23:41:17,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (8 of 29 remaining) [2023-12-15 23:41:17,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (7 of 29 remaining) [2023-12-15 23:41:17,702 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (6 of 29 remaining) [2023-12-15 23:41:17,702 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (5 of 29 remaining) [2023-12-15 23:41:17,702 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (4 of 29 remaining) [2023-12-15 23:41:17,702 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (3 of 29 remaining) [2023-12-15 23:41:17,702 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (2 of 29 remaining) [2023-12-15 23:41:17,702 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (1 of 29 remaining) [2023-12-15 23:41:17,702 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (0 of 29 remaining) [2023-12-15 23:41:17,703 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:41:17,722 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:41:17,724 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 23:41:17,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 11:41:17 BoogieIcfgContainer [2023-12-15 23:41:17,728 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 23:41:17,728 INFO L158 Benchmark]: Toolchain (without parser) took 57557.70ms. Allocated memory was 219.2MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 142.2MB in the beginning and 768.4MB in the end (delta: -626.2MB). Peak memory consumption was 851.7MB. Max. memory is 8.0GB. [2023-12-15 23:41:17,728 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 219.2MB. Free memory is still 169.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 23:41:17,728 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1947.34ms. Allocated memory was 219.2MB in the beginning and 267.4MB in the end (delta: 48.2MB). Free memory was 142.0MB in the beginning and 118.4MB in the end (delta: 23.6MB). Peak memory consumption was 129.2MB. Max. memory is 8.0GB. [2023-12-15 23:41:17,728 INFO L158 Benchmark]: Boogie Procedure Inliner took 267.09ms. Allocated memory is still 267.4MB. Free memory was 118.4MB in the beginning and 181.5MB in the end (delta: -63.2MB). Peak memory consumption was 38.0MB. Max. memory is 8.0GB. [2023-12-15 23:41:17,730 INFO L158 Benchmark]: Boogie Preprocessor took 380.95ms. Allocated memory is still 267.4MB. Free memory was 181.5MB in the beginning and 179.1MB in the end (delta: 2.4MB). Peak memory consumption was 70.6MB. Max. memory is 8.0GB. [2023-12-15 23:41:17,730 INFO L158 Benchmark]: RCFGBuilder took 3984.05ms. Allocated memory was 267.4MB in the beginning and 836.8MB in the end (delta: 569.4MB). Free memory was 179.1MB in the beginning and 593.2MB in the end (delta: -414.1MB). Peak memory consumption was 188.9MB. Max. memory is 8.0GB. [2023-12-15 23:41:17,731 INFO L158 Benchmark]: TraceAbstraction took 50972.25ms. Allocated memory was 836.8MB in the beginning and 1.7GB in the end (delta: 859.8MB). Free memory was 592.6MB in the beginning and 768.4MB in the end (delta: -175.8MB). Peak memory consumption was 684.0MB. Max. memory is 8.0GB. [2023-12-15 23:41:17,737 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.58ms. Allocated memory is still 219.2MB. Free memory is still 169.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1947.34ms. Allocated memory was 219.2MB in the beginning and 267.4MB in the end (delta: 48.2MB). Free memory was 142.0MB in the beginning and 118.4MB in the end (delta: 23.6MB). Peak memory consumption was 129.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 267.09ms. Allocated memory is still 267.4MB. Free memory was 118.4MB in the beginning and 181.5MB in the end (delta: -63.2MB). Peak memory consumption was 38.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 380.95ms. Allocated memory is still 267.4MB. Free memory was 181.5MB in the beginning and 179.1MB in the end (delta: 2.4MB). Peak memory consumption was 70.6MB. Max. memory is 8.0GB. * RCFGBuilder took 3984.05ms. Allocated memory was 267.4MB in the beginning and 836.8MB in the end (delta: 569.4MB). Free memory was 179.1MB in the beginning and 593.2MB in the end (delta: -414.1MB). Peak memory consumption was 188.9MB. Max. memory is 8.0GB. * TraceAbstraction took 50972.25ms. Allocated memory was 836.8MB in the beginning and 1.7GB in the end (delta: 859.8MB). Free memory was 592.6MB in the beginning and 768.4MB in the end (delta: -175.8MB). Peak memory consumption was 684.0MB. 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: 4612]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4612). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 905]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 905). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1335]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1335). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1431]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1431). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1486]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1486). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1609]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1609). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1664]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1664). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1746]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1746). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1937]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1937). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1992]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1992). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2074]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2074). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2224]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2224). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2524]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2524). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2579]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2579). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2661]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2661). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2811]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2811). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 3070]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3070). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 3560]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3560). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 3615]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3615). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 3697]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3697). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 3847]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3847). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4120]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4120). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 5539]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5539). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 5594]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5594). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 5676]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5676). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 5826]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5826). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 6085]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 6085). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 6534]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 6534). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 7333]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 7333). Cancelled while NwaCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (688 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 2062 locations, 29 error locations. Started 1 CEGAR loops. OverallTime: 50.9s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 42.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 176427 SdHoareTripleChecker+Valid, 36.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176427 mSDsluCounter, 107948 SdHoareTripleChecker+Invalid, 30.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78790 mSDsCounter, 1653 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 89751 IncrementalHoareTripleChecker+Invalid, 91404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1653 mSolverCounterUnsat, 29158 mSDtfsCounter, 89751 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 513 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 483 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1997 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2062occurred in iteration=0, InterpolantAutomatonStates: 388, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 29 MinimizatonAttempts, 29602 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 3211 NumberOfCodeBlocks, 3211 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3181 ConstructedInterpolants, 0 QuantifiedInterpolants, 23660 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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