./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b77f3a84818afa598b0eb39254acb84b353143275f6b4c2e95d15ee5488d008 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:51:43,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:51:44,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:51:44,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:51:44,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:51:44,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:51:44,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:51:44,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:51:44,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:51:44,070 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:51:44,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:51:44,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:51:44,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:51:44,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:51:44,072 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:51:44,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:51:44,072 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:51:44,072 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:51:44,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:51:44,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:51:44,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:51:44,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:51:44,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:51:44,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:51:44,076 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:51:44,076 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:51:44,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:51:44,076 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:51:44,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:51:44,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:51:44,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:51:44,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:51:44,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:51:44,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:51:44,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:51:44,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:51:44,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:51:44,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:51:44,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:51:44,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:51:44,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:51:44,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:51:44,080 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-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b77f3a84818afa598b0eb39254acb84b353143275f6b4c2e95d15ee5488d008 [2024-10-11 03:51:44,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:51:44,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:51:44,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:51:44,297 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:51:44,298 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:51:44,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-11 03:51:45,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:51:45,919 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:51:45,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-11 03:51:45,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ccf5c4661/c4649ecbecc04662b3d8f341181ec814/FLAGb5d5c320a [2024-10-11 03:51:45,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ccf5c4661/c4649ecbecc04662b3d8f341181ec814 [2024-10-11 03:51:45,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:51:45,967 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:51:45,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:51:45,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:51:45,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:51:45,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:51:45" (1/1) ... [2024-10-11 03:51:45,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bb9d9ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:45, skipping insertion in model container [2024-10-11 03:51:45,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:51:45" (1/1) ... [2024-10-11 03:51:46,105 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:51:46,452 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16849,16862] [2024-10-11 03:51:46,484 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21942,21955] [2024-10-11 03:51:46,495 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23299,23312] [2024-10-11 03:51:46,500 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24107,24120] [2024-10-11 03:51:46,507 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25792,25805] [2024-10-11 03:51:46,512 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26600,26613] [2024-10-11 03:51:46,516 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27736,27749] [2024-10-11 03:51:46,531 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30390,30403] [2024-10-11 03:51:46,535 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31201,31214] [2024-10-11 03:51:46,540 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[32340,32353] [2024-10-11 03:51:46,548 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34445,34458] [2024-10-11 03:51:46,564 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[38533,38546] [2024-10-11 03:51:46,568 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[39344,39357] [2024-10-11 03:51:46,574 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[40483,40496] [2024-10-11 03:51:46,581 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[42588,42601] [2024-10-11 03:51:46,592 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[46127,46140] [2024-10-11 03:51:46,610 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[52573,52586] [2024-10-11 03:51:46,618 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[53384,53397] [2024-10-11 03:51:46,627 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[54527,54540] [2024-10-11 03:51:46,638 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[56636,56649] [2024-10-11 03:51:46,656 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[60424,60437] [2024-10-11 03:51:46,690 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[67072,67085] [2024-10-11 03:51:46,726 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[79206,79219] [2024-10-11 03:51:46,729 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[80017,80030] [2024-10-11 03:51:46,733 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[81156,81169] [2024-10-11 03:51:46,742 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[83261,83274] [2024-10-11 03:51:46,753 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[86800,86813] [2024-10-11 03:51:46,772 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[92697,92710] [2024-10-11 03:51:46,796 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[102772,102785] [2024-10-11 03:51:47,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:51:47,251 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:51:47,300 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16849,16862] [2024-10-11 03:51:47,309 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21942,21955] [2024-10-11 03:51:47,313 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23299,23312] [2024-10-11 03:51:47,316 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24107,24120] [2024-10-11 03:51:47,322 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25792,25805] [2024-10-11 03:51:47,325 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26600,26613] [2024-10-11 03:51:47,328 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27736,27749] [2024-10-11 03:51:47,334 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30390,30403] [2024-10-11 03:51:47,339 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31201,31214] [2024-10-11 03:51:47,342 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[32340,32353] [2024-10-11 03:51:47,347 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34445,34458] [2024-10-11 03:51:47,356 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[38533,38546] [2024-10-11 03:51:47,358 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[39344,39357] [2024-10-11 03:51:47,362 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[40483,40496] [2024-10-11 03:51:47,367 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[42588,42601] [2024-10-11 03:51:47,378 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[46127,46140] [2024-10-11 03:51:47,392 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[52573,52586] [2024-10-11 03:51:47,395 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[53384,53397] [2024-10-11 03:51:47,398 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[54527,54540] [2024-10-11 03:51:47,403 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[56636,56649] [2024-10-11 03:51:47,412 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[60424,60437] [2024-10-11 03:51:47,426 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[67072,67085] [2024-10-11 03:51:47,455 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[79206,79219] [2024-10-11 03:51:47,458 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[80017,80030] [2024-10-11 03:51:47,463 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[81156,81169] [2024-10-11 03:51:47,469 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[83261,83274] [2024-10-11 03:51:47,476 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[86800,86813] [2024-10-11 03:51:47,488 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[92697,92710] [2024-10-11 03:51:47,505 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[102772,102785] [2024-10-11 03:51:47,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:51:47,852 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:51:47,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:47 WrapperNode [2024-10-11 03:51:47,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:51:47,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:51:47,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:51:47,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:51:47,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:47" (1/1) ... [2024-10-11 03:51:47,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:47" (1/1) ... [2024-10-11 03:51:48,048 INFO L138 Inliner]: procedures = 27, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 12868 [2024-10-11 03:51:48,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:51:48,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:51:48,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:51:48,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:51:48,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:47" (1/1) ... [2024-10-11 03:51:48,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:47" (1/1) ... [2024-10-11 03:51:48,091 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:47" (1/1) ... [2024-10-11 03:51:48,159 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:51:48,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:47" (1/1) ... [2024-10-11 03:51:48,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:47" (1/1) ... [2024-10-11 03:51:48,288 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:47" (1/1) ... [2024-10-11 03:51:48,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:47" (1/1) ... [2024-10-11 03:51:48,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:47" (1/1) ... [2024-10-11 03:51:48,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:47" (1/1) ... [2024-10-11 03:51:48,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:51:48,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:51:48,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:51:48,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:51:48,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:47" (1/1) ... [2024-10-11 03:51:48,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:51:48,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:51:48,397 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:51:48,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:51:48,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:51:48,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:51:48,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:51:48,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:51:48,734 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:51:48,736 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:51:52,825 INFO L? ?]: Removed 1884 outVars from TransFormulas that were not future-live. [2024-10-11 03:51:52,825 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:51:52,897 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:51:52,897 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:51:52,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:51:52 BoogieIcfgContainer [2024-10-11 03:51:52,898 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:51:52,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:51:52,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:51:52,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:51:52,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:51:45" (1/3) ... [2024-10-11 03:51:52,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460f12e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:51:52, skipping insertion in model container [2024-10-11 03:51:52,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:47" (2/3) ... [2024-10-11 03:51:52,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460f12e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:51:52, skipping insertion in model container [2024-10-11 03:51:52,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:51:52" (3/3) ... [2024-10-11 03:51:52,904 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-11 03:51:52,916 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:51:52,917 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-10-11 03:51:52,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:51:53,001 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7ff97bf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:51:53,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-10-11 03:51:53,012 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) [2024-10-11 03:51:53,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 03:51:53,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:53,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:53,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:51:53,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:53,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1135640583, now seen corresponding path program 1 times [2024-10-11 03:51:53,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:53,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670826980] [2024-10-11 03:51:53,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:53,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:53,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:53,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:53,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670826980] [2024-10-11 03:51:53,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670826980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:53,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:53,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:53,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962727392] [2024-10-11 03:51:53,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:53,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:53,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:53,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:53,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:53,668 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) [2024-10-11 03:51:54,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:54,639 INFO L93 Difference]: Finished difference Result 3055 states and 5451 transitions. [2024-10-11 03:51:54,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:54,641 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 [2024-10-11 03:51:54,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:54,701 INFO L225 Difference]: With dead ends: 3055 [2024-10-11 03:51:54,702 INFO L226 Difference]: Without dead ends: 1560 [2024-10-11 03:51:54,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:54,708 INFO L432 NwaCegarLoop]: 1832 mSDtfsCounter, 8183 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:54,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8183 Valid, 1872 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:51:54,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2024-10-11 03:51:54,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1560. [2024-10-11 03:51:54,775 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) [2024-10-11 03:51:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2035 transitions. [2024-10-11 03:51:54,778 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2035 transitions. Word has length 99 [2024-10-11 03:51:54,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:54,779 INFO L471 AbstractCegarLoop]: Abstraction has 1560 states and 2035 transitions. [2024-10-11 03:51:54,779 INFO L472 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) [2024-10-11 03:51:54,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2035 transitions. [2024-10-11 03:51:54,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:51:54,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:54,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:54,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:51:54,784 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:51:54,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:54,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1968753033, now seen corresponding path program 1 times [2024-10-11 03:51:54,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:54,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331427825] [2024-10-11 03:51:54,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:54,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:54,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:54,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331427825] [2024-10-11 03:51:54,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331427825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:54,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:54,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:54,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505072602] [2024-10-11 03:51:54,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:54,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:54,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:54,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:54,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:54,998 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) [2024-10-11 03:51:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:55,766 INFO L93 Difference]: Finished difference Result 2547 states and 3434 transitions. [2024-10-11 03:51:55,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:55,766 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 [2024-10-11 03:51:55,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:55,770 INFO L225 Difference]: With dead ends: 2547 [2024-10-11 03:51:55,770 INFO L226 Difference]: Without dead ends: 1352 [2024-10-11 03:51:55,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:55,772 INFO L432 NwaCegarLoop]: 918 mSDtfsCounter, 5239 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:55,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5239 Valid, 962 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:51:55,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2024-10-11 03:51:55,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1352. [2024-10-11 03:51:55,788 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) [2024-10-11 03:51:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1794 transitions. [2024-10-11 03:51:55,790 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1794 transitions. Word has length 100 [2024-10-11 03:51:55,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:55,791 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 1794 transitions. [2024-10-11 03:51:55,791 INFO L472 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) [2024-10-11 03:51:55,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1794 transitions. [2024-10-11 03:51:55,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 03:51:55,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:55,794 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:55,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:51:55,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:51:55,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:55,795 INFO L85 PathProgramCache]: Analyzing trace with hash -703352954, now seen corresponding path program 1 times [2024-10-11 03:51:55,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:55,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933302276] [2024-10-11 03:51:55,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:55,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:55,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:55,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933302276] [2024-10-11 03:51:55,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933302276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:55,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:55,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:55,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571000531] [2024-10-11 03:51:55,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:55,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:55,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:55,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:55,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:55,971 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) [2024-10-11 03:51:56,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:56,606 INFO L93 Difference]: Finished difference Result 2339 states and 3192 transitions. [2024-10-11 03:51:56,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:56,606 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 [2024-10-11 03:51:56,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:56,610 INFO L225 Difference]: With dead ends: 2339 [2024-10-11 03:51:56,610 INFO L226 Difference]: Without dead ends: 1212 [2024-10-11 03:51:56,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:56,612 INFO L432 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 [2024-10-11 03:51:56,612 INFO L433 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] [2024-10-11 03:51:56,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2024-10-11 03:51:56,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2024-10-11 03:51:56,624 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) [2024-10-11 03:51:56,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1637 transitions. [2024-10-11 03:51:56,626 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1637 transitions. Word has length 101 [2024-10-11 03:51:56,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:56,627 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1637 transitions. [2024-10-11 03:51:56,627 INFO L472 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) [2024-10-11 03:51:56,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1637 transitions. [2024-10-11 03:51:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 03:51:56,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:56,629 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:56,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:51:56,629 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:51:56,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:56,630 INFO L85 PathProgramCache]: Analyzing trace with hash 472316096, now seen corresponding path program 1 times [2024-10-11 03:51:56,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:56,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145045786] [2024-10-11 03:51:56,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:56,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:56,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:56,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:56,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145045786] [2024-10-11 03:51:56,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145045786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:56,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:56,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:56,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720952732] [2024-10-11 03:51:56,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:56,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:56,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:56,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:56,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:56,824 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) [2024-10-11 03:51:57,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:57,549 INFO L93 Difference]: Finished difference Result 2199 states and 3034 transitions. [2024-10-11 03:51:57,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:57,550 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 [2024-10-11 03:51:57,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:57,553 INFO L225 Difference]: With dead ends: 2199 [2024-10-11 03:51:57,553 INFO L226 Difference]: Without dead ends: 1172 [2024-10-11 03:51:57,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:57,555 INFO L432 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.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:57,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4578 Valid, 707 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:51:57,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2024-10-11 03:51:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1172. [2024-10-11 03:51:57,568 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) [2024-10-11 03:51:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1588 transitions. [2024-10-11 03:51:57,569 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1588 transitions. Word has length 102 [2024-10-11 03:51:57,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:57,570 INFO L471 AbstractCegarLoop]: Abstraction has 1172 states and 1588 transitions. [2024-10-11 03:51:57,570 INFO L472 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) [2024-10-11 03:51:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1588 transitions. [2024-10-11 03:51:57,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 03:51:57,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:57,572 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:57,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:51:57,572 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:51:57,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:57,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1771013563, now seen corresponding path program 1 times [2024-10-11 03:51:57,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:57,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049175190] [2024-10-11 03:51:57,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:57,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:57,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:57,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049175190] [2024-10-11 03:51:57,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049175190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:57,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:57,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:57,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880417196] [2024-10-11 03:51:57,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:57,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:57,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:57,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:57,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:57,708 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) [2024-10-11 03:51:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:58,185 INFO L93 Difference]: Finished difference Result 2159 states and 2984 transitions. [2024-10-11 03:51:58,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:58,189 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 [2024-10-11 03:51:58,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:58,192 INFO L225 Difference]: With dead ends: 2159 [2024-10-11 03:51:58,192 INFO L226 Difference]: Without dead ends: 1110 [2024-10-11 03:51:58,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:58,194 INFO L432 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:58,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4491 Valid, 847 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:51:58,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2024-10-11 03:51:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2024-10-11 03:51:58,204 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) [2024-10-11 03:51:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1521 transitions. [2024-10-11 03:51:58,205 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1521 transitions. Word has length 103 [2024-10-11 03:51:58,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:58,206 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1521 transitions. [2024-10-11 03:51:58,206 INFO L472 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) [2024-10-11 03:51:58,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1521 transitions. [2024-10-11 03:51:58,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 03:51:58,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:58,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:58,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:51:58,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:51:58,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:58,208 INFO L85 PathProgramCache]: Analyzing trace with hash -54343083, now seen corresponding path program 1 times [2024-10-11 03:51:58,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:58,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700827181] [2024-10-11 03:51:58,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:58,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:58,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:58,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700827181] [2024-10-11 03:51:58,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700827181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:58,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:58,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:58,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198640560] [2024-10-11 03:51:58,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:58,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:58,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:58,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:58,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:58,349 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) [2024-10-11 03:51:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:59,154 INFO L93 Difference]: Finished difference Result 2676 states and 3716 transitions. [2024-10-11 03:51:59,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:59,154 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 [2024-10-11 03:51:59,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:59,158 INFO L225 Difference]: With dead ends: 2676 [2024-10-11 03:51:59,159 INFO L226 Difference]: Without dead ends: 1655 [2024-10-11 03:51:59,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:59,161 INFO L432 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 [2024-10-11 03:51:59,162 INFO L433 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] [2024-10-11 03:51:59,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2024-10-11 03:51:59,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1553. [2024-10-11 03:51:59,191 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) [2024-10-11 03:51:59,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 2201 transitions. [2024-10-11 03:51:59,193 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 2201 transitions. Word has length 104 [2024-10-11 03:51:59,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:59,193 INFO L471 AbstractCegarLoop]: Abstraction has 1553 states and 2201 transitions. [2024-10-11 03:51:59,193 INFO L472 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) [2024-10-11 03:51:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 2201 transitions. [2024-10-11 03:51:59,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 03:51:59,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:59,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:59,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:51:59,196 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:51:59,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:59,197 INFO L85 PathProgramCache]: Analyzing trace with hash 883423548, now seen corresponding path program 1 times [2024-10-11 03:51:59,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:59,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759233407] [2024-10-11 03:51:59,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:59,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:59,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:59,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759233407] [2024-10-11 03:51:59,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759233407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:59,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:59,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:59,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984641302] [2024-10-11 03:51:59,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:59,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:59,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:59,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:59,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:59,373 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) [2024-10-11 03:52:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:00,003 INFO L93 Difference]: Finished difference Result 3017 states and 4312 transitions. [2024-10-11 03:52:00,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:52:00,004 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 [2024-10-11 03:52:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:00,009 INFO L225 Difference]: With dead ends: 3017 [2024-10-11 03:52:00,009 INFO L226 Difference]: Without dead ends: 1542 [2024-10-11 03:52:00,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:52:00,012 INFO L432 NwaCegarLoop]: 768 mSDtfsCounter, 4296 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:00,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4296 Valid, 804 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:52:00,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2024-10-11 03:52:00,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1542. [2024-10-11 03:52:00,036 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) [2024-10-11 03:52:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2187 transitions. [2024-10-11 03:52:00,038 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2187 transitions. Word has length 105 [2024-10-11 03:52:00,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:00,038 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2187 transitions. [2024-10-11 03:52:00,039 INFO L472 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) [2024-10-11 03:52:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2187 transitions. [2024-10-11 03:52:00,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 03:52:00,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:00,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:00,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:52:00,042 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:00,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:00,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1511270635, now seen corresponding path program 1 times [2024-10-11 03:52:00,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:00,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794632720] [2024-10-11 03:52:00,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:00,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:00,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:00,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:00,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794632720] [2024-10-11 03:52:00,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794632720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:00,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:00,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:00,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990896897] [2024-10-11 03:52:00,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:00,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:00,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:00,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:00,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:00,426 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) [2024-10-11 03:52:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:01,775 INFO L93 Difference]: Finished difference Result 2508 states and 3548 transitions. [2024-10-11 03:52:01,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:01,775 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 [2024-10-11 03:52:01,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:01,780 INFO L225 Difference]: With dead ends: 2508 [2024-10-11 03:52:01,780 INFO L226 Difference]: Without dead ends: 2124 [2024-10-11 03:52:01,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:52:01,782 INFO L432 NwaCegarLoop]: 809 mSDtfsCounter, 6049 mSDsluCounter, 2776 mSDsCounter, 0 mSdLazyCounter, 2971 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6049 SdHoareTripleChecker+Valid, 3585 SdHoareTripleChecker+Invalid, 2975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:01,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6049 Valid, 3585 Invalid, 2975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2971 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:52:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2024-10-11 03:52:01,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 1542. [2024-10-11 03:52:01,843 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) [2024-10-11 03:52:01,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2186 transitions. [2024-10-11 03:52:01,845 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2186 transitions. Word has length 106 [2024-10-11 03:52:01,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:01,845 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2186 transitions. [2024-10-11 03:52:01,845 INFO L472 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) [2024-10-11 03:52:01,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2186 transitions. [2024-10-11 03:52:01,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 03:52:01,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:01,847 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:01,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:52:01,847 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:01,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:01,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1798506288, now seen corresponding path program 1 times [2024-10-11 03:52:01,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:01,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051052027] [2024-10-11 03:52:01,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:01,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:02,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:02,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051052027] [2024-10-11 03:52:02,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051052027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:02,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:02,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:02,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951923131] [2024-10-11 03:52:02,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:02,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:02,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:02,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:02,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:02,112 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) [2024-10-11 03:52:03,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:03,452 INFO L93 Difference]: Finished difference Result 2552 states and 3616 transitions. [2024-10-11 03:52:03,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:03,453 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 [2024-10-11 03:52:03,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:03,458 INFO L225 Difference]: With dead ends: 2552 [2024-10-11 03:52:03,458 INFO L226 Difference]: Without dead ends: 2361 [2024-10-11 03:52:03,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:03,459 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 3826 mSDsluCounter, 2696 mSDsCounter, 0 mSdLazyCounter, 2946 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3826 SdHoareTripleChecker+Valid, 3492 SdHoareTripleChecker+Invalid, 2950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:03,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3826 Valid, 3492 Invalid, 2950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2946 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:52:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2024-10-11 03:52:03,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 1542. [2024-10-11 03:52:03,483 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) [2024-10-11 03:52:03,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2185 transitions. [2024-10-11 03:52:03,485 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2185 transitions. Word has length 106 [2024-10-11 03:52:03,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:03,485 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2185 transitions. [2024-10-11 03:52:03,485 INFO L472 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) [2024-10-11 03:52:03,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2185 transitions. [2024-10-11 03:52:03,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 03:52:03,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:03,488 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:03,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:52:03,488 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:03,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:03,491 INFO L85 PathProgramCache]: Analyzing trace with hash -43154195, now seen corresponding path program 1 times [2024-10-11 03:52:03,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:03,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488146780] [2024-10-11 03:52:03,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:03,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:03,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:03,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488146780] [2024-10-11 03:52:03,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488146780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:03,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:03,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:52:03,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211691084] [2024-10-11 03:52:03,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:03,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:52:03,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:03,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:52:03,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:52:03,789 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) [2024-10-11 03:52:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:05,091 INFO L93 Difference]: Finished difference Result 2661 states and 3645 transitions. [2024-10-11 03:52:05,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:52:05,092 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 [2024-10-11 03:52:05,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:05,097 INFO L225 Difference]: With dead ends: 2661 [2024-10-11 03:52:05,097 INFO L226 Difference]: Without dead ends: 2001 [2024-10-11 03:52:05,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:52:05,098 INFO L432 NwaCegarLoop]: 650 mSDtfsCounter, 4095 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 2774 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4095 SdHoareTripleChecker+Valid, 2200 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:05,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4095 Valid, 2200 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2774 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:52:05,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2024-10-11 03:52:05,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1542. [2024-10-11 03:52:05,119 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) [2024-10-11 03:52:05,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2184 transitions. [2024-10-11 03:52:05,121 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2184 transitions. Word has length 106 [2024-10-11 03:52:05,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:05,121 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2184 transitions. [2024-10-11 03:52:05,121 INFO L472 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) [2024-10-11 03:52:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2184 transitions. [2024-10-11 03:52:05,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 03:52:05,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:05,123 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:05,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:52:05,124 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:05,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:05,125 INFO L85 PathProgramCache]: Analyzing trace with hash -2099836846, now seen corresponding path program 1 times [2024-10-11 03:52:05,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:05,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945679028] [2024-10-11 03:52:05,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:05,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:05,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:05,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945679028] [2024-10-11 03:52:05,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945679028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:05,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:05,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:05,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435813922] [2024-10-11 03:52:05,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:05,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:05,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:05,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:05,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:05,415 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) [2024-10-11 03:52:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:06,848 INFO L93 Difference]: Finished difference Result 2678 states and 3814 transitions. [2024-10-11 03:52:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:06,848 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 [2024-10-11 03:52:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:06,854 INFO L225 Difference]: With dead ends: 2678 [2024-10-11 03:52:06,854 INFO L226 Difference]: Without dead ends: 2417 [2024-10-11 03:52:06,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:06,855 INFO L432 NwaCegarLoop]: 978 mSDtfsCounter, 5422 mSDsluCounter, 3292 mSDsCounter, 0 mSdLazyCounter, 3510 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5422 SdHoareTripleChecker+Valid, 4270 SdHoareTripleChecker+Invalid, 3514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:06,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5422 Valid, 4270 Invalid, 3514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3510 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 03:52:06,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2024-10-11 03:52:06,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 1542. [2024-10-11 03:52:06,877 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) [2024-10-11 03:52:06,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2183 transitions. [2024-10-11 03:52:06,878 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2183 transitions. Word has length 108 [2024-10-11 03:52:06,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:06,879 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2183 transitions. [2024-10-11 03:52:06,879 INFO L472 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) [2024-10-11 03:52:06,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2183 transitions. [2024-10-11 03:52:06,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 03:52:06,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:06,882 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:06,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:52:06,883 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:06,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:06,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1111952338, now seen corresponding path program 1 times [2024-10-11 03:52:06,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:06,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008160172] [2024-10-11 03:52:06,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:06,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:07,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:07,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:07,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008160172] [2024-10-11 03:52:07,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008160172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:07,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:07,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:07,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29744133] [2024-10-11 03:52:07,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:07,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:07,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:07,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:07,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:07,164 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) [2024-10-11 03:52:08,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:08,312 INFO L93 Difference]: Finished difference Result 2487 states and 3507 transitions. [2024-10-11 03:52:08,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:08,313 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 [2024-10-11 03:52:08,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:08,318 INFO L225 Difference]: With dead ends: 2487 [2024-10-11 03:52:08,318 INFO L226 Difference]: Without dead ends: 2313 [2024-10-11 03:52:08,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:08,319 INFO L432 NwaCegarLoop]: 797 mSDtfsCounter, 5943 mSDsluCounter, 2636 mSDsCounter, 0 mSdLazyCounter, 2970 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5943 SdHoareTripleChecker+Valid, 3433 SdHoareTripleChecker+Invalid, 2974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:08,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5943 Valid, 3433 Invalid, 2974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2970 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:52:08,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2024-10-11 03:52:08,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 1542. [2024-10-11 03:52:08,335 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) [2024-10-11 03:52:08,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2182 transitions. [2024-10-11 03:52:08,337 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2182 transitions. Word has length 108 [2024-10-11 03:52:08,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:08,338 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2182 transitions. [2024-10-11 03:52:08,338 INFO L472 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) [2024-10-11 03:52:08,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2182 transitions. [2024-10-11 03:52:08,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 03:52:08,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:08,340 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:08,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:52:08,340 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:08,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:08,341 INFO L85 PathProgramCache]: Analyzing trace with hash -507418736, now seen corresponding path program 1 times [2024-10-11 03:52:08,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:08,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125909778] [2024-10-11 03:52:08,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:08,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:08,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:08,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:08,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125909778] [2024-10-11 03:52:08,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125909778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:08,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:08,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:08,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850557476] [2024-10-11 03:52:08,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:08,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:08,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:08,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:08,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:08,575 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) [2024-10-11 03:52:09,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:09,971 INFO L93 Difference]: Finished difference Result 2701 states and 3836 transitions. [2024-10-11 03:52:09,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:09,971 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 [2024-10-11 03:52:09,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:09,976 INFO L225 Difference]: With dead ends: 2701 [2024-10-11 03:52:09,976 INFO L226 Difference]: Without dead ends: 2417 [2024-10-11 03:52:09,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:09,977 INFO L432 NwaCegarLoop]: 1022 mSDtfsCounter, 5226 mSDsluCounter, 3419 mSDsCounter, 0 mSdLazyCounter, 3698 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5226 SdHoareTripleChecker+Valid, 4441 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:09,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5226 Valid, 4441 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3698 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:52:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2024-10-11 03:52:09,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 1542. [2024-10-11 03:52:09,999 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) [2024-10-11 03:52:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2181 transitions. [2024-10-11 03:52:10,002 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2181 transitions. Word has length 108 [2024-10-11 03:52:10,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:10,002 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2181 transitions. [2024-10-11 03:52:10,002 INFO L472 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) [2024-10-11 03:52:10,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2181 transitions. [2024-10-11 03:52:10,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 03:52:10,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:10,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:10,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:52:10,005 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:10,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:10,006 INFO L85 PathProgramCache]: Analyzing trace with hash 899330884, now seen corresponding path program 1 times [2024-10-11 03:52:10,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:10,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42514640] [2024-10-11 03:52:10,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:10,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:10,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:10,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:10,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42514640] [2024-10-11 03:52:10,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42514640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:10,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:10,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:10,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171039287] [2024-10-11 03:52:10,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:10,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:10,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:10,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:10,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:10,344 INFO L87 Difference]: Start difference. First operand 1542 states and 2181 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) [2024-10-11 03:52:11,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:11,742 INFO L93 Difference]: Finished difference Result 2600 states and 3689 transitions. [2024-10-11 03:52:11,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:52:11,743 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 [2024-10-11 03:52:11,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:11,748 INFO L225 Difference]: With dead ends: 2600 [2024-10-11 03:52:11,748 INFO L226 Difference]: Without dead ends: 2385 [2024-10-11 03:52:11,749 INFO L431 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 [2024-10-11 03:52:11,750 INFO L432 NwaCegarLoop]: 1104 mSDtfsCounter, 4450 mSDsluCounter, 4121 mSDsCounter, 0 mSdLazyCounter, 4047 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4450 SdHoareTripleChecker+Valid, 5225 SdHoareTripleChecker+Invalid, 4051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:11,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4450 Valid, 5225 Invalid, 4051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4047 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 03:52:11,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2024-10-11 03:52:11,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1542. [2024-10-11 03:52:11,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.4408460013218771) internal successors, (2180), 1541 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) [2024-10-11 03:52:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2180 transitions. [2024-10-11 03:52:11,768 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2180 transitions. Word has length 108 [2024-10-11 03:52:11,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:11,768 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2180 transitions. [2024-10-11 03:52:11,768 INFO L472 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) [2024-10-11 03:52:11,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2180 transitions. [2024-10-11 03:52:11,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 03:52:11,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:11,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:11,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:52:11,774 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:11,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:11,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1176238153, now seen corresponding path program 1 times [2024-10-11 03:52:11,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:11,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471899911] [2024-10-11 03:52:11,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:11,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:11,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:11,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471899911] [2024-10-11 03:52:11,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471899911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:11,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:11,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:11,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244465212] [2024-10-11 03:52:11,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:11,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:11,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:11,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:11,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:11,991 INFO L87 Difference]: Start difference. First operand 1542 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) [2024-10-11 03:52:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:13,246 INFO L93 Difference]: Finished difference Result 2571 states and 3636 transitions. [2024-10-11 03:52:13,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:13,246 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 [2024-10-11 03:52:13,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:13,251 INFO L225 Difference]: With dead ends: 2571 [2024-10-11 03:52:13,251 INFO L226 Difference]: Without dead ends: 2361 [2024-10-11 03:52:13,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:52:13,252 INFO L432 NwaCegarLoop]: 834 mSDtfsCounter, 5853 mSDsluCounter, 2813 mSDsCounter, 0 mSdLazyCounter, 3049 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5853 SdHoareTripleChecker+Valid, 3647 SdHoareTripleChecker+Invalid, 3053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:13,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5853 Valid, 3647 Invalid, 3053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3049 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:52:13,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2024-10-11 03:52:13,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 1542. [2024-10-11 03:52:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.439524124256444) internal successors, (2178), 1541 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) [2024-10-11 03:52:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2178 transitions. [2024-10-11 03:52:13,268 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2178 transitions. Word has length 108 [2024-10-11 03:52:13,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:13,268 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2178 transitions. [2024-10-11 03:52:13,268 INFO L472 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) [2024-10-11 03:52:13,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2178 transitions. [2024-10-11 03:52:13,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 03:52:13,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:13,270 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:13,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:52:13,270 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:13,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:13,271 INFO L85 PathProgramCache]: Analyzing trace with hash -121651885, now seen corresponding path program 1 times [2024-10-11 03:52:13,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:13,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782291611] [2024-10-11 03:52:13,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:13,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:13,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:13,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782291611] [2024-10-11 03:52:13,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782291611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:13,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:13,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:13,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211557435] [2024-10-11 03:52:13,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:13,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:13,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:13,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:13,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:13,486 INFO L87 Difference]: Start difference. First operand 1542 states and 2178 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) [2024-10-11 03:52:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:14,772 INFO L93 Difference]: Finished difference Result 2783 states and 3948 transitions. [2024-10-11 03:52:14,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:14,772 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 [2024-10-11 03:52:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:14,776 INFO L225 Difference]: With dead ends: 2783 [2024-10-11 03:52:14,776 INFO L226 Difference]: Without dead ends: 2417 [2024-10-11 03:52:14,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:14,777 INFO L432 NwaCegarLoop]: 978 mSDtfsCounter, 5406 mSDsluCounter, 3292 mSDsCounter, 0 mSdLazyCounter, 3480 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5406 SdHoareTripleChecker+Valid, 4270 SdHoareTripleChecker+Invalid, 3484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:14,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5406 Valid, 4270 Invalid, 3484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3480 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:52:14,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2024-10-11 03:52:14,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 1542. [2024-10-11 03:52:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.4382022471910112) internal successors, (2176), 1541 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) [2024-10-11 03:52:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2176 transitions. [2024-10-11 03:52:14,792 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2176 transitions. Word has length 108 [2024-10-11 03:52:14,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:14,793 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2176 transitions. [2024-10-11 03:52:14,793 INFO L472 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) [2024-10-11 03:52:14,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2176 transitions. [2024-10-11 03:52:14,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 03:52:14,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:14,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:14,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:52:14,795 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:14,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:14,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1711979523, now seen corresponding path program 1 times [2024-10-11 03:52:14,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:14,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478369742] [2024-10-11 03:52:14,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:14,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:14,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:14,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:14,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478369742] [2024-10-11 03:52:14,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478369742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:14,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:14,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:14,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015296858] [2024-10-11 03:52:14,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:14,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:14,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:14,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:14,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:14,997 INFO L87 Difference]: Start difference. First operand 1542 states and 2176 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) [2024-10-11 03:52:16,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:16,336 INFO L93 Difference]: Finished difference Result 2643 states and 3745 transitions. [2024-10-11 03:52:16,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:16,336 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 [2024-10-11 03:52:16,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:16,340 INFO L225 Difference]: With dead ends: 2643 [2024-10-11 03:52:16,340 INFO L226 Difference]: Without dead ends: 2385 [2024-10-11 03:52:16,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:52:16,341 INFO L432 NwaCegarLoop]: 1054 mSDtfsCounter, 5069 mSDsluCounter, 3500 mSDsCounter, 0 mSdLazyCounter, 3769 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5069 SdHoareTripleChecker+Valid, 4554 SdHoareTripleChecker+Invalid, 3773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:16,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5069 Valid, 4554 Invalid, 3773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3769 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:52:16,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2024-10-11 03:52:16,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1542. [2024-10-11 03:52:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.4368803701255783) internal successors, (2174), 1541 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) [2024-10-11 03:52:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2174 transitions. [2024-10-11 03:52:16,358 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2174 transitions. Word has length 108 [2024-10-11 03:52:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:16,358 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2174 transitions. [2024-10-11 03:52:16,358 INFO L472 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) [2024-10-11 03:52:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2174 transitions. [2024-10-11 03:52:16,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 03:52:16,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:16,360 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:16,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:52:16,360 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:16,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:16,361 INFO L85 PathProgramCache]: Analyzing trace with hash -567046043, now seen corresponding path program 1 times [2024-10-11 03:52:16,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:16,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658099028] [2024-10-11 03:52:16,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:16,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:16,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:16,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:16,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658099028] [2024-10-11 03:52:16,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658099028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:16,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:16,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:16,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859403949] [2024-10-11 03:52:16,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:16,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:16,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:16,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:16,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:16,578 INFO L87 Difference]: Start difference. First operand 1542 states and 2174 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) [2024-10-11 03:52:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:17,628 INFO L93 Difference]: Finished difference Result 2280 states and 3228 transitions. [2024-10-11 03:52:17,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:52:17,629 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 [2024-10-11 03:52:17,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:17,631 INFO L225 Difference]: With dead ends: 2280 [2024-10-11 03:52:17,631 INFO L226 Difference]: Without dead ends: 1630 [2024-10-11 03:52:17,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:52:17,632 INFO L432 NwaCegarLoop]: 1103 mSDtfsCounter, 1623 mSDsluCounter, 3219 mSDsCounter, 0 mSdLazyCounter, 2990 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1623 SdHoareTripleChecker+Valid, 4322 SdHoareTripleChecker+Invalid, 2994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:17,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1623 Valid, 4322 Invalid, 2994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2990 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:52:17,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2024-10-11 03:52:17,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1542. [2024-10-11 03:52:17,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.4355584930601455) internal successors, (2172), 1541 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) [2024-10-11 03:52:17,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2172 transitions. [2024-10-11 03:52:17,646 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2172 transitions. Word has length 108 [2024-10-11 03:52:17,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:17,646 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2172 transitions. [2024-10-11 03:52:17,646 INFO L472 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) [2024-10-11 03:52:17,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2172 transitions. [2024-10-11 03:52:17,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 03:52:17,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:17,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:17,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:52:17,649 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:17,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:17,649 INFO L85 PathProgramCache]: Analyzing trace with hash -609046091, now seen corresponding path program 1 times [2024-10-11 03:52:17,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:17,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132136737] [2024-10-11 03:52:17,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:17,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:17,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:17,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132136737] [2024-10-11 03:52:17,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132136737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:17,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:17,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:17,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720116605] [2024-10-11 03:52:17,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:17,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:17,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:17,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:17,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:17,866 INFO L87 Difference]: Start difference. First operand 1542 states and 2172 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) [2024-10-11 03:52:19,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:19,231 INFO L93 Difference]: Finished difference Result 2546 states and 3595 transitions. [2024-10-11 03:52:19,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:52:19,231 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 [2024-10-11 03:52:19,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:19,234 INFO L225 Difference]: With dead ends: 2546 [2024-10-11 03:52:19,235 INFO L226 Difference]: Without dead ends: 2361 [2024-10-11 03:52:19,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:52:19,236 INFO L432 NwaCegarLoop]: 932 mSDtfsCounter, 3043 mSDsluCounter, 3772 mSDsCounter, 0 mSdLazyCounter, 3768 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3043 SdHoareTripleChecker+Valid, 4704 SdHoareTripleChecker+Invalid, 3772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:19,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3043 Valid, 4704 Invalid, 3772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3768 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 03:52:19,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2024-10-11 03:52:19,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 1542. [2024-10-11 03:52:19,248 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) [2024-10-11 03:52:19,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2171 transitions. [2024-10-11 03:52:19,250 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2171 transitions. Word has length 110 [2024-10-11 03:52:19,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:19,250 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2171 transitions. [2024-10-11 03:52:19,250 INFO L472 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) [2024-10-11 03:52:19,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2171 transitions. [2024-10-11 03:52:19,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 03:52:19,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:19,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:19,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:52:19,253 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:19,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:19,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1096308357, now seen corresponding path program 1 times [2024-10-11 03:52:19,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:19,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868400847] [2024-10-11 03:52:19,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:19,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:19,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:19,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:19,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868400847] [2024-10-11 03:52:19,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868400847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:19,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:19,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:19,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559483812] [2024-10-11 03:52:19,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:19,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:19,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:19,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:19,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:19,483 INFO L87 Difference]: Start difference. First operand 1542 states and 2171 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) [2024-10-11 03:52:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:20,793 INFO L93 Difference]: Finished difference Result 2600 states and 3674 transitions. [2024-10-11 03:52:20,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:20,794 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 [2024-10-11 03:52:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:20,797 INFO L225 Difference]: With dead ends: 2600 [2024-10-11 03:52:20,797 INFO L226 Difference]: Without dead ends: 2385 [2024-10-11 03:52:20,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:20,798 INFO L432 NwaCegarLoop]: 1047 mSDtfsCounter, 5067 mSDsluCounter, 3476 mSDsCounter, 0 mSdLazyCounter, 3760 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5067 SdHoareTripleChecker+Valid, 4523 SdHoareTripleChecker+Invalid, 3764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:20,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5067 Valid, 4523 Invalid, 3764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3760 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:52:20,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2024-10-11 03:52:20,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1542. [2024-10-11 03:52:20,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.4342366159947124) internal successors, (2170), 1541 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2170 transitions. [2024-10-11 03:52:20,812 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2170 transitions. Word has length 110 [2024-10-11 03:52:20,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:20,812 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2170 transitions. [2024-10-11 03:52:20,812 INFO L472 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) [2024-10-11 03:52:20,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2170 transitions. [2024-10-11 03:52:20,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 03:52:20,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:20,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:20,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:52:20,815 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:20,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:20,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1547475906, now seen corresponding path program 1 times [2024-10-11 03:52:20,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:20,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186340710] [2024-10-11 03:52:20,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:20,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:21,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:21,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186340710] [2024-10-11 03:52:21,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186340710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:21,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:21,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:21,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932042294] [2024-10-11 03:52:21,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:21,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:21,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:21,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:21,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:21,014 INFO L87 Difference]: Start difference. First operand 1542 states and 2170 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) [2024-10-11 03:52:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:22,216 INFO L93 Difference]: Finished difference Result 2390 states and 3324 transitions. [2024-10-11 03:52:22,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:22,216 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 [2024-10-11 03:52:22,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:22,219 INFO L225 Difference]: With dead ends: 2390 [2024-10-11 03:52:22,219 INFO L226 Difference]: Without dead ends: 2224 [2024-10-11 03:52:22,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:22,220 INFO L432 NwaCegarLoop]: 751 mSDtfsCounter, 4019 mSDsluCounter, 2362 mSDsCounter, 0 mSdLazyCounter, 2854 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4019 SdHoareTripleChecker+Valid, 3113 SdHoareTripleChecker+Invalid, 2858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:22,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4019 Valid, 3113 Invalid, 2858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2854 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:52:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2024-10-11 03:52:22,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 1542. [2024-10-11 03:52:22,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.433575677461996) internal successors, (2169), 1541 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2169 transitions. [2024-10-11 03:52:22,240 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2169 transitions. Word has length 110 [2024-10-11 03:52:22,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:22,241 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2169 transitions. [2024-10-11 03:52:22,241 INFO L472 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) [2024-10-11 03:52:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2169 transitions. [2024-10-11 03:52:22,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 03:52:22,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:22,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:22,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:52:22,243 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:22,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:22,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1100437199, now seen corresponding path program 1 times [2024-10-11 03:52:22,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:22,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253731723] [2024-10-11 03:52:22,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:22,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:22,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:22,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253731723] [2024-10-11 03:52:22,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253731723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:22,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:22,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:22,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366272984] [2024-10-11 03:52:22,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:22,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:22,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:22,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:22,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:22,504 INFO L87 Difference]: Start difference. First operand 1542 states and 2169 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) [2024-10-11 03:52:23,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:23,617 INFO L93 Difference]: Finished difference Result 2390 states and 3322 transitions. [2024-10-11 03:52:23,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:23,618 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 [2024-10-11 03:52:23,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:23,621 INFO L225 Difference]: With dead ends: 2390 [2024-10-11 03:52:23,621 INFO L226 Difference]: Without dead ends: 2224 [2024-10-11 03:52:23,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:23,622 INFO L432 NwaCegarLoop]: 802 mSDtfsCounter, 5783 mSDsluCounter, 2516 mSDsCounter, 0 mSdLazyCounter, 3042 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5783 SdHoareTripleChecker+Valid, 3318 SdHoareTripleChecker+Invalid, 3045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:23,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5783 Valid, 3318 Invalid, 3045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3042 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:52:23,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2024-10-11 03:52:23,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 1542. [2024-10-11 03:52:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.4329147389292796) internal successors, (2168), 1541 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2168 transitions. [2024-10-11 03:52:23,638 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2168 transitions. Word has length 110 [2024-10-11 03:52:23,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:23,639 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2168 transitions. [2024-10-11 03:52:23,639 INFO L472 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) [2024-10-11 03:52:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2168 transitions. [2024-10-11 03:52:23,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 03:52:23,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:23,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:23,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:52:23,641 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:23,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:23,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1163434676, now seen corresponding path program 1 times [2024-10-11 03:52:23,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:23,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819725563] [2024-10-11 03:52:23,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:23,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:23,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:23,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819725563] [2024-10-11 03:52:23,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819725563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:23,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:23,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:23,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113570670] [2024-10-11 03:52:23,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:23,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:23,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:23,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:23,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:23,834 INFO L87 Difference]: Start difference. First operand 1542 states and 2168 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) [2024-10-11 03:52:24,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:24,889 INFO L93 Difference]: Finished difference Result 2392 states and 3322 transitions. [2024-10-11 03:52:24,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:24,890 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 [2024-10-11 03:52:24,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:24,893 INFO L225 Difference]: With dead ends: 2392 [2024-10-11 03:52:24,893 INFO L226 Difference]: Without dead ends: 2224 [2024-10-11 03:52:24,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:24,894 INFO L432 NwaCegarLoop]: 749 mSDtfsCounter, 5989 mSDsluCounter, 2357 mSDsCounter, 0 mSdLazyCounter, 2844 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5989 SdHoareTripleChecker+Valid, 3106 SdHoareTripleChecker+Invalid, 2848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:24,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5989 Valid, 3106 Invalid, 2848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2844 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:52:24,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2024-10-11 03:52:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 1542. [2024-10-11 03:52:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.432253800396563) internal successors, (2167), 1541 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:24,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2167 transitions. [2024-10-11 03:52:24,907 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2167 transitions. Word has length 110 [2024-10-11 03:52:24,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:24,907 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2167 transitions. [2024-10-11 03:52:24,907 INFO L472 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) [2024-10-11 03:52:24,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2167 transitions. [2024-10-11 03:52:24,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 03:52:24,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:24,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:24,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:52:24,909 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:24,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:24,910 INFO L85 PathProgramCache]: Analyzing trace with hash 707210619, now seen corresponding path program 1 times [2024-10-11 03:52:24,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:24,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312759765] [2024-10-11 03:52:24,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:24,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:25,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:25,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:25,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312759765] [2024-10-11 03:52:25,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312759765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:25,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:25,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:25,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828777080] [2024-10-11 03:52:25,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:25,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:25,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:25,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:25,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:25,160 INFO L87 Difference]: Start difference. First operand 1542 states and 2167 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) [2024-10-11 03:52:26,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:26,632 INFO L93 Difference]: Finished difference Result 2592 states and 3660 transitions. [2024-10-11 03:52:26,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:52:26,633 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 [2024-10-11 03:52:26,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:26,636 INFO L225 Difference]: With dead ends: 2592 [2024-10-11 03:52:26,636 INFO L226 Difference]: Without dead ends: 2385 [2024-10-11 03:52:26,636 INFO L431 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 [2024-10-11 03:52:26,637 INFO L432 NwaCegarLoop]: 1358 mSDtfsCounter, 4417 mSDsluCounter, 4548 mSDsCounter, 0 mSdLazyCounter, 4347 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4417 SdHoareTripleChecker+Valid, 5906 SdHoareTripleChecker+Invalid, 4350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:26,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4417 Valid, 5906 Invalid, 4350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4347 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 03:52:26,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2024-10-11 03:52:26,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1542. [2024-10-11 03:52:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.4315928618638467) internal successors, (2166), 1541 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:26,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2166 transitions. [2024-10-11 03:52:26,651 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2166 transitions. Word has length 110 [2024-10-11 03:52:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:26,651 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2166 transitions. [2024-10-11 03:52:26,651 INFO L472 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) [2024-10-11 03:52:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2166 transitions. [2024-10-11 03:52:26,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 03:52:26,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:26,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:26,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:52:26,653 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:26,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:26,654 INFO L85 PathProgramCache]: Analyzing trace with hash -583741300, now seen corresponding path program 1 times [2024-10-11 03:52:26,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:26,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059703339] [2024-10-11 03:52:26,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:26,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:26,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:26,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:26,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059703339] [2024-10-11 03:52:26,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059703339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:26,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:26,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:26,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586282640] [2024-10-11 03:52:26,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:26,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:26,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:26,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:26,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:26,858 INFO L87 Difference]: Start difference. First operand 1542 states and 2166 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) [2024-10-11 03:52:28,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:28,222 INFO L93 Difference]: Finished difference Result 2552 states and 3593 transitions. [2024-10-11 03:52:28,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:52:28,222 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 [2024-10-11 03:52:28,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:28,225 INFO L225 Difference]: With dead ends: 2552 [2024-10-11 03:52:28,225 INFO L226 Difference]: Without dead ends: 2361 [2024-10-11 03:52:28,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:52:28,226 INFO L432 NwaCegarLoop]: 1055 mSDtfsCounter, 3026 mSDsluCounter, 3973 mSDsCounter, 0 mSdLazyCounter, 3922 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3026 SdHoareTripleChecker+Valid, 5028 SdHoareTripleChecker+Invalid, 3926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:28,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3026 Valid, 5028 Invalid, 3926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3922 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 03:52:28,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2024-10-11 03:52:28,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 1542. [2024-10-11 03:52:28,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.4309319233311302) internal successors, (2165), 1541 states have internal predecessors, (2165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2165 transitions. [2024-10-11 03:52:28,240 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2165 transitions. Word has length 110 [2024-10-11 03:52:28,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:28,241 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2165 transitions. [2024-10-11 03:52:28,241 INFO L472 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) [2024-10-11 03:52:28,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2165 transitions. [2024-10-11 03:52:28,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 03:52:28,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:28,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:28,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:52:28,244 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:28,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:28,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1881631338, now seen corresponding path program 1 times [2024-10-11 03:52:28,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:28,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475268519] [2024-10-11 03:52:28,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:28,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:28,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:28,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475268519] [2024-10-11 03:52:28,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475268519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:28,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:28,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:52:28,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375600865] [2024-10-11 03:52:28,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:28,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:52:28,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:28,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:52:28,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:52:28,689 INFO L87 Difference]: Start difference. First operand 1542 states and 2165 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) [2024-10-11 03:52:30,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:30,551 INFO L93 Difference]: Finished difference Result 3255 states and 4634 transitions. [2024-10-11 03:52:30,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:52:30,551 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 [2024-10-11 03:52:30,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:30,554 INFO L225 Difference]: With dead ends: 3255 [2024-10-11 03:52:30,554 INFO L226 Difference]: Without dead ends: 3025 [2024-10-11 03:52:30,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:52:30,556 INFO L432 NwaCegarLoop]: 1032 mSDtfsCounter, 9824 mSDsluCounter, 3778 mSDsCounter, 0 mSdLazyCounter, 3998 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9824 SdHoareTripleChecker+Valid, 4810 SdHoareTripleChecker+Invalid, 4325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 3998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:30,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9824 Valid, 4810 Invalid, 4325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 3998 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 03:52:30,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3025 states. [2024-10-11 03:52:30,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3025 to 1546. [2024-10-11 03:52:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4297956493078445) internal successors, (2169), 1545 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:30,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2169 transitions. [2024-10-11 03:52:30,571 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2169 transitions. Word has length 110 [2024-10-11 03:52:30,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:30,571 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2169 transitions. [2024-10-11 03:52:30,571 INFO L472 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) [2024-10-11 03:52:30,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2169 transitions. [2024-10-11 03:52:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 03:52:30,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:30,573 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:30,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 03:52:30,573 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:30,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash 656800929, now seen corresponding path program 1 times [2024-10-11 03:52:30,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:30,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563527163] [2024-10-11 03:52:30,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:30,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:30,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:30,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563527163] [2024-10-11 03:52:30,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563527163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:30,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:30,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:30,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684896037] [2024-10-11 03:52:30,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:30,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:30,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:30,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:30,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:30,825 INFO L87 Difference]: Start difference. First operand 1546 states and 2169 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) [2024-10-11 03:52:32,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:32,364 INFO L93 Difference]: Finished difference Result 2550 states and 3590 transitions. [2024-10-11 03:52:32,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:52:32,365 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 [2024-10-11 03:52:32,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:32,366 INFO L225 Difference]: With dead ends: 2550 [2024-10-11 03:52:32,366 INFO L226 Difference]: Without dead ends: 2365 [2024-10-11 03:52:32,367 INFO L431 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 [2024-10-11 03:52:32,367 INFO L432 NwaCegarLoop]: 1147 mSDtfsCounter, 4454 mSDsluCounter, 4119 mSDsCounter, 0 mSdLazyCounter, 4057 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4454 SdHoareTripleChecker+Valid, 5266 SdHoareTripleChecker+Invalid, 4060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:32,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4454 Valid, 5266 Invalid, 4060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4057 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 03:52:32,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2024-10-11 03:52:32,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 1546. [2024-10-11 03:52:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4291364535266975) internal successors, (2168), 1545 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:32,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2168 transitions. [2024-10-11 03:52:32,380 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2168 transitions. Word has length 110 [2024-10-11 03:52:32,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:32,380 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2168 transitions. [2024-10-11 03:52:32,380 INFO L472 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) [2024-10-11 03:52:32,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2168 transitions. [2024-10-11 03:52:32,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 03:52:32,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:32,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:32,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 03:52:32,382 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:32,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:32,383 INFO L85 PathProgramCache]: Analyzing trace with hash -959118563, now seen corresponding path program 1 times [2024-10-11 03:52:32,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:32,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173225448] [2024-10-11 03:52:32,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:32,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:32,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:32,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173225448] [2024-10-11 03:52:32,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173225448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:32,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:32,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:32,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231677802] [2024-10-11 03:52:32,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:32,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:32,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:32,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:32,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:32,610 INFO L87 Difference]: Start difference. First operand 1546 states and 2168 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) [2024-10-11 03:52:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:33,771 INFO L93 Difference]: Finished difference Result 2556 states and 3595 transitions. [2024-10-11 03:52:33,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:33,771 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 [2024-10-11 03:52:33,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:33,773 INFO L225 Difference]: With dead ends: 2556 [2024-10-11 03:52:33,773 INFO L226 Difference]: Without dead ends: 2365 [2024-10-11 03:52:33,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:52:33,774 INFO L432 NwaCegarLoop]: 1049 mSDtfsCounter, 4402 mSDsluCounter, 3112 mSDsCounter, 0 mSdLazyCounter, 3263 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4402 SdHoareTripleChecker+Valid, 4161 SdHoareTripleChecker+Invalid, 3267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:33,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4402 Valid, 4161 Invalid, 3267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3263 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:52:33,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2024-10-11 03:52:33,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 1546. [2024-10-11 03:52:33,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4284772577455505) internal successors, (2167), 1545 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:33,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2167 transitions. [2024-10-11 03:52:33,787 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2167 transitions. Word has length 110 [2024-10-11 03:52:33,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:33,787 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2167 transitions. [2024-10-11 03:52:33,787 INFO L472 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) [2024-10-11 03:52:33,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2167 transitions. [2024-10-11 03:52:33,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 03:52:33,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:33,789 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:33,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 03:52:33,789 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:33,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:33,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1204907087, now seen corresponding path program 1 times [2024-10-11 03:52:33,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:33,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78244207] [2024-10-11 03:52:33,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:33,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:33,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:33,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78244207] [2024-10-11 03:52:33,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78244207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:33,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:33,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:33,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817558383] [2024-10-11 03:52:33,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:33,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:33,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:33,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:33,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:33,982 INFO L87 Difference]: Start difference. First operand 1546 states and 2167 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) [2024-10-11 03:52:35,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:35,063 INFO L93 Difference]: Finished difference Result 2233 states and 3072 transitions. [2024-10-11 03:52:35,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:35,063 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 [2024-10-11 03:52:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:35,066 INFO L225 Difference]: With dead ends: 2233 [2024-10-11 03:52:35,066 INFO L226 Difference]: Without dead ends: 2228 [2024-10-11 03:52:35,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:35,067 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 5968 mSDsluCounter, 2366 mSDsCounter, 0 mSdLazyCounter, 2818 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5968 SdHoareTripleChecker+Valid, 3118 SdHoareTripleChecker+Invalid, 2822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:35,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5968 Valid, 3118 Invalid, 2822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2818 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:52:35,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2024-10-11 03:52:35,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 1546. [2024-10-11 03:52:35,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4271588661832564) internal successors, (2165), 1545 states have internal predecessors, (2165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:35,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2165 transitions. [2024-10-11 03:52:35,080 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2165 transitions. Word has length 110 [2024-10-11 03:52:35,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:35,080 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2165 transitions. [2024-10-11 03:52:35,080 INFO L472 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) [2024-10-11 03:52:35,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2165 transitions. [2024-10-11 03:52:35,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 03:52:35,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:35,082 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:35,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 03:52:35,082 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:35,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:35,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1613752315, now seen corresponding path program 1 times [2024-10-11 03:52:35,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:35,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311705687] [2024-10-11 03:52:35,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:35,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:35,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:35,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311705687] [2024-10-11 03:52:35,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311705687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:35,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:35,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:35,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663442938] [2024-10-11 03:52:35,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:35,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:35,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:35,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:35,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:35,306 INFO L87 Difference]: Start difference. First operand 1546 states and 2165 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) [2024-10-11 03:52:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:36,522 INFO L93 Difference]: Finished difference Result 2575 states and 3611 transitions. [2024-10-11 03:52:36,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:36,522 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 [2024-10-11 03:52:36,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:36,524 INFO L225 Difference]: With dead ends: 2575 [2024-10-11 03:52:36,524 INFO L226 Difference]: Without dead ends: 2365 [2024-10-11 03:52:36,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:36,525 INFO L432 NwaCegarLoop]: 936 mSDtfsCounter, 3499 mSDsluCounter, 3116 mSDsCounter, 0 mSdLazyCounter, 3365 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3499 SdHoareTripleChecker+Valid, 4052 SdHoareTripleChecker+Invalid, 3369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:36,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3499 Valid, 4052 Invalid, 3369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3365 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:52:36,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2024-10-11 03:52:36,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 1546. [2024-10-11 03:52:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4258404746209625) internal successors, (2163), 1545 states have internal predecessors, (2163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:36,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2163 transitions. [2024-10-11 03:52:36,539 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2163 transitions. Word has length 110 [2024-10-11 03:52:36,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:36,539 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2163 transitions. [2024-10-11 03:52:36,539 INFO L472 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) [2024-10-11 03:52:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2163 transitions. [2024-10-11 03:52:36,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 03:52:36,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:36,541 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:36,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 03:52:36,541 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:36,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:36,541 INFO L85 PathProgramCache]: Analyzing trace with hash -550740200, now seen corresponding path program 1 times [2024-10-11 03:52:36,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:36,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285842345] [2024-10-11 03:52:36,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:36,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:36,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:36,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:36,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285842345] [2024-10-11 03:52:36,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285842345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:36,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:36,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:36,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573728854] [2024-10-11 03:52:36,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:36,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:36,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:36,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:36,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:36,759 INFO L87 Difference]: Start difference. First operand 1546 states and 2163 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) [2024-10-11 03:52:38,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:38,128 INFO L93 Difference]: Finished difference Result 2569 states and 3607 transitions. [2024-10-11 03:52:38,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:52:38,128 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 [2024-10-11 03:52:38,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:38,131 INFO L225 Difference]: With dead ends: 2569 [2024-10-11 03:52:38,131 INFO L226 Difference]: Without dead ends: 2365 [2024-10-11 03:52:38,132 INFO L431 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 [2024-10-11 03:52:38,132 INFO L432 NwaCegarLoop]: 1057 mSDtfsCounter, 4443 mSDsluCounter, 3980 mSDsCounter, 0 mSdLazyCounter, 3896 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4443 SdHoareTripleChecker+Valid, 5037 SdHoareTripleChecker+Invalid, 3900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:38,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4443 Valid, 5037 Invalid, 3900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3896 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 03:52:38,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2024-10-11 03:52:38,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 1546. [2024-10-11 03:52:38,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4245220830586685) internal successors, (2161), 1545 states have internal predecessors, (2161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:38,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2161 transitions. [2024-10-11 03:52:38,144 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2161 transitions. Word has length 110 [2024-10-11 03:52:38,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:38,145 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2161 transitions. [2024-10-11 03:52:38,145 INFO L472 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) [2024-10-11 03:52:38,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2161 transitions. [2024-10-11 03:52:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 03:52:38,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:38,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:38,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 03:52:38,147 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:38,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:38,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2127419862, now seen corresponding path program 1 times [2024-10-11 03:52:38,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:38,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131650395] [2024-10-11 03:52:38,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:38,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:38,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:38,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131650395] [2024-10-11 03:52:38,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131650395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:38,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:38,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:38,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245825461] [2024-10-11 03:52:38,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:38,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:38,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:38,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:38,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:38,326 INFO L87 Difference]: Start difference. First operand 1546 states and 2161 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) [2024-10-11 03:52:39,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:39,545 INFO L93 Difference]: Finished difference Result 2575 states and 3610 transitions. [2024-10-11 03:52:39,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:39,545 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 [2024-10-11 03:52:39,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:39,548 INFO L225 Difference]: With dead ends: 2575 [2024-10-11 03:52:39,548 INFO L226 Difference]: Without dead ends: 2365 [2024-10-11 03:52:39,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:39,549 INFO L432 NwaCegarLoop]: 937 mSDtfsCounter, 3489 mSDsluCounter, 3119 mSDsCounter, 0 mSdLazyCounter, 3361 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3489 SdHoareTripleChecker+Valid, 4056 SdHoareTripleChecker+Invalid, 3365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:39,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3489 Valid, 4056 Invalid, 3365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3361 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:52:39,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2024-10-11 03:52:39,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 1546. [2024-10-11 03:52:39,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4232036914963744) internal successors, (2159), 1545 states have internal predecessors, (2159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2159 transitions. [2024-10-11 03:52:39,562 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2159 transitions. Word has length 110 [2024-10-11 03:52:39,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:39,563 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2159 transitions. [2024-10-11 03:52:39,563 INFO L472 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) [2024-10-11 03:52:39,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2159 transitions. [2024-10-11 03:52:39,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 03:52:39,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:39,565 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:39,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 03:52:39,565 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:39,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:39,565 INFO L85 PathProgramCache]: Analyzing trace with hash 915039500, now seen corresponding path program 1 times [2024-10-11 03:52:39,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:39,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290603314] [2024-10-11 03:52:39,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:39,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:39,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:39,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:39,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290603314] [2024-10-11 03:52:39,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290603314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:39,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:39,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:39,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550955501] [2024-10-11 03:52:39,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:39,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:39,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:39,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:39,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:39,740 INFO L87 Difference]: Start difference. First operand 1546 states and 2159 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) [2024-10-11 03:52:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:40,914 INFO L93 Difference]: Finished difference Result 2505 states and 3498 transitions. [2024-10-11 03:52:40,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:40,915 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 [2024-10-11 03:52:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:40,917 INFO L225 Difference]: With dead ends: 2505 [2024-10-11 03:52:40,917 INFO L226 Difference]: Without dead ends: 2317 [2024-10-11 03:52:40,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:40,918 INFO L432 NwaCegarLoop]: 936 mSDtfsCounter, 5335 mSDsluCounter, 3053 mSDsCounter, 0 mSdLazyCounter, 3370 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5335 SdHoareTripleChecker+Valid, 3989 SdHoareTripleChecker+Invalid, 3374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:40,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5335 Valid, 3989 Invalid, 3374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3370 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:52:40,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2024-10-11 03:52:40,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 1546. [2024-10-11 03:52:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4218852999340805) internal successors, (2157), 1545 states have internal predecessors, (2157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2157 transitions. [2024-10-11 03:52:40,931 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2157 transitions. Word has length 110 [2024-10-11 03:52:40,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:40,932 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2157 transitions. [2024-10-11 03:52:40,932 INFO L472 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) [2024-10-11 03:52:40,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2157 transitions. [2024-10-11 03:52:40,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 03:52:40,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:40,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:40,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 03:52:40,933 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:40,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:40,934 INFO L85 PathProgramCache]: Analyzing trace with hash -382850538, now seen corresponding path program 1 times [2024-10-11 03:52:40,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:40,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438488027] [2024-10-11 03:52:40,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:40,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:41,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:41,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438488027] [2024-10-11 03:52:41,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438488027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:41,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:41,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:41,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849853867] [2024-10-11 03:52:41,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:41,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:41,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:41,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:41,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:41,162 INFO L87 Difference]: Start difference. First operand 1546 states and 2157 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) [2024-10-11 03:52:42,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:42,589 INFO L93 Difference]: Finished difference Result 2665 states and 3739 transitions. [2024-10-11 03:52:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:52:42,590 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 [2024-10-11 03:52:42,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:42,593 INFO L225 Difference]: With dead ends: 2665 [2024-10-11 03:52:42,593 INFO L226 Difference]: Without dead ends: 2385 [2024-10-11 03:52:42,594 INFO L431 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 [2024-10-11 03:52:42,594 INFO L432 NwaCegarLoop]: 1181 mSDtfsCounter, 4389 mSDsluCounter, 4262 mSDsCounter, 0 mSdLazyCounter, 4049 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4389 SdHoareTripleChecker+Valid, 5443 SdHoareTripleChecker+Invalid, 4053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:42,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4389 Valid, 5443 Invalid, 4053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4049 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 03:52:42,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2024-10-11 03:52:42,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1546. [2024-10-11 03:52:42,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4205669083717865) internal successors, (2155), 1545 states have internal predecessors, (2155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2155 transitions. [2024-10-11 03:52:42,607 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2155 transitions. Word has length 110 [2024-10-11 03:52:42,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:42,607 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2155 transitions. [2024-10-11 03:52:42,607 INFO L472 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) [2024-10-11 03:52:42,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2155 transitions. [2024-10-11 03:52:42,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 03:52:42,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:42,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:42,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 03:52:42,609 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:42,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:42,610 INFO L85 PathProgramCache]: Analyzing trace with hash -715976179, now seen corresponding path program 1 times [2024-10-11 03:52:42,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:42,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070712371] [2024-10-11 03:52:42,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:42,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:42,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:42,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070712371] [2024-10-11 03:52:42,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070712371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:42,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:42,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:42,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839553804] [2024-10-11 03:52:42,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:42,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:42,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:42,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:42,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:42,828 INFO L87 Difference]: Start difference. First operand 1546 states and 2155 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) [2024-10-11 03:52:44,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:44,197 INFO L93 Difference]: Finished difference Result 2845 states and 3988 transitions. [2024-10-11 03:52:44,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:44,197 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 [2024-10-11 03:52:44,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:44,199 INFO L225 Difference]: With dead ends: 2845 [2024-10-11 03:52:44,199 INFO L226 Difference]: Without dead ends: 2425 [2024-10-11 03:52:44,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:44,201 INFO L432 NwaCegarLoop]: 1231 mSDtfsCounter, 2972 mSDsluCounter, 4046 mSDsCounter, 0 mSdLazyCounter, 4179 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2972 SdHoareTripleChecker+Valid, 5277 SdHoareTripleChecker+Invalid, 4182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:44,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2972 Valid, 5277 Invalid, 4182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4179 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:52:44,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2024-10-11 03:52:44,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 1546. [2024-10-11 03:52:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4192485168094924) internal successors, (2153), 1545 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:44,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2153 transitions. [2024-10-11 03:52:44,214 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2153 transitions. Word has length 110 [2024-10-11 03:52:44,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:44,214 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2153 transitions. [2024-10-11 03:52:44,215 INFO L472 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) [2024-10-11 03:52:44,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2153 transitions. [2024-10-11 03:52:44,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 03:52:44,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:44,216 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:44,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 03:52:44,216 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:44,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:44,217 INFO L85 PathProgramCache]: Analyzing trace with hash 78610759, now seen corresponding path program 1 times [2024-10-11 03:52:44,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:44,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140304532] [2024-10-11 03:52:44,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:44,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:44,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:44,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140304532] [2024-10-11 03:52:44,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140304532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:44,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:44,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:44,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154150912] [2024-10-11 03:52:44,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:44,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:44,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:44,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:44,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:44,407 INFO L87 Difference]: Start difference. First operand 1546 states and 2153 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:45,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:45,789 INFO L93 Difference]: Finished difference Result 2615 states and 3661 transitions. [2024-10-11 03:52:45,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:45,790 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-11 03:52:45,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:45,792 INFO L225 Difference]: With dead ends: 2615 [2024-10-11 03:52:45,792 INFO L226 Difference]: Without dead ends: 2385 [2024-10-11 03:52:45,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:45,793 INFO L432 NwaCegarLoop]: 1224 mSDtfsCounter, 2971 mSDsluCounter, 4005 mSDsCounter, 0 mSdLazyCounter, 4173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2971 SdHoareTripleChecker+Valid, 5229 SdHoareTripleChecker+Invalid, 4176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:45,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2971 Valid, 5229 Invalid, 4176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4173 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 03:52:45,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2024-10-11 03:52:45,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1542. [2024-10-11 03:52:45,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.4196959682749504) internal successors, (2148), 1541 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2148 transitions. [2024-10-11 03:52:45,804 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2148 transitions. Word has length 111 [2024-10-11 03:52:45,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:45,804 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2148 transitions. [2024-10-11 03:52:45,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2148 transitions. [2024-10-11 03:52:45,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 03:52:45,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:45,805 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:45,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 03:52:45,806 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:45,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:45,806 INFO L85 PathProgramCache]: Analyzing trace with hash 294585012, now seen corresponding path program 1 times [2024-10-11 03:52:45,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:45,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380592329] [2024-10-11 03:52:45,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:45,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:46,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:46,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380592329] [2024-10-11 03:52:46,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380592329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:46,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:46,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:52:46,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900338848] [2024-10-11 03:52:46,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:46,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:52:46,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:46,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:52:46,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:52:46,160 INFO L87 Difference]: Start difference. First operand 1542 states and 2148 transitions. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:47,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:47,932 INFO L93 Difference]: Finished difference Result 2971 states and 4182 transitions. [2024-10-11 03:52:47,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:52:47,932 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-11 03:52:47,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:47,935 INFO L225 Difference]: With dead ends: 2971 [2024-10-11 03:52:47,935 INFO L226 Difference]: Without dead ends: 2793 [2024-10-11 03:52:47,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:52:47,936 INFO L432 NwaCegarLoop]: 931 mSDtfsCounter, 9958 mSDsluCounter, 3310 mSDsCounter, 0 mSdLazyCounter, 3615 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9958 SdHoareTripleChecker+Valid, 4241 SdHoareTripleChecker+Invalid, 3958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 3615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:47,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9958 Valid, 4241 Invalid, 3958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 3615 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 03:52:47,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2024-10-11 03:52:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 1546. [2024-10-11 03:52:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4185893210283453) internal successors, (2152), 1545 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:47,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2152 transitions. [2024-10-11 03:52:47,953 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2152 transitions. Word has length 112 [2024-10-11 03:52:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:47,953 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2152 transitions. [2024-10-11 03:52:47,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:47,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2152 transitions. [2024-10-11 03:52:47,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 03:52:47,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:47,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:47,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 03:52:47,956 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:47,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:47,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1558151312, now seen corresponding path program 1 times [2024-10-11 03:52:47,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:47,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930237871] [2024-10-11 03:52:47,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:47,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:48,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:48,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:48,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930237871] [2024-10-11 03:52:48,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930237871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:48,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:48,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:48,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173641742] [2024-10-11 03:52:48,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:48,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:48,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:48,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:48,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:48,149 INFO L87 Difference]: Start difference. First operand 1546 states and 2152 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:49,325 INFO L93 Difference]: Finished difference Result 2487 states and 3466 transitions. [2024-10-11 03:52:49,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:49,325 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-11 03:52:49,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:49,327 INFO L225 Difference]: With dead ends: 2487 [2024-10-11 03:52:49,327 INFO L226 Difference]: Without dead ends: 2313 [2024-10-11 03:52:49,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:52:49,328 INFO L432 NwaCegarLoop]: 979 mSDtfsCounter, 3428 mSDsluCounter, 3183 mSDsCounter, 0 mSdLazyCounter, 3514 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3428 SdHoareTripleChecker+Valid, 4162 SdHoareTripleChecker+Invalid, 3517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:49,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3428 Valid, 4162 Invalid, 3517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3514 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:52:49,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2024-10-11 03:52:49,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 1546. [2024-10-11 03:52:49,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4179301252471985) internal successors, (2151), 1545 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:49,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2151 transitions. [2024-10-11 03:52:49,340 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2151 transitions. Word has length 112 [2024-10-11 03:52:49,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:49,340 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2151 transitions. [2024-10-11 03:52:49,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2151 transitions. [2024-10-11 03:52:49,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 03:52:49,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:49,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:49,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-11 03:52:49,342 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:49,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:49,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1896693420, now seen corresponding path program 1 times [2024-10-11 03:52:49,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:49,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664183027] [2024-10-11 03:52:49,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:49,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:49,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:49,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:49,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664183027] [2024-10-11 03:52:49,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664183027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:49,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:49,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:52:49,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234183911] [2024-10-11 03:52:49,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:49,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:52:49,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:49,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:52:49,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:52:49,685 INFO L87 Difference]: Start difference. First operand 1546 states and 2151 transitions. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:51,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:51,601 INFO L93 Difference]: Finished difference Result 2967 states and 4177 transitions. [2024-10-11 03:52:51,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:52:51,602 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-11 03:52:51,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:51,604 INFO L225 Difference]: With dead ends: 2967 [2024-10-11 03:52:51,605 INFO L226 Difference]: Without dead ends: 2793 [2024-10-11 03:52:51,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:52:51,606 INFO L432 NwaCegarLoop]: 926 mSDtfsCounter, 9936 mSDsluCounter, 4179 mSDsCounter, 0 mSdLazyCounter, 4381 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9936 SdHoareTripleChecker+Valid, 5105 SdHoareTripleChecker+Invalid, 4726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 4381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:51,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9936 Valid, 5105 Invalid, 4726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 4381 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 03:52:51,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2024-10-11 03:52:51,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 1550. [2024-10-11 03:52:51,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.4168310322156477) internal successors, (2155), 1549 states have internal predecessors, (2155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2155 transitions. [2024-10-11 03:52:51,618 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2155 transitions. Word has length 112 [2024-10-11 03:52:51,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:51,618 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2155 transitions. [2024-10-11 03:52:51,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:51,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2155 transitions. [2024-10-11 03:52:51,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 03:52:51,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:51,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:51,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-11 03:52:51,620 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:51,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:51,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1908379433, now seen corresponding path program 1 times [2024-10-11 03:52:51,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:51,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337124814] [2024-10-11 03:52:51,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:51,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:51,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:51,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:51,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337124814] [2024-10-11 03:52:51,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337124814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:51,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:51,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:51,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383334051] [2024-10-11 03:52:51,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:51,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:51,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:51,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:51,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:51,791 INFO L87 Difference]: Start difference. First operand 1550 states and 2155 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:52,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:52,963 INFO L93 Difference]: Finished difference Result 2485 states and 3462 transitions. [2024-10-11 03:52:52,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:52,963 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-11 03:52:52,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:52,966 INFO L225 Difference]: With dead ends: 2485 [2024-10-11 03:52:52,966 INFO L226 Difference]: Without dead ends: 2313 [2024-10-11 03:52:52,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:52:52,967 INFO L432 NwaCegarLoop]: 923 mSDtfsCounter, 3536 mSDsluCounter, 3017 mSDsCounter, 0 mSdLazyCounter, 3292 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3536 SdHoareTripleChecker+Valid, 3940 SdHoareTripleChecker+Invalid, 3296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:52,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3536 Valid, 3940 Invalid, 3296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3292 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:52:52,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2024-10-11 03:52:52,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 1550. [2024-10-11 03:52:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.4161735700197238) internal successors, (2154), 1549 states have internal predecessors, (2154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:52,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2154 transitions. [2024-10-11 03:52:52,978 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2154 transitions. Word has length 112 [2024-10-11 03:52:52,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:52,978 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2154 transitions. [2024-10-11 03:52:52,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:52,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2154 transitions. [2024-10-11 03:52:52,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 03:52:52,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:52,980 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:52,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-11 03:52:52,980 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:52,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:52,980 INFO L85 PathProgramCache]: Analyzing trace with hash 606419033, now seen corresponding path program 1 times [2024-10-11 03:52:52,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:52,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137188673] [2024-10-11 03:52:52,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:52,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:53,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:53,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137188673] [2024-10-11 03:52:53,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137188673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:53,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:53,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:53,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668053775] [2024-10-11 03:52:53,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:53,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:53,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:53,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:53,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:53,181 INFO L87 Difference]: Start difference. First operand 1550 states and 2154 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:54,218 INFO L93 Difference]: Finished difference Result 2398 states and 3303 transitions. [2024-10-11 03:52:54,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:54,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-11 03:52:54,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:54,220 INFO L225 Difference]: With dead ends: 2398 [2024-10-11 03:52:54,220 INFO L226 Difference]: Without dead ends: 2232 [2024-10-11 03:52:54,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:52:54,221 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 3929 mSDsluCounter, 2423 mSDsCounter, 0 mSdLazyCounter, 2849 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3929 SdHoareTripleChecker+Valid, 3193 SdHoareTripleChecker+Invalid, 2853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:54,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3929 Valid, 3193 Invalid, 2853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2849 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:52:54,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2024-10-11 03:52:54,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 1550. [2024-10-11 03:52:54,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.4155161078238) internal successors, (2153), 1549 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:54,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2153 transitions. [2024-10-11 03:52:54,233 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2153 transitions. Word has length 112 [2024-10-11 03:52:54,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:54,233 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2153 transitions. [2024-10-11 03:52:54,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:54,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2153 transitions. [2024-10-11 03:52:54,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 03:52:54,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:54,235 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:54,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-11 03:52:54,235 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:54,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:54,235 INFO L85 PathProgramCache]: Analyzing trace with hash 497794837, now seen corresponding path program 1 times [2024-10-11 03:52:54,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:54,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672191825] [2024-10-11 03:52:54,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:54,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:54,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:54,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672191825] [2024-10-11 03:52:54,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672191825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:54,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:54,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:54,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225472432] [2024-10-11 03:52:54,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:54,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:54,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:54,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:54,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:54,443 INFO L87 Difference]: Start difference. First operand 1550 states and 2153 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:55,679 INFO L93 Difference]: Finished difference Result 2491 states and 3465 transitions. [2024-10-11 03:52:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:55,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-11 03:52:55,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:55,682 INFO L225 Difference]: With dead ends: 2491 [2024-10-11 03:52:55,682 INFO L226 Difference]: Without dead ends: 2313 [2024-10-11 03:52:55,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:55,683 INFO L432 NwaCegarLoop]: 923 mSDtfsCounter, 5358 mSDsluCounter, 3017 mSDsCounter, 0 mSdLazyCounter, 3283 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5358 SdHoareTripleChecker+Valid, 3940 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:55,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5358 Valid, 3940 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3283 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:52:55,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2024-10-11 03:52:55,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 1550. [2024-10-11 03:52:55,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.4148586456278764) internal successors, (2152), 1549 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:55,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2152 transitions. [2024-10-11 03:52:55,695 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2152 transitions. Word has length 112 [2024-10-11 03:52:55,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:55,695 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2152 transitions. [2024-10-11 03:52:55,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:55,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2152 transitions. [2024-10-11 03:52:55,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 03:52:55,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:55,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:55,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-11 03:52:55,697 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:55,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:55,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1476130129, now seen corresponding path program 1 times [2024-10-11 03:52:55,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:55,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289964452] [2024-10-11 03:52:55,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:55,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:55,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:55,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:55,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289964452] [2024-10-11 03:52:55,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289964452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:55,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:55,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:55,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532304433] [2024-10-11 03:52:55,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:55,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:55,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:55,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:55,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:55,895 INFO L87 Difference]: Start difference. First operand 1550 states and 2152 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:57,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:57,096 INFO L93 Difference]: Finished difference Result 2573 states and 3581 transitions. [2024-10-11 03:52:57,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:57,096 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-11 03:52:57,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:57,098 INFO L225 Difference]: With dead ends: 2573 [2024-10-11 03:52:57,098 INFO L226 Difference]: Without dead ends: 2373 [2024-10-11 03:52:57,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:52:57,099 INFO L432 NwaCegarLoop]: 1208 mSDtfsCounter, 4357 mSDsluCounter, 3406 mSDsCounter, 0 mSdLazyCounter, 3404 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4357 SdHoareTripleChecker+Valid, 4614 SdHoareTripleChecker+Invalid, 3408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:57,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4357 Valid, 4614 Invalid, 3408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3404 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:52:57,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2024-10-11 03:52:57,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 1550. [2024-10-11 03:52:57,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.4142011834319526) internal successors, (2151), 1549 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:57,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2151 transitions. [2024-10-11 03:52:57,111 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2151 transitions. Word has length 112 [2024-10-11 03:52:57,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:57,112 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2151 transitions. [2024-10-11 03:52:57,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2151 transitions. [2024-10-11 03:52:57,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 03:52:57,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:57,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:57,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-11 03:52:57,114 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:57,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:57,114 INFO L85 PathProgramCache]: Analyzing trace with hash 865897012, now seen corresponding path program 1 times [2024-10-11 03:52:57,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:57,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702102632] [2024-10-11 03:52:57,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:57,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:57,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:57,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702102632] [2024-10-11 03:52:57,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702102632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:57,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:57,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:57,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291190762] [2024-10-11 03:52:57,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:57,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:57,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:57,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:57,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:57,296 INFO L87 Difference]: Start difference. First operand 1550 states and 2151 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:58,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:58,442 INFO L93 Difference]: Finished difference Result 2491 states and 3463 transitions. [2024-10-11 03:52:58,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:58,443 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-11 03:52:58,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:58,445 INFO L225 Difference]: With dead ends: 2491 [2024-10-11 03:52:58,445 INFO L226 Difference]: Without dead ends: 2313 [2024-10-11 03:52:58,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:58,446 INFO L432 NwaCegarLoop]: 946 mSDtfsCounter, 3481 mSDsluCounter, 3083 mSDsCounter, 0 mSdLazyCounter, 3346 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3481 SdHoareTripleChecker+Valid, 4029 SdHoareTripleChecker+Invalid, 3350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:58,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3481 Valid, 4029 Invalid, 3350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3346 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:52:58,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2024-10-11 03:52:58,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 1550. [2024-10-11 03:52:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.413543721236029) internal successors, (2150), 1549 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2150 transitions. [2024-10-11 03:52:58,457 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2150 transitions. Word has length 112 [2024-10-11 03:52:58,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:58,457 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2150 transitions. [2024-10-11 03:52:58,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2150 transitions. [2024-10-11 03:52:58,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 03:52:58,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:58,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:58,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-11 03:52:58,459 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:58,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:58,459 INFO L85 PathProgramCache]: Analyzing trace with hash -986214715, now seen corresponding path program 1 times [2024-10-11 03:52:58,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:58,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823526300] [2024-10-11 03:52:58,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:58,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:58,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:58,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:58,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823526300] [2024-10-11 03:52:58,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823526300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:58,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:58,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:58,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335080820] [2024-10-11 03:52:58,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:58,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:58,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:58,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:58,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:58,655 INFO L87 Difference]: Start difference. First operand 1550 states and 2150 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:59,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:59,888 INFO L93 Difference]: Finished difference Result 2487 states and 3457 transitions. [2024-10-11 03:52:59,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:59,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-11 03:52:59,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:59,891 INFO L225 Difference]: With dead ends: 2487 [2024-10-11 03:52:59,891 INFO L226 Difference]: Without dead ends: 2313 [2024-10-11 03:52:59,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:59,892 INFO L432 NwaCegarLoop]: 1000 mSDtfsCounter, 5069 mSDsluCounter, 3246 mSDsCounter, 0 mSdLazyCounter, 3519 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5069 SdHoareTripleChecker+Valid, 4246 SdHoareTripleChecker+Invalid, 3522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:59,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5069 Valid, 4246 Invalid, 3522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3519 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:52:59,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2024-10-11 03:52:59,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 1550. [2024-10-11 03:52:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.4128862590401052) internal successors, (2149), 1549 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2149 transitions. [2024-10-11 03:52:59,903 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2149 transitions. Word has length 112 [2024-10-11 03:52:59,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:59,903 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2149 transitions. [2024-10-11 03:52:59,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:59,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2149 transitions. [2024-10-11 03:52:59,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 03:52:59,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:59,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:59,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-11 03:52:59,905 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:52:59,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:59,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1285263200, now seen corresponding path program 1 times [2024-10-11 03:52:59,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:59,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053911831] [2024-10-11 03:52:59,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:59,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:53:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:53:00,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:53:00,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053911831] [2024-10-11 03:53:00,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053911831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:53:00,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:53:00,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:53:00,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219999308] [2024-10-11 03:53:00,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:53:00,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:53:00,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:53:00,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:53:00,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:53:00,087 INFO L87 Difference]: Start difference. First operand 1550 states and 2149 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:53:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:53:01,143 INFO L93 Difference]: Finished difference Result 2400 states and 3300 transitions. [2024-10-11 03:53:01,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:53:01,143 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-11 03:53:01,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:53:01,145 INFO L225 Difference]: With dead ends: 2400 [2024-10-11 03:53:01,146 INFO L226 Difference]: Without dead ends: 2232 [2024-10-11 03:53:01,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:53:01,146 INFO L432 NwaCegarLoop]: 794 mSDtfsCounter, 5749 mSDsluCounter, 2491 mSDsCounter, 0 mSdLazyCounter, 2901 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5749 SdHoareTripleChecker+Valid, 3285 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:53:01,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5749 Valid, 3285 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2901 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:53:01,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2024-10-11 03:53:01,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 1550. [2024-10-11 03:53:01,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.4122287968441816) internal successors, (2148), 1549 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:53:01,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2148 transitions. [2024-10-11 03:53:01,157 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2148 transitions. Word has length 112 [2024-10-11 03:53:01,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:53:01,157 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2148 transitions. [2024-10-11 03:53:01,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:53:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2148 transitions. [2024-10-11 03:53:01,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 03:53:01,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:53:01,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:53:01,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-11 03:53:01,159 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:53:01,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:53:01,159 INFO L85 PathProgramCache]: Analyzing trace with hash 905607109, now seen corresponding path program 1 times [2024-10-11 03:53:01,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:53:01,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723243794] [2024-10-11 03:53:01,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:53:01,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:53:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:53:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:53:01,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:53:01,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723243794] [2024-10-11 03:53:01,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723243794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:53:01,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:53:01,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:53:01,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433003527] [2024-10-11 03:53:01,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:53:01,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:53:01,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:53:01,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:53:01,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:53:01,356 INFO L87 Difference]: Start difference. First operand 1550 states and 2148 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:53:02,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:53:02,461 INFO L93 Difference]: Finished difference Result 2491 states and 3458 transitions. [2024-10-11 03:53:02,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:53:02,461 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-11 03:53:02,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:53:02,464 INFO L225 Difference]: With dead ends: 2491 [2024-10-11 03:53:02,464 INFO L226 Difference]: Without dead ends: 2313 [2024-10-11 03:53:02,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:53:02,464 INFO L432 NwaCegarLoop]: 1059 mSDtfsCounter, 4445 mSDsluCounter, 3088 mSDsCounter, 0 mSdLazyCounter, 3206 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4445 SdHoareTripleChecker+Valid, 4147 SdHoareTripleChecker+Invalid, 3210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:53:02,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4445 Valid, 4147 Invalid, 3210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3206 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:53:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2024-10-11 03:53:02,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 1550. [2024-10-11 03:53:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.4115713346482577) internal successors, (2147), 1549 states have internal predecessors, (2147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:53:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2147 transitions. [2024-10-11 03:53:02,476 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2147 transitions. Word has length 112 [2024-10-11 03:53:02,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:53:02,476 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2147 transitions. [2024-10-11 03:53:02,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:53:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2147 transitions. [2024-10-11 03:53:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 03:53:02,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:53:02,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:53:02,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-11 03:53:02,478 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:53:02,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:53:02,478 INFO L85 PathProgramCache]: Analyzing trace with hash -946721092, now seen corresponding path program 1 times [2024-10-11 03:53:02,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:53:02,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775630676] [2024-10-11 03:53:02,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:53:02,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:53:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:53:02,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:53:02,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:53:02,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775630676] [2024-10-11 03:53:02,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775630676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:53:02,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:53:02,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:53:02,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633293947] [2024-10-11 03:53:02,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:53:02,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:53:02,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:53:02,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:53:02,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:53:02,664 INFO L87 Difference]: Start difference. First operand 1550 states and 2147 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:53:03,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:53:03,848 INFO L93 Difference]: Finished difference Result 2487 states and 3452 transitions. [2024-10-11 03:53:03,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:53:03,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-11 03:53:03,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:53:03,851 INFO L225 Difference]: With dead ends: 2487 [2024-10-11 03:53:03,851 INFO L226 Difference]: Without dead ends: 2313 [2024-10-11 03:53:03,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:53:03,852 INFO L432 NwaCegarLoop]: 949 mSDtfsCounter, 5253 mSDsluCounter, 3095 mSDsCounter, 0 mSdLazyCounter, 3308 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5253 SdHoareTripleChecker+Valid, 4044 SdHoareTripleChecker+Invalid, 3312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:53:03,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5253 Valid, 4044 Invalid, 3312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3308 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:53:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2024-10-11 03:53:03,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 1550. [2024-10-11 03:53:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.410913872452334) internal successors, (2146), 1549 states have internal predecessors, (2146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:53:03,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2146 transitions. [2024-10-11 03:53:03,863 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2146 transitions. Word has length 112 [2024-10-11 03:53:03,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:53:03,863 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2146 transitions. [2024-10-11 03:53:03,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:53:03,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2146 transitions. [2024-10-11 03:53:03,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 03:53:03,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:53:03,865 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:53:03,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-11 03:53:03,865 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-11 03:53:03,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:53:03,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1650636604, now seen corresponding path program 1 times [2024-10-11 03:53:03,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:53:03,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179468088] [2024-10-11 03:53:03,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:53:03,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:53:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:53:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:53:04,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:53:04,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179468088] [2024-10-11 03:53:04,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179468088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:53:04,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:53:04,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:53:04,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712185821] [2024-10-11 03:53:04,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:53:04,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:53:04,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:53:04,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:53:04,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:53:04,049 INFO L87 Difference]: Start difference. First operand 1550 states and 2146 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)