./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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52cbb0c1391c9e840599beece58e1ecbc8d18028ef540ea98f759da7158f4609 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:31:56,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:31:56,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:31:56,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:31:56,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:31:56,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:31:56,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:31:56,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:31:56,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:31:56,901 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:31:56,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:31:56,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:31:56,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:31:56,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:31:56,903 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:31:56,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:31:56,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:31:56,904 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:31:56,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:31:56,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:31:56,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:31:56,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:31:56,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:31:56,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:31:56,908 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:31:56,908 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:31:56,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:31:56,908 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:31:56,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:31:56,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:31:56,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:31:56,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:31:56,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:31:56,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:31:56,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:31:56,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:31:56,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:31:56,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:31:56,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:31:56,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:31:56,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:31:56,911 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:31:56,912 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52cbb0c1391c9e840599beece58e1ecbc8d18028ef540ea98f759da7158f4609 [2024-10-12 20:31:57,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:31:57,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:31:57,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:31:57,133 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:31:57,134 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:31:57,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-12 20:31:58,326 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:31:58,619 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:31:58,620 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-12 20:31:58,643 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d5b7e168/51a888b9d9c64f02957ba9974ffd3e96/FLAG7aee63806 [2024-10-12 20:31:58,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d5b7e168/51a888b9d9c64f02957ba9974ffd3e96 [2024-10-12 20:31:58,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:31:58,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:31:58,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:31:58,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:31:58,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:31:58,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:31:58" (1/1) ... [2024-10-12 20:31:58,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eb3ee60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:58, skipping insertion in model container [2024-10-12 20:31:58,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:31:58" (1/1) ... [2024-10-12 20:31:58,750 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:31:59,119 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13531,13544] [2024-10-12 20:31:59,150 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18011,18024] [2024-10-12 20:31:59,160 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19303,19316] [2024-10-12 20:31:59,166 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20061,20074] [2024-10-12 20:31:59,172 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21681,21694] [2024-10-12 20:31:59,176 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22439,22452] [2024-10-12 20:31:59,185 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23525,23538] [2024-10-12 20:31:59,196 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26064,26077] [2024-10-12 20:31:59,201 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26825,26838] [2024-10-12 20:31:59,206 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27914,27927] [2024-10-12 20:31:59,214 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29919,29932] [2024-10-12 20:31:59,233 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33842,33855] [2024-10-12 20:31:59,241 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34603,34616] [2024-10-12 20:31:59,246 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35696,35709] [2024-10-12 20:31:59,254 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37705,37718] [2024-10-12 20:31:59,272 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41308,41321] [2024-10-12 20:31:59,299 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48185,48198] [2024-10-12 20:31:59,306 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48946,48959] [2024-10-12 20:31:59,311 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[50035,50048] [2024-10-12 20:31:59,326 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[52040,52053] [2024-10-12 20:31:59,338 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[55429,55442] [2024-10-12 20:31:59,360 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61126,61139] [2024-10-12 20:31:59,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:31:59,585 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:31:59,622 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13531,13544] [2024-10-12 20:31:59,629 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18011,18024] [2024-10-12 20:31:59,633 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19303,19316] [2024-10-12 20:31:59,635 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20061,20074] [2024-10-12 20:31:59,639 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21681,21694] [2024-10-12 20:31:59,641 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22439,22452] [2024-10-12 20:31:59,644 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23525,23538] [2024-10-12 20:31:59,650 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26064,26077] [2024-10-12 20:31:59,652 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26825,26838] [2024-10-12 20:31:59,655 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27914,27927] [2024-10-12 20:31:59,659 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29919,29932] [2024-10-12 20:31:59,667 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33842,33855] [2024-10-12 20:31:59,669 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34603,34616] [2024-10-12 20:31:59,672 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35696,35709] [2024-10-12 20:31:59,676 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37705,37718] [2024-10-12 20:31:59,684 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41308,41321] [2024-10-12 20:31:59,699 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48185,48198] [2024-10-12 20:31:59,701 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48946,48959] [2024-10-12 20:31:59,704 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[50035,50048] [2024-10-12 20:31:59,708 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[52040,52053] [2024-10-12 20:31:59,716 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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[55429,55442] [2024-10-12 20:31:59,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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61126,61139] [2024-10-12 20:31:59,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:31:59,878 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:31:59,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:59 WrapperNode [2024-10-12 20:31:59,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:31:59,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:31:59,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:31:59,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:31:59,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:59" (1/1) ... [2024-10-12 20:31:59,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:59" (1/1) ... [2024-10-12 20:32:00,035 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6748 [2024-10-12 20:32:00,036 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:32:00,036 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:32:00,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:32:00,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:32:00,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:59" (1/1) ... [2024-10-12 20:32:00,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:59" (1/1) ... [2024-10-12 20:32:00,058 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:59" (1/1) ... [2024-10-12 20:32:00,108 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-12 20:32:00,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:59" (1/1) ... [2024-10-12 20:32:00,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:59" (1/1) ... [2024-10-12 20:32:00,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:59" (1/1) ... [2024-10-12 20:32:00,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:59" (1/1) ... [2024-10-12 20:32:00,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:59" (1/1) ... [2024-10-12 20:32:00,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:59" (1/1) ... [2024-10-12 20:32:00,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:32:00,216 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:32:00,216 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:32:00,216 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:32:00,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:59" (1/1) ... [2024-10-12 20:32:00,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:32:00,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:32:00,242 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:32:00,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:32:00,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:32:00,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:32:00,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:32:00,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:32:00,464 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:32:00,466 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:32:02,795 INFO L? ?]: Removed 1001 outVars from TransFormulas that were not future-live. [2024-10-12 20:32:02,795 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:32:02,902 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:32:02,902 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:32:02,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:32:02 BoogieIcfgContainer [2024-10-12 20:32:02,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:32:02,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:32:02,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:32:02,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:32:02,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:31:58" (1/3) ... [2024-10-12 20:32:02,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7359b031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:32:02, skipping insertion in model container [2024-10-12 20:32:02,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:59" (2/3) ... [2024-10-12 20:32:02,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7359b031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:32:02, skipping insertion in model container [2024-10-12 20:32:02,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:32:02" (3/3) ... [2024-10-12 20:32:02,910 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-12 20:32:02,923 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:32:02,923 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-10-12 20:32:03,008 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:32:03,015 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;@118eb2d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:32:03,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-10-12 20:32:03,025 INFO L276 IsEmpty]: Start isEmpty. Operand has 1122 states, 1099 states have (on average 1.8616924476797088) internal successors, (2046), 1121 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:03,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 20:32:03,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:03,052 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] [2024-10-12 20:32:03,052 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:03,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:03,057 INFO L85 PathProgramCache]: Analyzing trace with hash -744865271, now seen corresponding path program 1 times [2024-10-12 20:32:03,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:03,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953182559] [2024-10-12 20:32:03,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:03,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:03,524 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-12 20:32:03,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:03,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953182559] [2024-10-12 20:32:03,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953182559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:03,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:03,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:03,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198479336] [2024-10-12 20:32:03,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:03,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:03,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:03,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:03,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:03,555 INFO L87 Difference]: Start difference. First operand has 1122 states, 1099 states have (on average 1.8616924476797088) internal successors, (2046), 1121 states have internal predecessors, (2046), 0 states have call successors, (0), 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 16.8) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:04,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:04,179 INFO L93 Difference]: Finished difference Result 1697 states and 2993 transitions. [2024-10-12 20:32:04,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:04,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-12 20:32:04,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:04,191 INFO L225 Difference]: With dead ends: 1697 [2024-10-12 20:32:04,192 INFO L226 Difference]: Without dead ends: 876 [2024-10-12 20:32:04,195 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-12 20:32:04,197 INFO L432 NwaCegarLoop]: 1016 mSDtfsCounter, 4497 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4497 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:04,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4497 Valid, 1056 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:32:04,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-10-12 20:32:04,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 876. [2024-10-12 20:32:04,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 854 states have (on average 1.3185011709601873) internal successors, (1126), 875 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1126 transitions. [2024-10-12 20:32:04,249 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1126 transitions. Word has length 84 [2024-10-12 20:32:04,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:04,251 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1126 transitions. [2024-10-12 20:32:04,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:04,252 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1126 transitions. [2024-10-12 20:32:04,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 20:32:04,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:04,256 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] [2024-10-12 20:32:04,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:32:04,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:04,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:04,257 INFO L85 PathProgramCache]: Analyzing trace with hash 861830130, now seen corresponding path program 1 times [2024-10-12 20:32:04,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:04,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870249612] [2024-10-12 20:32:04,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:04,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:04,438 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-12 20:32:04,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:04,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870249612] [2024-10-12 20:32:04,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870249612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:04,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:04,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:04,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990352253] [2024-10-12 20:32:04,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:04,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:04,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:04,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:04,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:04,442 INFO L87 Difference]: Start difference. First operand 876 states and 1126 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:04,811 INFO L93 Difference]: Finished difference Result 1445 states and 1914 transitions. [2024-10-12 20:32:04,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:04,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-12 20:32:04,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:04,815 INFO L225 Difference]: With dead ends: 1445 [2024-10-12 20:32:04,815 INFO L226 Difference]: Without dead ends: 745 [2024-10-12 20:32:04,816 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-12 20:32:04,817 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 2883 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2883 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:04,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2883 Valid, 569 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:32:04,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-10-12 20:32:04,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2024-10-12 20:32:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 723 states have (on average 1.3526970954356847) internal successors, (978), 744 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:04,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 978 transitions. [2024-10-12 20:32:04,837 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 978 transitions. Word has length 85 [2024-10-12 20:32:04,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:04,837 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 978 transitions. [2024-10-12 20:32:04,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:04,838 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 978 transitions. [2024-10-12 20:32:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 20:32:04,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:04,839 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] [2024-10-12 20:32:04,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:32:04,840 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:04,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:04,840 INFO L85 PathProgramCache]: Analyzing trace with hash 139657888, now seen corresponding path program 1 times [2024-10-12 20:32:04,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:04,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34888271] [2024-10-12 20:32:04,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:04,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:05,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-12 20:32:05,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:05,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34888271] [2024-10-12 20:32:05,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34888271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:05,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:05,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:05,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411450151] [2024-10-12 20:32:05,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:05,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:05,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:05,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:05,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:05,016 INFO L87 Difference]: Start difference. First operand 745 states and 978 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:05,481 INFO L93 Difference]: Finished difference Result 1314 states and 1765 transitions. [2024-10-12 20:32:05,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:05,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-10-12 20:32:05,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:05,484 INFO L225 Difference]: With dead ends: 1314 [2024-10-12 20:32:05,484 INFO L226 Difference]: Without dead ends: 705 [2024-10-12 20:32:05,485 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-12 20:32:05,486 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 2653 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2653 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:05,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2653 Valid, 466 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:32:05,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-12 20:32:05,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2024-10-12 20:32:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 683 states have (on average 1.3601756954612005) internal successors, (929), 704 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:05,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 929 transitions. [2024-10-12 20:32:05,497 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 929 transitions. Word has length 86 [2024-10-12 20:32:05,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:05,497 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 929 transitions. [2024-10-12 20:32:05,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:05,498 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 929 transitions. [2024-10-12 20:32:05,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 20:32:05,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:05,499 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] [2024-10-12 20:32:05,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:32:05,499 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:05,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:05,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1409043309, now seen corresponding path program 1 times [2024-10-12 20:32:05,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:05,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544048747] [2024-10-12 20:32:05,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:05,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:05,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-12 20:32:05,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:05,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544048747] [2024-10-12 20:32:05,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544048747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:05,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:05,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:05,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534947502] [2024-10-12 20:32:05,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:05,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:05,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:05,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:05,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:05,638 INFO L87 Difference]: Start difference. First operand 705 states and 929 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:05,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:05,969 INFO L93 Difference]: Finished difference Result 1274 states and 1715 transitions. [2024-10-12 20:32:05,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:05,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-12 20:32:05,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:05,972 INFO L225 Difference]: With dead ends: 1274 [2024-10-12 20:32:05,972 INFO L226 Difference]: Without dead ends: 667 [2024-10-12 20:32:05,973 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-12 20:32:05,973 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 2568 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2568 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:05,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2568 Valid, 506 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:32:05,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-10-12 20:32:05,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2024-10-12 20:32:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 645 states have (on average 1.3736434108527131) internal successors, (886), 666 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 886 transitions. [2024-10-12 20:32:05,983 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 886 transitions. Word has length 87 [2024-10-12 20:32:05,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:05,984 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 886 transitions. [2024-10-12 20:32:05,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:05,984 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 886 transitions. [2024-10-12 20:32:05,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-12 20:32:05,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:05,986 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] [2024-10-12 20:32:05,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:32:05,986 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:05,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:05,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1145590041, now seen corresponding path program 1 times [2024-10-12 20:32:05,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:05,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137956825] [2024-10-12 20:32:05,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:05,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:06,113 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-12 20:32:06,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:06,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137956825] [2024-10-12 20:32:06,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137956825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:06,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:06,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:06,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971646106] [2024-10-12 20:32:06,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:06,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:06,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:06,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:06,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:06,116 INFO L87 Difference]: Start difference. First operand 667 states and 886 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:06,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:06,416 INFO L93 Difference]: Finished difference Result 1236 states and 1671 transitions. [2024-10-12 20:32:06,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:06,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-10-12 20:32:06,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:06,422 INFO L225 Difference]: With dead ends: 1236 [2024-10-12 20:32:06,422 INFO L226 Difference]: Without dead ends: 642 [2024-10-12 20:32:06,423 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-12 20:32:06,423 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 2511 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2511 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:06,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2511 Valid, 493 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:32:06,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-10-12 20:32:06,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2024-10-12 20:32:06,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3838709677419354) internal successors, (858), 641 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 858 transitions. [2024-10-12 20:32:06,431 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 858 transitions. Word has length 88 [2024-10-12 20:32:06,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:06,431 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 858 transitions. [2024-10-12 20:32:06,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:06,431 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 858 transitions. [2024-10-12 20:32:06,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 20:32:06,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:06,432 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] [2024-10-12 20:32:06,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:32:06,432 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:06,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:06,433 INFO L85 PathProgramCache]: Analyzing trace with hash -81085098, now seen corresponding path program 1 times [2024-10-12 20:32:06,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:06,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810781038] [2024-10-12 20:32:06,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:06,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:06,536 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-12 20:32:06,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:06,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810781038] [2024-10-12 20:32:06,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810781038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:06,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:06,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:06,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128838527] [2024-10-12 20:32:06,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:06,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:06,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:06,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:06,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:06,538 INFO L87 Difference]: Start difference. First operand 642 states and 858 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:06,875 INFO L93 Difference]: Finished difference Result 1211 states and 1642 transitions. [2024-10-12 20:32:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:06,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-10-12 20:32:06,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:06,877 INFO L225 Difference]: With dead ends: 1211 [2024-10-12 20:32:06,877 INFO L226 Difference]: Without dead ends: 634 [2024-10-12 20:32:06,878 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-12 20:32:06,880 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 2434 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2434 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:06,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2434 Valid, 469 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:32:06,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-10-12 20:32:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2024-10-12 20:32:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3856209150326797) internal successors, (848), 633 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 848 transitions. [2024-10-12 20:32:06,892 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 848 transitions. Word has length 89 [2024-10-12 20:32:06,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:06,892 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 848 transitions. [2024-10-12 20:32:06,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:06,892 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 848 transitions. [2024-10-12 20:32:06,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 20:32:06,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:06,894 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] [2024-10-12 20:32:06,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:32:06,894 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:06,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:06,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1177000506, now seen corresponding path program 1 times [2024-10-12 20:32:06,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:06,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455617445] [2024-10-12 20:32:06,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:06,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:07,216 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-12 20:32:07,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:07,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455617445] [2024-10-12 20:32:07,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455617445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:07,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:07,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:32:07,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368690974] [2024-10-12 20:32:07,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:07,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:32:07,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:07,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:32:07,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:32:07,218 INFO L87 Difference]: Start difference. First operand 634 states and 848 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:07,939 INFO L93 Difference]: Finished difference Result 1196 states and 1557 transitions. [2024-10-12 20:32:07,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:32:07,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-10-12 20:32:07,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:07,943 INFO L225 Difference]: With dead ends: 1196 [2024-10-12 20:32:07,943 INFO L226 Difference]: Without dead ends: 851 [2024-10-12 20:32:07,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:32:07,944 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 2871 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2871 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 1524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:07,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2871 Valid, 1381 Invalid, 1524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:07,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2024-10-12 20:32:07,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 634. [2024-10-12 20:32:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3839869281045751) internal successors, (847), 633 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 847 transitions. [2024-10-12 20:32:07,952 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 847 transitions. Word has length 90 [2024-10-12 20:32:07,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:07,952 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 847 transitions. [2024-10-12 20:32:07,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:07,953 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 847 transitions. [2024-10-12 20:32:07,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 20:32:07,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:07,954 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] [2024-10-12 20:32:07,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:32:07,954 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:07,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:07,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1435926047, now seen corresponding path program 1 times [2024-10-12 20:32:07,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:07,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127115558] [2024-10-12 20:32:07,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:07,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:08,322 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-12 20:32:08,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:08,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127115558] [2024-10-12 20:32:08,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127115558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:08,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:08,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:32:08,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792963204] [2024-10-12 20:32:08,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:08,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:32:08,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:08,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:32:08,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:32:08,324 INFO L87 Difference]: Start difference. First operand 634 states and 847 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:09,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:09,522 INFO L93 Difference]: Finished difference Result 1084 states and 1457 transitions. [2024-10-12 20:32:09,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:32:09,523 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-10-12 20:32:09,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:09,528 INFO L225 Difference]: With dead ends: 1084 [2024-10-12 20:32:09,528 INFO L226 Difference]: Without dead ends: 985 [2024-10-12 20:32:09,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2024-10-12 20:32:09,530 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 2245 mSDsluCounter, 2289 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2245 SdHoareTripleChecker+Valid, 2755 SdHoareTripleChecker+Invalid, 2298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:09,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2245 Valid, 2755 Invalid, 2298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2290 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 20:32:09,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2024-10-12 20:32:09,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 641. [2024-10-12 20:32:09,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 619 states have (on average 1.384491114701131) internal successors, (857), 640 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:09,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 857 transitions. [2024-10-12 20:32:09,545 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 857 transitions. Word has length 90 [2024-10-12 20:32:09,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:09,545 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 857 transitions. [2024-10-12 20:32:09,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:09,545 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 857 transitions. [2024-10-12 20:32:09,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 20:32:09,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:09,548 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] [2024-10-12 20:32:09,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:32:09,548 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:09,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:09,549 INFO L85 PathProgramCache]: Analyzing trace with hash 546881237, now seen corresponding path program 1 times [2024-10-12 20:32:09,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:09,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131016254] [2024-10-12 20:32:09,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:09,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:09,834 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-12 20:32:09,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:09,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131016254] [2024-10-12 20:32:09,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131016254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:09,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:09,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:09,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548362179] [2024-10-12 20:32:09,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:09,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:09,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:09,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:09,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:09,836 INFO L87 Difference]: Start difference. First operand 641 states and 857 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:10,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:10,689 INFO L93 Difference]: Finished difference Result 1174 states and 1586 transitions. [2024-10-12 20:32:10,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:10,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-10-12 20:32:10,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:10,693 INFO L225 Difference]: With dead ends: 1174 [2024-10-12 20:32:10,693 INFO L226 Difference]: Without dead ends: 982 [2024-10-12 20:32:10,694 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-12 20:32:10,694 INFO L432 NwaCegarLoop]: 922 mSDtfsCounter, 2527 mSDsluCounter, 2375 mSDsCounter, 0 mSdLazyCounter, 2244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2527 SdHoareTripleChecker+Valid, 3297 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:10,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2527 Valid, 3297 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2244 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:32:10,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2024-10-12 20:32:10,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 634. [2024-10-12 20:32:10,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3823529411764706) internal successors, (846), 633 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:10,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 846 transitions. [2024-10-12 20:32:10,703 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 846 transitions. Word has length 90 [2024-10-12 20:32:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:10,703 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 846 transitions. [2024-10-12 20:32:10,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:10,704 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 846 transitions. [2024-10-12 20:32:10,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 20:32:10,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:10,705 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] [2024-10-12 20:32:10,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:32:10,706 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:10,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:10,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1452291629, now seen corresponding path program 1 times [2024-10-12 20:32:10,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:10,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392053027] [2024-10-12 20:32:10,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:10,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:10,966 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-12 20:32:10,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:10,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392053027] [2024-10-12 20:32:10,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392053027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:10,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:10,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:10,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755896725] [2024-10-12 20:32:10,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:10,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:10,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:10,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:10,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:10,969 INFO L87 Difference]: Start difference. First operand 634 states and 846 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:11,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:11,763 INFO L93 Difference]: Finished difference Result 1069 states and 1436 transitions. [2024-10-12 20:32:11,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:11,764 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-10-12 20:32:11,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:11,767 INFO L225 Difference]: With dead ends: 1069 [2024-10-12 20:32:11,767 INFO L226 Difference]: Without dead ends: 970 [2024-10-12 20:32:11,768 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-12 20:32:11,768 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 3475 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3475 SdHoareTripleChecker+Valid, 2052 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:11,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3475 Valid, 2052 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1650 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:32:11,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-10-12 20:32:11,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 634. [2024-10-12 20:32:11,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.380718954248366) internal successors, (845), 633 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:11,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 845 transitions. [2024-10-12 20:32:11,777 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 845 transitions. Word has length 90 [2024-10-12 20:32:11,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:11,777 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 845 transitions. [2024-10-12 20:32:11,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:11,778 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 845 transitions. [2024-10-12 20:32:11,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:32:11,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:11,779 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] [2024-10-12 20:32:11,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:32:11,779 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:11,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:11,780 INFO L85 PathProgramCache]: Analyzing trace with hash 280311879, now seen corresponding path program 1 times [2024-10-12 20:32:11,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:11,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695714068] [2024-10-12 20:32:11,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:11,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:12,007 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-12 20:32:12,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:12,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695714068] [2024-10-12 20:32:12,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695714068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:12,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:12,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:12,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029592175] [2024-10-12 20:32:12,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:12,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:12,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:12,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:12,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:12,010 INFO L87 Difference]: Start difference. First operand 634 states and 845 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:12,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:12,858 INFO L93 Difference]: Finished difference Result 1204 states and 1612 transitions. [2024-10-12 20:32:12,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:12,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-12 20:32:12,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:12,861 INFO L225 Difference]: With dead ends: 1204 [2024-10-12 20:32:12,861 INFO L226 Difference]: Without dead ends: 982 [2024-10-12 20:32:12,861 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-12 20:32:12,862 INFO L432 NwaCegarLoop]: 674 mSDtfsCounter, 1835 mSDsluCounter, 2207 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1835 SdHoareTripleChecker+Valid, 2881 SdHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:12,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1835 Valid, 2881 Invalid, 2273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:32:12,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2024-10-12 20:32:12,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 634. [2024-10-12 20:32:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3790849673202614) internal successors, (844), 633 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 844 transitions. [2024-10-12 20:32:12,870 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 844 transitions. Word has length 92 [2024-10-12 20:32:12,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:12,871 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 844 transitions. [2024-10-12 20:32:12,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:12,871 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 844 transitions. [2024-10-12 20:32:12,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:32:12,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:12,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:12,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:32:12,872 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:12,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:12,873 INFO L85 PathProgramCache]: Analyzing trace with hash 347470600, now seen corresponding path program 1 times [2024-10-12 20:32:12,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:12,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889246293] [2024-10-12 20:32:12,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:12,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:13,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-12 20:32:13,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:13,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889246293] [2024-10-12 20:32:13,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889246293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:13,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:13,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:13,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479041370] [2024-10-12 20:32:13,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:13,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:13,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:13,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:13,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:13,088 INFO L87 Difference]: Start difference. First operand 634 states and 844 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:13,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:13,858 INFO L93 Difference]: Finished difference Result 927 states and 1211 transitions. [2024-10-12 20:32:13,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:13,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-12 20:32:13,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:13,861 INFO L225 Difference]: With dead ends: 927 [2024-10-12 20:32:13,861 INFO L226 Difference]: Without dead ends: 922 [2024-10-12 20:32:13,861 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-12 20:32:13,861 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 2294 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2294 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:13,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2294 Valid, 1866 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:32:13,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-10-12 20:32:13,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 634. [2024-10-12 20:32:13,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3774509803921569) internal successors, (843), 633 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:13,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 843 transitions. [2024-10-12 20:32:13,868 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 843 transitions. Word has length 92 [2024-10-12 20:32:13,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:13,869 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 843 transitions. [2024-10-12 20:32:13,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:13,869 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 843 transitions. [2024-10-12 20:32:13,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:32:13,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:13,870 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] [2024-10-12 20:32:13,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:32:13,870 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:13,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:13,871 INFO L85 PathProgramCache]: Analyzing trace with hash -950419438, now seen corresponding path program 1 times [2024-10-12 20:32:13,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:13,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452792669] [2024-10-12 20:32:13,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:13,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:14,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:14,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:14,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452792669] [2024-10-12 20:32:14,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452792669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:14,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:14,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:14,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176526419] [2024-10-12 20:32:14,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:14,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:14,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:14,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:14,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:14,068 INFO L87 Difference]: Start difference. First operand 634 states and 843 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:14,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:14,989 INFO L93 Difference]: Finished difference Result 1116 states and 1499 transitions. [2024-10-12 20:32:14,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:32:14,992 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-12 20:32:14,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:14,995 INFO L225 Difference]: With dead ends: 1116 [2024-10-12 20:32:14,995 INFO L226 Difference]: Without dead ends: 978 [2024-10-12 20:32:14,996 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-12 20:32:14,996 INFO L432 NwaCegarLoop]: 725 mSDtfsCounter, 2590 mSDsluCounter, 2368 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2590 SdHoareTripleChecker+Valid, 3093 SdHoareTripleChecker+Invalid, 2418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:14,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2590 Valid, 3093 Invalid, 2418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2415 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:32:14,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-10-12 20:32:15,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 634. [2024-10-12 20:32:15,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3758169934640523) internal successors, (842), 633 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:15,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 842 transitions. [2024-10-12 20:32:15,006 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 842 transitions. Word has length 92 [2024-10-12 20:32:15,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:15,006 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 842 transitions. [2024-10-12 20:32:15,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:15,007 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 842 transitions. [2024-10-12 20:32:15,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:32:15,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:15,008 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] [2024-10-12 20:32:15,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:32:15,008 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:15,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:15,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1340210149, now seen corresponding path program 1 times [2024-10-12 20:32:15,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:15,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516446942] [2024-10-12 20:32:15,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:15,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:15,256 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-12 20:32:15,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:15,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516446942] [2024-10-12 20:32:15,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516446942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:15,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:15,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:15,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150226570] [2024-10-12 20:32:15,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:15,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:15,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:15,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:15,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:15,258 INFO L87 Difference]: Start difference. First operand 634 states and 842 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:15,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:15,956 INFO L93 Difference]: Finished difference Result 1001 states and 1319 transitions. [2024-10-12 20:32:15,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:15,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-12 20:32:15,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:15,958 INFO L225 Difference]: With dead ends: 1001 [2024-10-12 20:32:15,958 INFO L226 Difference]: Without dead ends: 922 [2024-10-12 20:32:15,959 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-12 20:32:15,959 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 3452 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3452 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:15,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3452 Valid, 1866 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1592 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:15,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-10-12 20:32:15,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 634. [2024-10-12 20:32:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3741830065359477) internal successors, (841), 633 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 841 transitions. [2024-10-12 20:32:15,966 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 841 transitions. Word has length 92 [2024-10-12 20:32:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:15,966 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 841 transitions. [2024-10-12 20:32:15,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 841 transitions. [2024-10-12 20:32:15,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:32:15,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:15,967 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] [2024-10-12 20:32:15,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:32:15,967 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:15,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:15,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2065712337, now seen corresponding path program 1 times [2024-10-12 20:32:15,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:15,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88001277] [2024-10-12 20:32:15,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:15,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:16,398 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-12 20:32:16,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:16,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88001277] [2024-10-12 20:32:16,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88001277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:16,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:16,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:32:16,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523565780] [2024-10-12 20:32:16,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:16,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:32:16,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:16,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:32:16,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:32:16,400 INFO L87 Difference]: Start difference. First operand 634 states and 841 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:17,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:17,926 INFO L93 Difference]: Finished difference Result 1418 states and 1945 transitions. [2024-10-12 20:32:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 20:32:17,926 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-12 20:32:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:17,929 INFO L225 Difference]: With dead ends: 1418 [2024-10-12 20:32:17,930 INFO L226 Difference]: Without dead ends: 1280 [2024-10-12 20:32:17,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-12 20:32:17,931 INFO L432 NwaCegarLoop]: 707 mSDtfsCounter, 5336 mSDsluCounter, 3282 mSDsCounter, 0 mSdLazyCounter, 3273 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5336 SdHoareTripleChecker+Valid, 3989 SdHoareTripleChecker+Invalid, 3470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 3273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:17,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5336 Valid, 3989 Invalid, 3470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 3273 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:32:17,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2024-10-12 20:32:17,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 638. [2024-10-12 20:32:17,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3717532467532467) internal successors, (845), 637 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:17,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 845 transitions. [2024-10-12 20:32:17,939 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 845 transitions. Word has length 92 [2024-10-12 20:32:17,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:17,939 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 845 transitions. [2024-10-12 20:32:17,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:17,939 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 845 transitions. [2024-10-12 20:32:17,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:32:17,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:17,940 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] [2024-10-12 20:32:17,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:32:17,940 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:17,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:17,941 INFO L85 PathProgramCache]: Analyzing trace with hash -587338309, now seen corresponding path program 1 times [2024-10-12 20:32:17,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:17,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060048265] [2024-10-12 20:32:17,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:17,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:18,178 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-12 20:32:18,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:18,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060048265] [2024-10-12 20:32:18,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060048265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:18,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:18,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:18,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903563260] [2024-10-12 20:32:18,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:18,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:18,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:18,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:18,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:18,182 INFO L87 Difference]: Start difference. First operand 638 states and 845 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:18,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:18,892 INFO L93 Difference]: Finished difference Result 931 states and 1210 transitions. [2024-10-12 20:32:18,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:18,893 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-12 20:32:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:18,895 INFO L225 Difference]: With dead ends: 931 [2024-10-12 20:32:18,895 INFO L226 Difference]: Without dead ends: 926 [2024-10-12 20:32:18,896 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-12 20:32:18,896 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 3447 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3447 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:18,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3447 Valid, 1866 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:18,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-12 20:32:18,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 638. [2024-10-12 20:32:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.37012987012987) internal successors, (844), 637 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:18,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 844 transitions. [2024-10-12 20:32:18,904 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 844 transitions. Word has length 92 [2024-10-12 20:32:18,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:18,905 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 844 transitions. [2024-10-12 20:32:18,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:18,905 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 844 transitions. [2024-10-12 20:32:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:32:18,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:18,906 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] [2024-10-12 20:32:18,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:32:18,906 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:18,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:18,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1856213353, now seen corresponding path program 1 times [2024-10-12 20:32:18,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:18,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235528986] [2024-10-12 20:32:18,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:18,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:19,109 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-12 20:32:19,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:19,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235528986] [2024-10-12 20:32:19,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235528986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:19,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:19,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:19,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926174739] [2024-10-12 20:32:19,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:19,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:19,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:19,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:19,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:19,111 INFO L87 Difference]: Start difference. First operand 638 states and 844 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:19,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:19,798 INFO L93 Difference]: Finished difference Result 1040 states and 1381 transitions. [2024-10-12 20:32:19,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:32:19,799 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-12 20:32:19,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:19,801 INFO L225 Difference]: With dead ends: 1040 [2024-10-12 20:32:19,801 INFO L226 Difference]: Without dead ends: 958 [2024-10-12 20:32:19,801 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-12 20:32:19,802 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 2180 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2180 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:19,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2180 Valid, 2064 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:19,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-12 20:32:19,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 638. [2024-10-12 20:32:19,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3685064935064934) internal successors, (843), 637 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:19,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 843 transitions. [2024-10-12 20:32:19,808 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 843 transitions. Word has length 92 [2024-10-12 20:32:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:19,808 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 843 transitions. [2024-10-12 20:32:19,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:19,809 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 843 transitions. [2024-10-12 20:32:19,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:32:19,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:19,810 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] [2024-10-12 20:32:19,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:32:19,810 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:19,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:19,811 INFO L85 PathProgramCache]: Analyzing trace with hash -98755353, now seen corresponding path program 1 times [2024-10-12 20:32:19,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:19,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563618668] [2024-10-12 20:32:19,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:19,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:20,030 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-12 20:32:20,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:20,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563618668] [2024-10-12 20:32:20,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563618668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:20,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:20,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:20,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78193168] [2024-10-12 20:32:20,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:20,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:20,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:20,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:20,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:20,032 INFO L87 Difference]: Start difference. First operand 638 states and 843 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:20,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:20,811 INFO L93 Difference]: Finished difference Result 1067 states and 1425 transitions. [2024-10-12 20:32:20,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:20,811 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-12 20:32:20,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:20,814 INFO L225 Difference]: With dead ends: 1067 [2024-10-12 20:32:20,814 INFO L226 Difference]: Without dead ends: 974 [2024-10-12 20:32:20,814 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-12 20:32:20,815 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 2561 mSDsluCounter, 2238 mSDsCounter, 0 mSdLazyCounter, 2105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2561 SdHoareTripleChecker+Valid, 2786 SdHoareTripleChecker+Invalid, 2109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:20,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2561 Valid, 2786 Invalid, 2109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2105 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:32:20,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-12 20:32:20,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 638. [2024-10-12 20:32:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3668831168831168) internal successors, (842), 637 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:20,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 842 transitions. [2024-10-12 20:32:20,821 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 842 transitions. Word has length 92 [2024-10-12 20:32:20,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:20,822 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 842 transitions. [2024-10-12 20:32:20,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:20,822 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 842 transitions. [2024-10-12 20:32:20,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 20:32:20,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:20,823 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] [2024-10-12 20:32:20,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:32:20,823 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:20,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:20,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1488242838, now seen corresponding path program 1 times [2024-10-12 20:32:20,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:20,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784755420] [2024-10-12 20:32:20,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:20,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:21,092 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-12 20:32:21,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:21,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784755420] [2024-10-12 20:32:21,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784755420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:21,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:21,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:21,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410300440] [2024-10-12 20:32:21,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:21,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:21,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:21,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:21,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:21,096 INFO L87 Difference]: Start difference. First operand 638 states and 842 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:21,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:21,976 INFO L93 Difference]: Finished difference Result 1116 states and 1495 transitions. [2024-10-12 20:32:21,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:21,976 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-10-12 20:32:21,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:21,979 INFO L225 Difference]: With dead ends: 1116 [2024-10-12 20:32:21,979 INFO L226 Difference]: Without dead ends: 978 [2024-10-12 20:32:21,979 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-12 20:32:21,979 INFO L432 NwaCegarLoop]: 722 mSDtfsCounter, 2574 mSDsluCounter, 2356 mSDsCounter, 0 mSdLazyCounter, 2397 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2574 SdHoareTripleChecker+Valid, 3078 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:21,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2574 Valid, 3078 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2397 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:32:21,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-10-12 20:32:21,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 634. [2024-10-12 20:32:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3676470588235294) internal successors, (837), 633 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 837 transitions. [2024-10-12 20:32:21,985 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 837 transitions. Word has length 93 [2024-10-12 20:32:21,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:21,986 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 837 transitions. [2024-10-12 20:32:21,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:21,986 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 837 transitions. [2024-10-12 20:32:21,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:32:21,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:21,987 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] [2024-10-12 20:32:21,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:32:21,987 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:21,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:21,988 INFO L85 PathProgramCache]: Analyzing trace with hash 514536132, now seen corresponding path program 1 times [2024-10-12 20:32:21,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:21,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683082192] [2024-10-12 20:32:21,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:21,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:22,165 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-12 20:32:22,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:22,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683082192] [2024-10-12 20:32:22,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683082192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:22,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:22,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:22,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503559676] [2024-10-12 20:32:22,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:22,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:22,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:22,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:22,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:22,167 INFO L87 Difference]: Start difference. First operand 634 states and 837 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:22,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:22,960 INFO L93 Difference]: Finished difference Result 1078 states and 1433 transitions. [2024-10-12 20:32:22,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:32:22,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-12 20:32:22,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:22,962 INFO L225 Difference]: With dead ends: 1078 [2024-10-12 20:32:22,962 INFO L226 Difference]: Without dead ends: 970 [2024-10-12 20:32:22,962 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-12 20:32:22,963 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 3105 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3105 SdHoareTripleChecker+Valid, 2431 SdHoareTripleChecker+Invalid, 1898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:22,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3105 Valid, 2431 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1894 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:32:22,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-10-12 20:32:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 634. [2024-10-12 20:32:22,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3660130718954249) internal successors, (836), 633 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 836 transitions. [2024-10-12 20:32:22,972 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 836 transitions. Word has length 94 [2024-10-12 20:32:22,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:22,973 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 836 transitions. [2024-10-12 20:32:22,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 836 transitions. [2024-10-12 20:32:22,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:32:22,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:22,974 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] [2024-10-12 20:32:22,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:32:22,974 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:22,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:22,975 INFO L85 PathProgramCache]: Analyzing trace with hash 105690904, now seen corresponding path program 1 times [2024-10-12 20:32:22,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:22,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3151776] [2024-10-12 20:32:22,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:22,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:23,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-12 20:32:23,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:23,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3151776] [2024-10-12 20:32:23,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3151776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:23,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:23,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:23,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975183962] [2024-10-12 20:32:23,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:23,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:23,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:23,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:23,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:23,149 INFO L87 Difference]: Start difference. First operand 634 states and 836 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:23,816 INFO L93 Difference]: Finished difference Result 1001 states and 1311 transitions. [2024-10-12 20:32:23,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:23,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-12 20:32:23,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:23,819 INFO L225 Difference]: With dead ends: 1001 [2024-10-12 20:32:23,819 INFO L226 Difference]: Without dead ends: 922 [2024-10-12 20:32:23,820 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-12 20:32:23,820 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 3401 mSDsluCounter, 1436 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3401 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 1597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:23,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3401 Valid, 1886 Invalid, 1597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:23,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-10-12 20:32:23,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 634. [2024-10-12 20:32:23,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3643790849673203) internal successors, (835), 633 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:23,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 835 transitions. [2024-10-12 20:32:23,827 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 835 transitions. Word has length 94 [2024-10-12 20:32:23,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:23,827 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 835 transitions. [2024-10-12 20:32:23,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:23,828 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 835 transitions. [2024-10-12 20:32:23,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:32:23,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:23,829 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] [2024-10-12 20:32:23,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:32:23,829 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:23,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:23,829 INFO L85 PathProgramCache]: Analyzing trace with hash 909968804, now seen corresponding path program 1 times [2024-10-12 20:32:23,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:23,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96560899] [2024-10-12 20:32:23,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:23,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:24,023 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-12 20:32:24,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:24,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96560899] [2024-10-12 20:32:24,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96560899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:24,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:24,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:24,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184019428] [2024-10-12 20:32:24,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:24,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:24,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:24,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:24,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:24,025 INFO L87 Difference]: Start difference. First operand 634 states and 835 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:24,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:24,730 INFO L93 Difference]: Finished difference Result 1131 states and 1503 transitions. [2024-10-12 20:32:24,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:32:24,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-12 20:32:24,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:24,734 INFO L225 Difference]: With dead ends: 1131 [2024-10-12 20:32:24,735 INFO L226 Difference]: Without dead ends: 978 [2024-10-12 20:32:24,735 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-12 20:32:24,735 INFO L432 NwaCegarLoop]: 812 mSDtfsCounter, 2489 mSDsluCounter, 2222 mSDsCounter, 0 mSdLazyCounter, 2039 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2489 SdHoareTripleChecker+Valid, 3034 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:24,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2489 Valid, 3034 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2039 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:24,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-10-12 20:32:24,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 634. [2024-10-12 20:32:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3627450980392157) internal successors, (834), 633 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 834 transitions. [2024-10-12 20:32:24,741 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 834 transitions. Word has length 94 [2024-10-12 20:32:24,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:24,742 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 834 transitions. [2024-10-12 20:32:24,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:24,742 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 834 transitions. [2024-10-12 20:32:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:32:24,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:24,743 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] [2024-10-12 20:32:24,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:32:24,743 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:24,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:24,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2106541419, now seen corresponding path program 1 times [2024-10-12 20:32:24,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:24,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42608485] [2024-10-12 20:32:24,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:24,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:24,948 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-12 20:32:24,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:24,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42608485] [2024-10-12 20:32:24,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42608485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:24,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:24,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:24,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026604855] [2024-10-12 20:32:24,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:24,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:24,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:24,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:24,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:24,950 INFO L87 Difference]: Start difference. First operand 634 states and 834 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:25,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:25,831 INFO L93 Difference]: Finished difference Result 1069 states and 1420 transitions. [2024-10-12 20:32:25,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:25,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-12 20:32:25,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:25,833 INFO L225 Difference]: With dead ends: 1069 [2024-10-12 20:32:25,833 INFO L226 Difference]: Without dead ends: 970 [2024-10-12 20:32:25,834 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-12 20:32:25,834 INFO L432 NwaCegarLoop]: 725 mSDtfsCounter, 2541 mSDsluCounter, 2568 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2541 SdHoareTripleChecker+Valid, 3293 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:25,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2541 Valid, 3293 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:32:25,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-10-12 20:32:25,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 634. [2024-10-12 20:32:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3611111111111112) internal successors, (833), 633 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:25,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 833 transitions. [2024-10-12 20:32:25,841 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 833 transitions. Word has length 94 [2024-10-12 20:32:25,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:25,841 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 833 transitions. [2024-10-12 20:32:25,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:25,841 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 833 transitions. [2024-10-12 20:32:25,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:32:25,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:25,842 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] [2024-10-12 20:32:25,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 20:32:25,843 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:25,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:25,843 INFO L85 PathProgramCache]: Analyzing trace with hash 556568795, now seen corresponding path program 1 times [2024-10-12 20:32:25,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:25,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625684209] [2024-10-12 20:32:25,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:25,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:26,059 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-12 20:32:26,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:26,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625684209] [2024-10-12 20:32:26,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625684209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:26,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:26,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:26,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270946481] [2024-10-12 20:32:26,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:26,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:26,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:26,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:26,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:26,061 INFO L87 Difference]: Start difference. First operand 634 states and 833 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:26,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:26,849 INFO L93 Difference]: Finished difference Result 1036 states and 1370 transitions. [2024-10-12 20:32:26,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:26,850 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-12 20:32:26,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:26,852 INFO L225 Difference]: With dead ends: 1036 [2024-10-12 20:32:26,852 INFO L226 Difference]: Without dead ends: 954 [2024-10-12 20:32:26,852 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-12 20:32:26,853 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 2582 mSDsluCounter, 2250 mSDsCounter, 0 mSdLazyCounter, 2124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2582 SdHoareTripleChecker+Valid, 2837 SdHoareTripleChecker+Invalid, 2128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:26,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2582 Valid, 2837 Invalid, 2128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2124 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:32:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-12 20:32:26,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 634. [2024-10-12 20:32:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3594771241830066) internal successors, (832), 633 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:26,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 832 transitions. [2024-10-12 20:32:26,859 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 832 transitions. Word has length 94 [2024-10-12 20:32:26,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:26,860 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 832 transitions. [2024-10-12 20:32:26,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:26,860 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 832 transitions. [2024-10-12 20:32:26,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:32:26,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:26,861 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] [2024-10-12 20:32:26,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 20:32:26,861 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:26,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:26,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2039186161, now seen corresponding path program 1 times [2024-10-12 20:32:26,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:26,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887214913] [2024-10-12 20:32:26,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:26,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:27,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-12 20:32:27,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:27,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887214913] [2024-10-12 20:32:27,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887214913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:27,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:27,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:27,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711279027] [2024-10-12 20:32:27,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:27,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:27,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:27,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:27,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:27,049 INFO L87 Difference]: Start difference. First operand 634 states and 832 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:27,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:27,812 INFO L93 Difference]: Finished difference Result 1040 states and 1372 transitions. [2024-10-12 20:32:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:27,813 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-12 20:32:27,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:27,815 INFO L225 Difference]: With dead ends: 1040 [2024-10-12 20:32:27,815 INFO L226 Difference]: Without dead ends: 954 [2024-10-12 20:32:27,815 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-12 20:32:27,816 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 2578 mSDsluCounter, 2250 mSDsCounter, 0 mSdLazyCounter, 2120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2578 SdHoareTripleChecker+Valid, 2837 SdHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:27,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2578 Valid, 2837 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2120 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:32:27,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-12 20:32:27,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 634. [2024-10-12 20:32:27,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.357843137254902) internal successors, (831), 633 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:27,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 831 transitions. [2024-10-12 20:32:27,822 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 831 transitions. Word has length 94 [2024-10-12 20:32:27,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:27,823 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 831 transitions. [2024-10-12 20:32:27,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:27,823 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 831 transitions. [2024-10-12 20:32:27,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:32:27,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:27,834 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] [2024-10-12 20:32:27,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 20:32:27,834 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:27,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:27,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1846935907, now seen corresponding path program 1 times [2024-10-12 20:32:27,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:27,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816805247] [2024-10-12 20:32:27,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:27,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:28,026 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-12 20:32:28,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:28,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816805247] [2024-10-12 20:32:28,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816805247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:28,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:28,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:28,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398454348] [2024-10-12 20:32:28,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:28,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:28,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:28,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:28,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:28,028 INFO L87 Difference]: Start difference. First operand 634 states and 831 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:28,747 INFO L93 Difference]: Finished difference Result 1078 states and 1424 transitions. [2024-10-12 20:32:28,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:28,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-12 20:32:28,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:28,750 INFO L225 Difference]: With dead ends: 1078 [2024-10-12 20:32:28,750 INFO L226 Difference]: Without dead ends: 970 [2024-10-12 20:32:28,750 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-12 20:32:28,751 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 1897 mSDsluCounter, 2039 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 2660 SdHoareTripleChecker+Invalid, 2020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:28,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1897 Valid, 2660 Invalid, 2020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:28,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-10-12 20:32:28,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 634. [2024-10-12 20:32:28,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3562091503267975) internal successors, (830), 633 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 830 transitions. [2024-10-12 20:32:28,757 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 830 transitions. Word has length 94 [2024-10-12 20:32:28,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:28,758 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 830 transitions. [2024-10-12 20:32:28,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:28,758 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 830 transitions. [2024-10-12 20:32:28,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:32:28,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:28,759 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] [2024-10-12 20:32:28,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 20:32:28,759 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:28,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:28,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1204221916, now seen corresponding path program 1 times [2024-10-12 20:32:28,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:28,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330528817] [2024-10-12 20:32:28,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:28,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:28,949 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-12 20:32:28,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:28,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330528817] [2024-10-12 20:32:28,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330528817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:28,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:28,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:28,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20881541] [2024-10-12 20:32:28,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:28,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:28,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:28,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:28,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:28,951 INFO L87 Difference]: Start difference. First operand 634 states and 830 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:29,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:29,709 INFO L93 Difference]: Finished difference Result 1069 states and 1415 transitions. [2024-10-12 20:32:29,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:29,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-12 20:32:29,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:29,712 INFO L225 Difference]: With dead ends: 1069 [2024-10-12 20:32:29,712 INFO L226 Difference]: Without dead ends: 970 [2024-10-12 20:32:29,712 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-12 20:32:29,712 INFO L432 NwaCegarLoop]: 724 mSDtfsCounter, 2489 mSDsluCounter, 2056 mSDsCounter, 0 mSdLazyCounter, 1895 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2489 SdHoareTripleChecker+Valid, 2780 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:29,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2489 Valid, 2780 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1895 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:32:29,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-10-12 20:32:29,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 634. [2024-10-12 20:32:29,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3545751633986929) internal successors, (829), 633 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 829 transitions. [2024-10-12 20:32:29,719 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 829 transitions. Word has length 94 [2024-10-12 20:32:29,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:29,719 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 829 transitions. [2024-10-12 20:32:29,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 829 transitions. [2024-10-12 20:32:29,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:32:29,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:29,720 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] [2024-10-12 20:32:29,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 20:32:29,720 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:29,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:29,721 INFO L85 PathProgramCache]: Analyzing trace with hash -2102424565, now seen corresponding path program 1 times [2024-10-12 20:32:29,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:29,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325370270] [2024-10-12 20:32:29,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:29,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:29,894 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-12 20:32:29,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:29,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325370270] [2024-10-12 20:32:29,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325370270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:29,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:29,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:29,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249039952] [2024-10-12 20:32:29,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:29,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:29,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:29,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:29,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:29,896 INFO L87 Difference]: Start difference. First operand 634 states and 829 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:30,575 INFO L93 Difference]: Finished difference Result 1036 states and 1366 transitions. [2024-10-12 20:32:30,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:32:30,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-12 20:32:30,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:30,578 INFO L225 Difference]: With dead ends: 1036 [2024-10-12 20:32:30,578 INFO L226 Difference]: Without dead ends: 954 [2024-10-12 20:32:30,578 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-12 20:32:30,578 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 1965 mSDsluCounter, 1898 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1965 SdHoareTripleChecker+Valid, 2480 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:30,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1965 Valid, 2480 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:30,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-12 20:32:30,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 634. [2024-10-12 20:32:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3529411764705883) internal successors, (828), 633 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:30,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 828 transitions. [2024-10-12 20:32:30,584 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 828 transitions. Word has length 94 [2024-10-12 20:32:30,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:30,584 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 828 transitions. [2024-10-12 20:32:30,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:30,584 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 828 transitions. [2024-10-12 20:32:30,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:32:30,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:30,585 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] [2024-10-12 20:32:30,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 20:32:30,585 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:30,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:30,586 INFO L85 PathProgramCache]: Analyzing trace with hash -210482352, now seen corresponding path program 1 times [2024-10-12 20:32:30,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:30,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826627075] [2024-10-12 20:32:30,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:30,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:30,753 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-12 20:32:30,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:30,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826627075] [2024-10-12 20:32:30,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826627075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:30,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:30,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:30,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731284234] [2024-10-12 20:32:30,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:30,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:30,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:30,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:30,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:30,755 INFO L87 Difference]: Start difference. First operand 634 states and 828 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:31,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:31,568 INFO L93 Difference]: Finished difference Result 1078 states and 1422 transitions. [2024-10-12 20:32:31,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:32:31,568 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-12 20:32:31,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:31,570 INFO L225 Difference]: With dead ends: 1078 [2024-10-12 20:32:31,570 INFO L226 Difference]: Without dead ends: 970 [2024-10-12 20:32:31,571 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-12 20:32:31,571 INFO L432 NwaCegarLoop]: 811 mSDtfsCounter, 1709 mSDsluCounter, 2706 mSDsCounter, 0 mSdLazyCounter, 2407 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 3517 SdHoareTripleChecker+Invalid, 2410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:31,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1709 Valid, 3517 Invalid, 2410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2407 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:32:31,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-10-12 20:32:31,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 634. [2024-10-12 20:32:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3513071895424837) internal successors, (827), 633 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 827 transitions. [2024-10-12 20:32:31,578 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 827 transitions. Word has length 94 [2024-10-12 20:32:31,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:31,578 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 827 transitions. [2024-10-12 20:32:31,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:31,578 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 827 transitions. [2024-10-12 20:32:31,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:32:31,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:31,579 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] [2024-10-12 20:32:31,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-12 20:32:31,579 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:31,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:31,580 INFO L85 PathProgramCache]: Analyzing trace with hash -619327580, now seen corresponding path program 1 times [2024-10-12 20:32:31,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:31,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980236315] [2024-10-12 20:32:31,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:31,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:31,782 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-12 20:32:31,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:31,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980236315] [2024-10-12 20:32:31,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980236315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:31,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:31,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:31,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251483198] [2024-10-12 20:32:31,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:31,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:31,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:31,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:31,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:31,784 INFO L87 Difference]: Start difference. First operand 634 states and 827 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:32,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:32,648 INFO L93 Difference]: Finished difference Result 1040 states and 1368 transitions. [2024-10-12 20:32:32,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:32,648 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-12 20:32:32,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:32,650 INFO L225 Difference]: With dead ends: 1040 [2024-10-12 20:32:32,650 INFO L226 Difference]: Without dead ends: 954 [2024-10-12 20:32:32,651 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-12 20:32:32,651 INFO L432 NwaCegarLoop]: 793 mSDtfsCounter, 2556 mSDsluCounter, 2620 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2556 SdHoareTripleChecker+Valid, 3413 SdHoareTripleChecker+Invalid, 2380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:32,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2556 Valid, 3413 Invalid, 2380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:32:32,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-12 20:32:32,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 634. [2024-10-12 20:32:32,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3496732026143792) internal successors, (826), 633 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 826 transitions. [2024-10-12 20:32:32,657 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 826 transitions. Word has length 94 [2024-10-12 20:32:32,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:32,657 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 826 transitions. [2024-10-12 20:32:32,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:32,657 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 826 transitions. [2024-10-12 20:32:32,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:32:32,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:32,658 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] [2024-10-12 20:32:32,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-12 20:32:32,658 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:32,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:32,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1484555531, now seen corresponding path program 1 times [2024-10-12 20:32:32,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:32,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322480887] [2024-10-12 20:32:32,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:32,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:32,884 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-12 20:32:32,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:32,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322480887] [2024-10-12 20:32:32,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322480887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:32,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:32,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:32,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976526075] [2024-10-12 20:32:32,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:32,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:32,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:32,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:32,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:32,886 INFO L87 Difference]: Start difference. First operand 634 states and 826 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:33,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:33,743 INFO L93 Difference]: Finished difference Result 1101 states and 1458 transitions. [2024-10-12 20:32:33,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:33,743 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-12 20:32:33,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:33,745 INFO L225 Difference]: With dead ends: 1101 [2024-10-12 20:32:33,745 INFO L226 Difference]: Without dead ends: 978 [2024-10-12 20:32:33,745 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-12 20:32:33,746 INFO L432 NwaCegarLoop]: 812 mSDtfsCounter, 2505 mSDsluCounter, 2772 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2505 SdHoareTripleChecker+Valid, 3584 SdHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:33,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2505 Valid, 3584 Invalid, 2354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:32:33,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-10-12 20:32:33,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 634. [2024-10-12 20:32:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3480392156862746) internal successors, (825), 633 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 825 transitions. [2024-10-12 20:32:33,753 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 825 transitions. Word has length 94 [2024-10-12 20:32:33,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:33,753 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 825 transitions. [2024-10-12 20:32:33,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:33,753 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 825 transitions. [2024-10-12 20:32:33,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:32:33,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:33,754 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] [2024-10-12 20:32:33,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-12 20:32:33,754 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:33,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:33,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1893494246, now seen corresponding path program 1 times [2024-10-12 20:32:33,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:33,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675598230] [2024-10-12 20:32:33,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:33,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:33,930 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-12 20:32:33,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:33,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675598230] [2024-10-12 20:32:33,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675598230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:33,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:33,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:33,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991432278] [2024-10-12 20:32:33,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:33,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:33,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:33,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:33,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:33,932 INFO L87 Difference]: Start difference. First operand 634 states and 825 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:34,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:34,677 INFO L93 Difference]: Finished difference Result 1036 states and 1362 transitions. [2024-10-12 20:32:34,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:34,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-12 20:32:34,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:34,679 INFO L225 Difference]: With dead ends: 1036 [2024-10-12 20:32:34,679 INFO L226 Difference]: Without dead ends: 954 [2024-10-12 20:32:34,680 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-12 20:32:34,680 INFO L432 NwaCegarLoop]: 601 mSDtfsCounter, 1916 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1916 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:34,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1916 Valid, 2553 Invalid, 1987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:34,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-12 20:32:34,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 634. [2024-10-12 20:32:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.34640522875817) internal successors, (824), 633 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 824 transitions. [2024-10-12 20:32:34,687 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 824 transitions. Word has length 94 [2024-10-12 20:32:34,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:34,688 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 824 transitions. [2024-10-12 20:32:34,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:34,688 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 824 transitions. [2024-10-12 20:32:34,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:32:34,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:34,689 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] [2024-10-12 20:32:34,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-12 20:32:34,689 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:34,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:34,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1723188937, now seen corresponding path program 1 times [2024-10-12 20:32:34,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:34,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656970625] [2024-10-12 20:32:34,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:34,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:34,876 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-12 20:32:34,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:34,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656970625] [2024-10-12 20:32:34,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656970625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:34,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:34,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:34,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534880307] [2024-10-12 20:32:34,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:34,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:34,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:34,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:34,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:34,878 INFO L87 Difference]: Start difference. First operand 634 states and 824 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:35,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:35,619 INFO L93 Difference]: Finished difference Result 1034 states and 1358 transitions. [2024-10-12 20:32:35,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:32:35,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-12 20:32:35,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:35,621 INFO L225 Difference]: With dead ends: 1034 [2024-10-12 20:32:35,621 INFO L226 Difference]: Without dead ends: 954 [2024-10-12 20:32:35,622 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-12 20:32:35,622 INFO L432 NwaCegarLoop]: 604 mSDtfsCounter, 2879 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2879 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:35,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2879 Valid, 2568 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1967 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-12 20:32:35,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 634. [2024-10-12 20:32:35,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3447712418300655) internal successors, (823), 633 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:35,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 823 transitions. [2024-10-12 20:32:35,628 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 823 transitions. Word has length 94 [2024-10-12 20:32:35,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:35,628 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 823 transitions. [2024-10-12 20:32:35,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:35,628 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 823 transitions. [2024-10-12 20:32:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:35,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:35,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] [2024-10-12 20:32:35,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-12 20:32:35,629 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:35,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:35,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1766740068, now seen corresponding path program 1 times [2024-10-12 20:32:35,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:35,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964502232] [2024-10-12 20:32:35,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:35,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:35,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:35,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:35,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964502232] [2024-10-12 20:32:35,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964502232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:35,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:35,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:35,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039420758] [2024-10-12 20:32:35,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:35,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:35,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:35,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:35,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:35,822 INFO L87 Difference]: Start difference. First operand 634 states and 823 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:36,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:36,583 INFO L93 Difference]: Finished difference Result 998 states and 1294 transitions. [2024-10-12 20:32:36,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:36,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:36,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:36,585 INFO L225 Difference]: With dead ends: 998 [2024-10-12 20:32:36,585 INFO L226 Difference]: Without dead ends: 922 [2024-10-12 20:32:36,585 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-12 20:32:36,585 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 2650 mSDsluCounter, 1995 mSDsCounter, 0 mSdLazyCounter, 1958 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2650 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:36,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2650 Valid, 2507 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1958 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:32:36,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-10-12 20:32:36,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 634. [2024-10-12 20:32:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3431372549019607) internal successors, (822), 633 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 822 transitions. [2024-10-12 20:32:36,591 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 822 transitions. Word has length 96 [2024-10-12 20:32:36,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:36,591 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 822 transitions. [2024-10-12 20:32:36,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:36,591 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 822 transitions. [2024-10-12 20:32:36,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:36,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:36,592 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] [2024-10-12 20:32:36,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-12 20:32:36,593 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:36,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:36,593 INFO L85 PathProgramCache]: Analyzing trace with hash -854297767, now seen corresponding path program 1 times [2024-10-12 20:32:36,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:36,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543739562] [2024-10-12 20:32:36,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:36,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:36,786 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-12 20:32:36,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:36,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543739562] [2024-10-12 20:32:36,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543739562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:36,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:36,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:36,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720485883] [2024-10-12 20:32:36,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:36,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:36,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:36,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:36,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:36,788 INFO L87 Difference]: Start difference. First operand 634 states and 822 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:37,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:37,639 INFO L93 Difference]: Finished difference Result 1040 states and 1361 transitions. [2024-10-12 20:32:37,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:37,639 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:37,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:37,641 INFO L225 Difference]: With dead ends: 1040 [2024-10-12 20:32:37,641 INFO L226 Difference]: Without dead ends: 954 [2024-10-12 20:32:37,641 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-12 20:32:37,641 INFO L432 NwaCegarLoop]: 788 mSDtfsCounter, 2540 mSDsluCounter, 2608 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2540 SdHoareTripleChecker+Valid, 3396 SdHoareTripleChecker+Invalid, 2355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:37,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2540 Valid, 3396 Invalid, 2355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:32:37,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-12 20:32:37,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 634. [2024-10-12 20:32:37,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.341503267973856) internal successors, (821), 633 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 821 transitions. [2024-10-12 20:32:37,647 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 821 transitions. Word has length 96 [2024-10-12 20:32:37,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:37,647 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 821 transitions. [2024-10-12 20:32:37,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:37,647 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 821 transitions. [2024-10-12 20:32:37,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:37,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:37,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] [2024-10-12 20:32:37,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-12 20:32:37,648 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:37,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:37,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1255893419, now seen corresponding path program 1 times [2024-10-12 20:32:37,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:37,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972482450] [2024-10-12 20:32:37,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:37,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:37,847 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-12 20:32:37,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:37,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972482450] [2024-10-12 20:32:37,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972482450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:37,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:37,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:37,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29457413] [2024-10-12 20:32:37,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:37,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:37,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:37,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:37,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:37,849 INFO L87 Difference]: Start difference. First operand 634 states and 821 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:38,578 INFO L93 Difference]: Finished difference Result 1001 states and 1295 transitions. [2024-10-12 20:32:38,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:38,578 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:38,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:38,580 INFO L225 Difference]: With dead ends: 1001 [2024-10-12 20:32:38,580 INFO L226 Difference]: Without dead ends: 922 [2024-10-12 20:32:38,580 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-12 20:32:38,580 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 2641 mSDsluCounter, 2025 mSDsCounter, 0 mSdLazyCounter, 1963 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2641 SdHoareTripleChecker+Valid, 2550 SdHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:38,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2641 Valid, 2550 Invalid, 1967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1963 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:38,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-10-12 20:32:38,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 634. [2024-10-12 20:32:38,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3398692810457515) internal successors, (820), 633 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 820 transitions. [2024-10-12 20:32:38,586 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 820 transitions. Word has length 96 [2024-10-12 20:32:38,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:38,586 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 820 transitions. [2024-10-12 20:32:38,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:38,586 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 820 transitions. [2024-10-12 20:32:38,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:38,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:38,587 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] [2024-10-12 20:32:38,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-12 20:32:38,587 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:38,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:38,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1126876775, now seen corresponding path program 1 times [2024-10-12 20:32:38,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:38,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450010924] [2024-10-12 20:32:38,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:38,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:38,745 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-12 20:32:38,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:38,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450010924] [2024-10-12 20:32:38,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450010924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:38,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:38,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:38,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400180798] [2024-10-12 20:32:38,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:38,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:38,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:38,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:38,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:38,746 INFO L87 Difference]: Start difference. First operand 634 states and 820 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:39,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:39,436 INFO L93 Difference]: Finished difference Result 1045 states and 1363 transitions. [2024-10-12 20:32:39,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:39,436 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:39,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:39,438 INFO L225 Difference]: With dead ends: 1045 [2024-10-12 20:32:39,438 INFO L226 Difference]: Without dead ends: 954 [2024-10-12 20:32:39,438 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-12 20:32:39,438 INFO L432 NwaCegarLoop]: 601 mSDtfsCounter, 2864 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2864 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:39,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2864 Valid, 2553 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:39,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-12 20:32:39,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 634. [2024-10-12 20:32:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.338235294117647) internal successors, (819), 633 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:39,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 819 transitions. [2024-10-12 20:32:39,443 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 819 transitions. Word has length 96 [2024-10-12 20:32:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:39,444 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 819 transitions. [2024-10-12 20:32:39,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:39,444 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 819 transitions. [2024-10-12 20:32:39,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:39,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:39,444 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] [2024-10-12 20:32:39,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-12 20:32:39,445 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:39,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:39,445 INFO L85 PathProgramCache]: Analyzing trace with hash 443260260, now seen corresponding path program 1 times [2024-10-12 20:32:39,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:39,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369853349] [2024-10-12 20:32:39,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:39,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:39,619 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-12 20:32:39,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:39,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369853349] [2024-10-12 20:32:39,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369853349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:39,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:39,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:39,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836597168] [2024-10-12 20:32:39,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:39,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:39,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:39,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:39,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:39,621 INFO L87 Difference]: Start difference. First operand 634 states and 819 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:40,306 INFO L93 Difference]: Finished difference Result 1001 states and 1293 transitions. [2024-10-12 20:32:40,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:40,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:40,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:40,308 INFO L225 Difference]: With dead ends: 1001 [2024-10-12 20:32:40,308 INFO L226 Difference]: Without dead ends: 922 [2024-10-12 20:32:40,308 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-12 20:32:40,309 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 1850 mSDsluCounter, 2069 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1850 SdHoareTripleChecker+Valid, 2612 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:40,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1850 Valid, 2612 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1969 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:40,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-10-12 20:32:40,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 634. [2024-10-12 20:32:40,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3366013071895424) internal successors, (818), 633 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 818 transitions. [2024-10-12 20:32:40,314 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 818 transitions. Word has length 96 [2024-10-12 20:32:40,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:40,314 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 818 transitions. [2024-10-12 20:32:40,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:40,314 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 818 transitions. [2024-10-12 20:32:40,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:40,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:40,315 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] [2024-10-12 20:32:40,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-12 20:32:40,315 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:40,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:40,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1939509934, now seen corresponding path program 1 times [2024-10-12 20:32:40,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:40,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279991330] [2024-10-12 20:32:40,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:40,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:40,462 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-12 20:32:40,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:40,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279991330] [2024-10-12 20:32:40,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279991330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:40,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:40,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:40,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360464645] [2024-10-12 20:32:40,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:40,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:40,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:40,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:40,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:40,463 INFO L87 Difference]: Start difference. First operand 634 states and 818 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:41,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:41,139 INFO L93 Difference]: Finished difference Result 1045 states and 1360 transitions. [2024-10-12 20:32:41,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:32:41,140 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:41,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:41,141 INFO L225 Difference]: With dead ends: 1045 [2024-10-12 20:32:41,141 INFO L226 Difference]: Without dead ends: 954 [2024-10-12 20:32:41,142 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-12 20:32:41,142 INFO L432 NwaCegarLoop]: 604 mSDtfsCounter, 2858 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 1933 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2858 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:41,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2858 Valid, 2568 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1933 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:41,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-12 20:32:41,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 634. [2024-10-12 20:32:41,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3349673202614378) internal successors, (817), 633 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:41,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 817 transitions. [2024-10-12 20:32:41,147 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 817 transitions. Word has length 96 [2024-10-12 20:32:41,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:41,147 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 817 transitions. [2024-10-12 20:32:41,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:41,147 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 817 transitions. [2024-10-12 20:32:41,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:41,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:41,148 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] [2024-10-12 20:32:41,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-12 20:32:41,148 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:41,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:41,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1544761606, now seen corresponding path program 1 times [2024-10-12 20:32:41,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:41,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090430539] [2024-10-12 20:32:41,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:41,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:41,310 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-12 20:32:41,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:41,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090430539] [2024-10-12 20:32:41,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090430539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:41,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:41,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:41,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460787851] [2024-10-12 20:32:41,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:41,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:41,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:41,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:41,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:41,312 INFO L87 Difference]: Start difference. First operand 634 states and 817 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:42,020 INFO L93 Difference]: Finished difference Result 1084 states and 1412 transitions. [2024-10-12 20:32:42,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:42,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:42,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:42,022 INFO L225 Difference]: With dead ends: 1084 [2024-10-12 20:32:42,022 INFO L226 Difference]: Without dead ends: 970 [2024-10-12 20:32:42,022 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-12 20:32:42,023 INFO L432 NwaCegarLoop]: 656 mSDtfsCounter, 1800 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 2059 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1800 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 2063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:42,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1800 Valid, 2800 Invalid, 2063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2059 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:42,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-10-12 20:32:42,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 634. [2024-10-12 20:32:42,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3333333333333333) internal successors, (816), 633 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:42,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 816 transitions. [2024-10-12 20:32:42,028 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 816 transitions. Word has length 96 [2024-10-12 20:32:42,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:42,028 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 816 transitions. [2024-10-12 20:32:42,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:42,029 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 816 transitions. [2024-10-12 20:32:42,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:42,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:42,029 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] [2024-10-12 20:32:42,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-12 20:32:42,029 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:42,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:42,030 INFO L85 PathProgramCache]: Analyzing trace with hash -52113932, now seen corresponding path program 1 times [2024-10-12 20:32:42,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:42,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295725948] [2024-10-12 20:32:42,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:42,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:42,167 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-12 20:32:42,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:42,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295725948] [2024-10-12 20:32:42,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295725948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:42,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:42,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:42,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168439144] [2024-10-12 20:32:42,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:42,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:42,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:42,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:42,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:42,168 INFO L87 Difference]: Start difference. First operand 634 states and 816 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:42,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:42,829 INFO L93 Difference]: Finished difference Result 996 states and 1285 transitions. [2024-10-12 20:32:42,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:32:42,829 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:42,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:42,830 INFO L225 Difference]: With dead ends: 996 [2024-10-12 20:32:42,830 INFO L226 Difference]: Without dead ends: 922 [2024-10-12 20:32:42,831 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-12 20:32:42,831 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 2874 mSDsluCounter, 1806 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2874 SdHoareTripleChecker+Valid, 2379 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:42,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2874 Valid, 2379 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:42,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-10-12 20:32:42,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 634. [2024-10-12 20:32:42,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3316993464052287) internal successors, (815), 633 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:42,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 815 transitions. [2024-10-12 20:32:42,836 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 815 transitions. Word has length 96 [2024-10-12 20:32:42,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:42,836 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 815 transitions. [2024-10-12 20:32:42,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:42,836 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 815 transitions. [2024-10-12 20:32:42,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:42,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:42,837 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] [2024-10-12 20:32:42,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-12 20:32:42,837 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:42,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:42,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1952926503, now seen corresponding path program 1 times [2024-10-12 20:32:42,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:42,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368027927] [2024-10-12 20:32:42,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:42,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:42,990 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-12 20:32:42,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:42,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368027927] [2024-10-12 20:32:42,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368027927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:42,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:42,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:42,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44887953] [2024-10-12 20:32:42,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:42,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:42,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:42,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:42,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:42,992 INFO L87 Difference]: Start difference. First operand 634 states and 815 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:43,620 INFO L93 Difference]: Finished difference Result 998 states and 1286 transitions. [2024-10-12 20:32:43,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:43,621 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:43,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:43,622 INFO L225 Difference]: With dead ends: 998 [2024-10-12 20:32:43,622 INFO L226 Difference]: Without dead ends: 922 [2024-10-12 20:32:43,622 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-12 20:32:43,623 INFO L432 NwaCegarLoop]: 520 mSDtfsCounter, 3065 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3065 SdHoareTripleChecker+Valid, 2166 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:43,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3065 Valid, 2166 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:32:43,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-10-12 20:32:43,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 634. [2024-10-12 20:32:43,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3300653594771241) internal successors, (814), 633 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:43,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 814 transitions. [2024-10-12 20:32:43,628 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 814 transitions. Word has length 96 [2024-10-12 20:32:43,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:43,628 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 814 transitions. [2024-10-12 20:32:43,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:43,628 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 814 transitions. [2024-10-12 20:32:43,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:43,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:43,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] [2024-10-12 20:32:43,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-12 20:32:43,629 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:43,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:43,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1693346717, now seen corresponding path program 1 times [2024-10-12 20:32:43,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:43,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603304075] [2024-10-12 20:32:43,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:43,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:43,776 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-12 20:32:43,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:43,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603304075] [2024-10-12 20:32:43,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603304075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:43,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:43,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:43,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195451280] [2024-10-12 20:32:43,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:43,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:43,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:43,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:43,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:43,778 INFO L87 Difference]: Start difference. First operand 634 states and 814 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:44,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:44,403 INFO L93 Difference]: Finished difference Result 998 states and 1284 transitions. [2024-10-12 20:32:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:32:44,403 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:44,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:44,405 INFO L225 Difference]: With dead ends: 998 [2024-10-12 20:32:44,405 INFO L226 Difference]: Without dead ends: 922 [2024-10-12 20:32:44,405 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-12 20:32:44,405 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 3062 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3062 SdHoareTripleChecker+Valid, 2181 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:44,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3062 Valid, 2181 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1704 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:32:44,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-10-12 20:32:44,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 634. [2024-10-12 20:32:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3284313725490196) internal successors, (813), 633 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 813 transitions. [2024-10-12 20:32:44,410 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 813 transitions. Word has length 96 [2024-10-12 20:32:44,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:44,411 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 813 transitions. [2024-10-12 20:32:44,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:44,411 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 813 transitions. [2024-10-12 20:32:44,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:44,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:44,412 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] [2024-10-12 20:32:44,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-12 20:32:44,419 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:44,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:44,419 INFO L85 PathProgramCache]: Analyzing trace with hash -927310799, now seen corresponding path program 1 times [2024-10-12 20:32:44,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:44,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365229019] [2024-10-12 20:32:44,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:44,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:44,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-12 20:32:44,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:44,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365229019] [2024-10-12 20:32:44,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365229019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:44,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:44,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:32:44,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125767962] [2024-10-12 20:32:44,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:44,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:32:44,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:44,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:32:44,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:32:44,688 INFO L87 Difference]: Start difference. First operand 634 states and 813 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:45,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:45,742 INFO L93 Difference]: Finished difference Result 1262 states and 1674 transitions. [2024-10-12 20:32:45,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 20:32:45,742 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:45,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:45,744 INFO L225 Difference]: With dead ends: 1262 [2024-10-12 20:32:45,744 INFO L226 Difference]: Without dead ends: 1176 [2024-10-12 20:32:45,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-12 20:32:45,745 INFO L432 NwaCegarLoop]: 642 mSDtfsCounter, 5680 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 2134 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5680 SdHoareTripleChecker+Valid, 2824 SdHoareTripleChecker+Invalid, 2333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 2134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:45,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5680 Valid, 2824 Invalid, 2333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 2134 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:32:45,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2024-10-12 20:32:45,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 638. [2024-10-12 20:32:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3262987012987013) internal successors, (817), 637 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 817 transitions. [2024-10-12 20:32:45,750 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 817 transitions. Word has length 96 [2024-10-12 20:32:45,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:45,750 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 817 transitions. [2024-10-12 20:32:45,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 817 transitions. [2024-10-12 20:32:45,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:45,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:45,751 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] [2024-10-12 20:32:45,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-12 20:32:45,751 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:45,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:45,752 INFO L85 PathProgramCache]: Analyzing trace with hash -375995292, now seen corresponding path program 1 times [2024-10-12 20:32:45,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:45,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475022915] [2024-10-12 20:32:45,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:45,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:45,949 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-12 20:32:45,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:45,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475022915] [2024-10-12 20:32:45,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475022915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:45,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:45,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:45,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100046414] [2024-10-12 20:32:45,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:45,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:45,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:45,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:45,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:45,951 INFO L87 Difference]: Start difference. First operand 638 states and 817 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:46,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:46,647 INFO L93 Difference]: Finished difference Result 931 states and 1179 transitions. [2024-10-12 20:32:46,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:46,647 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:46,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:46,648 INFO L225 Difference]: With dead ends: 931 [2024-10-12 20:32:46,649 INFO L226 Difference]: Without dead ends: 926 [2024-10-12 20:32:46,649 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-12 20:32:46,649 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 2612 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 1966 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2612 SdHoareTripleChecker+Valid, 2661 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:46,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2612 Valid, 2661 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1966 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:46,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-12 20:32:46,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 638. [2024-10-12 20:32:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3246753246753247) internal successors, (816), 637 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:46,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 816 transitions. [2024-10-12 20:32:46,655 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 816 transitions. Word has length 96 [2024-10-12 20:32:46,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:46,655 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 816 transitions. [2024-10-12 20:32:46,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:46,655 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 816 transitions. [2024-10-12 20:32:46,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:46,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:46,656 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] [2024-10-12 20:32:46,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-12 20:32:46,656 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:46,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:46,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1536201810, now seen corresponding path program 1 times [2024-10-12 20:32:46,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:46,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666642313] [2024-10-12 20:32:46,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:46,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:46,807 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-12 20:32:46,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:46,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666642313] [2024-10-12 20:32:46,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666642313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:46,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:46,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:46,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169544710] [2024-10-12 20:32:46,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:46,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:46,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:46,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:46,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:46,809 INFO L87 Difference]: Start difference. First operand 638 states and 816 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:47,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:47,452 INFO L93 Difference]: Finished difference Result 971 states and 1240 transitions. [2024-10-12 20:32:47,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:32:47,452 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:47,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:47,453 INFO L225 Difference]: With dead ends: 971 [2024-10-12 20:32:47,453 INFO L226 Difference]: Without dead ends: 954 [2024-10-12 20:32:47,453 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-12 20:32:47,454 INFO L432 NwaCegarLoop]: 729 mSDtfsCounter, 2469 mSDsluCounter, 2062 mSDsCounter, 0 mSdLazyCounter, 1847 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2469 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 1851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:47,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2469 Valid, 2791 Invalid, 1851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1847 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:47,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-12 20:32:47,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 638. [2024-10-12 20:32:47,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.323051948051948) internal successors, (815), 637 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 815 transitions. [2024-10-12 20:32:47,458 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 815 transitions. Word has length 96 [2024-10-12 20:32:47,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:47,459 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 815 transitions. [2024-10-12 20:32:47,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:47,459 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 815 transitions. [2024-10-12 20:32:47,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:47,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:47,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] [2024-10-12 20:32:47,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-12 20:32:47,460 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:47,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:47,460 INFO L85 PathProgramCache]: Analyzing trace with hash 134588212, now seen corresponding path program 1 times [2024-10-12 20:32:47,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:47,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842471098] [2024-10-12 20:32:47,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:47,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:47,623 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-12 20:32:47,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:47,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842471098] [2024-10-12 20:32:47,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842471098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:47,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:47,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:47,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704568144] [2024-10-12 20:32:47,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:47,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:47,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:47,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:47,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:47,625 INFO L87 Difference]: Start difference. First operand 638 states and 815 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:48,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:48,368 INFO L93 Difference]: Finished difference Result 1002 states and 1285 transitions. [2024-10-12 20:32:48,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:48,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:48,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:48,369 INFO L225 Difference]: With dead ends: 1002 [2024-10-12 20:32:48,369 INFO L226 Difference]: Without dead ends: 926 [2024-10-12 20:32:48,370 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-12 20:32:48,370 INFO L432 NwaCegarLoop]: 574 mSDtfsCounter, 2605 mSDsluCounter, 2139 mSDsCounter, 0 mSdLazyCounter, 1978 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2605 SdHoareTripleChecker+Valid, 2713 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:48,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2605 Valid, 2713 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1978 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:32:48,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-12 20:32:48,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 638. [2024-10-12 20:32:48,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3214285714285714) internal successors, (814), 637 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 814 transitions. [2024-10-12 20:32:48,376 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 814 transitions. Word has length 96 [2024-10-12 20:32:48,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:48,376 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 814 transitions. [2024-10-12 20:32:48,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:48,376 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 814 transitions. [2024-10-12 20:32:48,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:48,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:48,377 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] [2024-10-12 20:32:48,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-12 20:32:48,377 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:48,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:48,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1131131867, now seen corresponding path program 1 times [2024-10-12 20:32:48,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:48,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197613567] [2024-10-12 20:32:48,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:48,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:48,671 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-12 20:32:48,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:48,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197613567] [2024-10-12 20:32:48,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197613567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:48,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:48,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:32:48,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233222736] [2024-10-12 20:32:48,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:48,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:32:48,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:48,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:32:48,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:32:48,673 INFO L87 Difference]: Start difference. First operand 638 states and 814 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:49,734 INFO L93 Difference]: Finished difference Result 1113 states and 1442 transitions. [2024-10-12 20:32:49,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 20:32:49,734 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:49,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:49,736 INFO L225 Difference]: With dead ends: 1113 [2024-10-12 20:32:49,736 INFO L226 Difference]: Without dead ends: 1108 [2024-10-12 20:32:49,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-12 20:32:49,737 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 6006 mSDsluCounter, 2078 mSDsCounter, 0 mSdLazyCounter, 2139 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6006 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 2362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 2139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:49,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6006 Valid, 2605 Invalid, 2362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 2139 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:32:49,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2024-10-12 20:32:49,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 642. [2024-10-12 20:32:49,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3193548387096774) internal successors, (818), 641 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 818 transitions. [2024-10-12 20:32:49,742 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 818 transitions. Word has length 96 [2024-10-12 20:32:49,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:49,742 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 818 transitions. [2024-10-12 20:32:49,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:49,742 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 818 transitions. [2024-10-12 20:32:49,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:49,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:49,743 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] [2024-10-12 20:32:49,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-12 20:32:49,743 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:49,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:49,743 INFO L85 PathProgramCache]: Analyzing trace with hash -253459324, now seen corresponding path program 1 times [2024-10-12 20:32:49,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:49,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148053627] [2024-10-12 20:32:49,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:49,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:49,883 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-12 20:32:49,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:49,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148053627] [2024-10-12 20:32:49,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148053627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:49,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:49,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:49,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22994683] [2024-10-12 20:32:49,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:49,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:49,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:49,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:49,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:49,884 INFO L87 Difference]: Start difference. First operand 642 states and 818 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:50,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:50,606 INFO L93 Difference]: Finished difference Result 1044 states and 1347 transitions. [2024-10-12 20:32:50,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:50,606 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:50,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:50,607 INFO L225 Difference]: With dead ends: 1044 [2024-10-12 20:32:50,607 INFO L226 Difference]: Without dead ends: 958 [2024-10-12 20:32:50,608 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-12 20:32:50,608 INFO L432 NwaCegarLoop]: 687 mSDtfsCounter, 2546 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 2121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2546 SdHoareTripleChecker+Valid, 2895 SdHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:50,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2546 Valid, 2895 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2121 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:50,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-12 20:32:50,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 642. [2024-10-12 20:32:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3177419354838709) internal successors, (817), 641 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:50,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 817 transitions. [2024-10-12 20:32:50,612 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 817 transitions. Word has length 96 [2024-10-12 20:32:50,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:50,613 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 817 transitions. [2024-10-12 20:32:50,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:50,613 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 817 transitions. [2024-10-12 20:32:50,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:50,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:50,613 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] [2024-10-12 20:32:50,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-12 20:32:50,614 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:50,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:50,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1928248723, now seen corresponding path program 1 times [2024-10-12 20:32:50,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:50,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656902005] [2024-10-12 20:32:50,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:50,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:50,772 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-12 20:32:50,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:50,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656902005] [2024-10-12 20:32:50,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656902005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:50,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:50,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:50,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324022094] [2024-10-12 20:32:50,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:50,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:50,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:50,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:50,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:50,774 INFO L87 Difference]: Start difference. First operand 642 states and 817 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:51,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:51,455 INFO L93 Difference]: Finished difference Result 1002 states and 1282 transitions. [2024-10-12 20:32:51,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:51,455 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:51,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:51,457 INFO L225 Difference]: With dead ends: 1002 [2024-10-12 20:32:51,457 INFO L226 Difference]: Without dead ends: 926 [2024-10-12 20:32:51,457 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-12 20:32:51,457 INFO L432 NwaCegarLoop]: 678 mSDtfsCounter, 1823 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 1960 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1823 SdHoareTripleChecker+Valid, 2776 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:51,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1823 Valid, 2776 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1960 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:51,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-12 20:32:51,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 642. [2024-10-12 20:32:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3161290322580645) internal successors, (816), 641 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 816 transitions. [2024-10-12 20:32:51,462 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 816 transitions. Word has length 96 [2024-10-12 20:32:51,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:51,463 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 816 transitions. [2024-10-12 20:32:51,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:51,463 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 816 transitions. [2024-10-12 20:32:51,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:51,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:51,464 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] [2024-10-12 20:32:51,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-10-12 20:32:51,464 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:51,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:51,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1279554647, now seen corresponding path program 1 times [2024-10-12 20:32:51,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:51,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920567484] [2024-10-12 20:32:51,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:51,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:51,615 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-12 20:32:51,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:51,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920567484] [2024-10-12 20:32:51,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920567484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:51,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:51,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:51,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292076794] [2024-10-12 20:32:51,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:51,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:51,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:51,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:51,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:51,617 INFO L87 Difference]: Start difference. First operand 642 states and 816 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:52,264 INFO L93 Difference]: Finished difference Result 1002 states and 1281 transitions. [2024-10-12 20:32:52,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:52,264 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:52,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:52,266 INFO L225 Difference]: With dead ends: 1002 [2024-10-12 20:32:52,266 INFO L226 Difference]: Without dead ends: 926 [2024-10-12 20:32:52,267 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-12 20:32:52,267 INFO L432 NwaCegarLoop]: 536 mSDtfsCounter, 2984 mSDsluCounter, 1693 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2984 SdHoareTripleChecker+Valid, 2229 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:52,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2984 Valid, 2229 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:52,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-12 20:32:52,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 642. [2024-10-12 20:32:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.314516129032258) internal successors, (815), 641 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 815 transitions. [2024-10-12 20:32:52,272 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 815 transitions. Word has length 96 [2024-10-12 20:32:52,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:52,272 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 815 transitions. [2024-10-12 20:32:52,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:52,272 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 815 transitions. [2024-10-12 20:32:52,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:52,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:52,273 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] [2024-10-12 20:32:52,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-10-12 20:32:52,273 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:52,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:52,274 INFO L85 PathProgramCache]: Analyzing trace with hash 297856183, now seen corresponding path program 1 times [2024-10-12 20:32:52,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:52,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535701701] [2024-10-12 20:32:52,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:52,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:52,455 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-12 20:32:52,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:52,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535701701] [2024-10-12 20:32:52,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535701701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:52,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:52,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:52,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561660158] [2024-10-12 20:32:52,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:52,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:52,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:52,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:52,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:52,457 INFO L87 Difference]: Start difference. First operand 642 states and 815 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:53,170 INFO L93 Difference]: Finished difference Result 1005 states and 1282 transitions. [2024-10-12 20:32:53,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:53,170 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:53,171 INFO L225 Difference]: With dead ends: 1005 [2024-10-12 20:32:53,171 INFO L226 Difference]: Without dead ends: 926 [2024-10-12 20:32:53,172 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-12 20:32:53,172 INFO L432 NwaCegarLoop]: 580 mSDtfsCounter, 2590 mSDsluCounter, 2157 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2590 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:53,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2590 Valid, 2737 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1964 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:53,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-12 20:32:53,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 642. [2024-10-12 20:32:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3129032258064517) internal successors, (814), 641 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 814 transitions. [2024-10-12 20:32:53,177 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 814 transitions. Word has length 96 [2024-10-12 20:32:53,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:53,178 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 814 transitions. [2024-10-12 20:32:53,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 814 transitions. [2024-10-12 20:32:53,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:53,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:53,178 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] [2024-10-12 20:32:53,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-10-12 20:32:53,179 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:53,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:53,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2084914011, now seen corresponding path program 1 times [2024-10-12 20:32:53,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:53,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051066815] [2024-10-12 20:32:53,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:53,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:53,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:53,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:53,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051066815] [2024-10-12 20:32:53,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051066815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:53,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:53,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:53,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695196902] [2024-10-12 20:32:53,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:53,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:53,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:53,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:53,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:53,346 INFO L87 Difference]: Start difference. First operand 642 states and 814 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:54,024 INFO L93 Difference]: Finished difference Result 1049 states and 1345 transitions. [2024-10-12 20:32:54,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:54,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:54,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:54,026 INFO L225 Difference]: With dead ends: 1049 [2024-10-12 20:32:54,026 INFO L226 Difference]: Without dead ends: 958 [2024-10-12 20:32:54,026 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-12 20:32:54,027 INFO L432 NwaCegarLoop]: 636 mSDtfsCounter, 1828 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 1901 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1828 SdHoareTripleChecker+Valid, 2693 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:54,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1828 Valid, 2693 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1901 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:54,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-12 20:32:54,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 642. [2024-10-12 20:32:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3112903225806452) internal successors, (813), 641 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:54,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 813 transitions. [2024-10-12 20:32:54,031 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 813 transitions. Word has length 96 [2024-10-12 20:32:54,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:54,032 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 813 transitions. [2024-10-12 20:32:54,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:54,032 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 813 transitions. [2024-10-12 20:32:54,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:54,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:54,033 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] [2024-10-12 20:32:54,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-10-12 20:32:54,033 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:54,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:54,033 INFO L85 PathProgramCache]: Analyzing trace with hash 807960068, now seen corresponding path program 1 times [2024-10-12 20:32:54,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:54,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800618599] [2024-10-12 20:32:54,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:54,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:54,183 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-12 20:32:54,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:54,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800618599] [2024-10-12 20:32:54,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800618599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:54,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:54,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:54,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006138616] [2024-10-12 20:32:54,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:54,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:54,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:54,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:54,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:54,185 INFO L87 Difference]: Start difference. First operand 642 states and 813 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:54,858 INFO L93 Difference]: Finished difference Result 1002 states and 1277 transitions. [2024-10-12 20:32:54,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:32:54,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:54,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:54,859 INFO L225 Difference]: With dead ends: 1002 [2024-10-12 20:32:54,859 INFO L226 Difference]: Without dead ends: 926 [2024-10-12 20:32:54,860 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-12 20:32:54,860 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 2748 mSDsluCounter, 1887 mSDsCounter, 0 mSdLazyCounter, 1915 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2748 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:54,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2748 Valid, 2487 Invalid, 1918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1915 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:54,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-12 20:32:54,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 642. [2024-10-12 20:32:54,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3096774193548386) internal successors, (812), 641 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:54,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 812 transitions. [2024-10-12 20:32:54,865 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 812 transitions. Word has length 96 [2024-10-12 20:32:54,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:54,865 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 812 transitions. [2024-10-12 20:32:54,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:54,865 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 812 transitions. [2024-10-12 20:32:54,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:54,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:54,866 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] [2024-10-12 20:32:54,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-10-12 20:32:54,866 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:54,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:54,867 INFO L85 PathProgramCache]: Analyzing trace with hash -457280392, now seen corresponding path program 1 times [2024-10-12 20:32:54,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:54,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611341562] [2024-10-12 20:32:54,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:54,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:55,028 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-12 20:32:55,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:55,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611341562] [2024-10-12 20:32:55,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611341562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:55,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:55,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:55,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808458107] [2024-10-12 20:32:55,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:55,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:55,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:55,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:55,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:55,030 INFO L87 Difference]: Start difference. First operand 642 states and 812 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:55,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:55,660 INFO L93 Difference]: Finished difference Result 1005 states and 1279 transitions. [2024-10-12 20:32:55,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:55,661 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:55,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:55,661 INFO L225 Difference]: With dead ends: 1005 [2024-10-12 20:32:55,661 INFO L226 Difference]: Without dead ends: 926 [2024-10-12 20:32:55,662 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-12 20:32:55,662 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 2931 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2931 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:55,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2931 Valid, 2290 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:32:55,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-12 20:32:55,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 642. [2024-10-12 20:32:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3080645161290323) internal successors, (811), 641 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 811 transitions. [2024-10-12 20:32:55,666 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 811 transitions. Word has length 96 [2024-10-12 20:32:55,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:55,667 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 811 transitions. [2024-10-12 20:32:55,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 811 transitions. [2024-10-12 20:32:55,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:55,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:55,667 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] [2024-10-12 20:32:55,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-10-12 20:32:55,667 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:55,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:55,668 INFO L85 PathProgramCache]: Analyzing trace with hash -919090496, now seen corresponding path program 1 times [2024-10-12 20:32:55,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:55,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497845489] [2024-10-12 20:32:55,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:55,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:55,804 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-12 20:32:55,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:55,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497845489] [2024-10-12 20:32:55,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497845489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:55,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:55,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:55,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815817359] [2024-10-12 20:32:55,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:55,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:55,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:55,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:55,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:55,805 INFO L87 Difference]: Start difference. First operand 642 states and 811 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:56,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:56,464 INFO L93 Difference]: Finished difference Result 1000 states and 1272 transitions. [2024-10-12 20:32:56,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:32:56,465 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:56,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:56,466 INFO L225 Difference]: With dead ends: 1000 [2024-10-12 20:32:56,466 INFO L226 Difference]: Without dead ends: 926 [2024-10-12 20:32:56,466 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-12 20:32:56,466 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 1878 mSDsluCounter, 1935 mSDsCounter, 0 mSdLazyCounter, 1902 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1878 SdHoareTripleChecker+Valid, 2551 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:56,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1878 Valid, 2551 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1902 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:56,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-12 20:32:56,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 642. [2024-10-12 20:32:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3064516129032258) internal successors, (810), 641 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:56,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 810 transitions. [2024-10-12 20:32:56,471 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 810 transitions. Word has length 96 [2024-10-12 20:32:56,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:56,471 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 810 transitions. [2024-10-12 20:32:56,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:56,471 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 810 transitions. [2024-10-12 20:32:56,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:56,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:56,472 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] [2024-10-12 20:32:56,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-10-12 20:32:56,472 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:56,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:56,473 INFO L85 PathProgramCache]: Analyzing trace with hash -599186684, now seen corresponding path program 1 times [2024-10-12 20:32:56,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:56,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155288078] [2024-10-12 20:32:56,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:56,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:56,639 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-12 20:32:56,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:56,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155288078] [2024-10-12 20:32:56,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155288078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:56,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:56,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:56,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995844461] [2024-10-12 20:32:56,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:56,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:56,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:56,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:56,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:56,641 INFO L87 Difference]: Start difference. First operand 642 states and 810 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:57,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:57,257 INFO L93 Difference]: Finished difference Result 1002 states and 1273 transitions. [2024-10-12 20:32:57,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:32:57,258 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:57,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:57,259 INFO L225 Difference]: With dead ends: 1002 [2024-10-12 20:32:57,259 INFO L226 Difference]: Without dead ends: 926 [2024-10-12 20:32:57,259 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-12 20:32:57,260 INFO L432 NwaCegarLoop]: 700 mSDtfsCounter, 2535 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2535 SdHoareTripleChecker+Valid, 2643 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:57,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2535 Valid, 2643 Invalid, 1801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:57,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-12 20:32:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 642. [2024-10-12 20:32:57,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3048387096774194) internal successors, (809), 641 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:57,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 809 transitions. [2024-10-12 20:32:57,265 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 809 transitions. Word has length 96 [2024-10-12 20:32:57,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:57,265 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 809 transitions. [2024-10-12 20:32:57,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:57,266 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 809 transitions. [2024-10-12 20:32:57,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:57,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:57,267 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] [2024-10-12 20:32:57,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-10-12 20:32:57,267 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:57,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:57,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1068299218, now seen corresponding path program 1 times [2024-10-12 20:32:57,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:57,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358869602] [2024-10-12 20:32:57,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:57,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:57,425 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-12 20:32:57,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:57,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358869602] [2024-10-12 20:32:57,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358869602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:57,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:57,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:57,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791359364] [2024-10-12 20:32:57,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:57,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:57,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:57,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:57,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:57,427 INFO L87 Difference]: Start difference. First operand 642 states and 809 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:58,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:58,180 INFO L93 Difference]: Finished difference Result 1000 states and 1269 transitions. [2024-10-12 20:32:58,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:58,180 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:58,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:58,181 INFO L225 Difference]: With dead ends: 1000 [2024-10-12 20:32:58,181 INFO L226 Difference]: Without dead ends: 926 [2024-10-12 20:32:58,181 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-12 20:32:58,181 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 1984 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 1712 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1984 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:58,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1984 Valid, 2281 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1712 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:32:58,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-12 20:32:58,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 642. [2024-10-12 20:32:58,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.303225806451613) internal successors, (808), 641 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 808 transitions. [2024-10-12 20:32:58,186 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 808 transitions. Word has length 96 [2024-10-12 20:32:58,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:58,186 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 808 transitions. [2024-10-12 20:32:58,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 808 transitions. [2024-10-12 20:32:58,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:58,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:58,188 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] [2024-10-12 20:32:58,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-10-12 20:32:58,188 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:58,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:58,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1873206628, now seen corresponding path program 1 times [2024-10-12 20:32:58,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:58,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21289008] [2024-10-12 20:32:58,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:58,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:58,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-12 20:32:58,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:58,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21289008] [2024-10-12 20:32:58,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21289008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:58,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:58,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:58,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133793205] [2024-10-12 20:32:58,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:58,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:58,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:58,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:58,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:58,355 INFO L87 Difference]: Start difference. First operand 642 states and 808 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:58,967 INFO L93 Difference]: Finished difference Result 1002 states and 1269 transitions. [2024-10-12 20:32:58,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:58,967 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:32:58,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:58,968 INFO L225 Difference]: With dead ends: 1002 [2024-10-12 20:32:58,969 INFO L226 Difference]: Without dead ends: 926 [2024-10-12 20:32:58,969 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-12 20:32:58,969 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 2530 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2530 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:58,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2530 Valid, 2351 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:32:58,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-12 20:32:58,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 642. [2024-10-12 20:32:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3016129032258064) internal successors, (807), 641 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 807 transitions. [2024-10-12 20:32:58,974 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 807 transitions. Word has length 96 [2024-10-12 20:32:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:58,974 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 807 transitions. [2024-10-12 20:32:58,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 807 transitions. [2024-10-12 20:32:58,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:32:58,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:58,975 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] [2024-10-12 20:32:58,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-10-12 20:32:58,976 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:32:58,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:58,976 INFO L85 PathProgramCache]: Analyzing trace with hash -746754795, now seen corresponding path program 1 times [2024-10-12 20:32:58,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:58,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762550915] [2024-10-12 20:32:58,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:58,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:59,236 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-12 20:32:59,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:59,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762550915] [2024-10-12 20:32:59,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762550915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:59,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:59,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:32:59,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493877251] [2024-10-12 20:32:59,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:59,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:32:59,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:59,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:32:59,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:32:59,238 INFO L87 Difference]: Start difference. First operand 642 states and 807 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:00,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:00,249 INFO L93 Difference]: Finished difference Result 1266 states and 1654 transitions. [2024-10-12 20:33:00,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 20:33:00,249 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:33:00,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:00,250 INFO L225 Difference]: With dead ends: 1266 [2024-10-12 20:33:00,250 INFO L226 Difference]: Without dead ends: 1180 [2024-10-12 20:33:00,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-12 20:33:00,251 INFO L432 NwaCegarLoop]: 622 mSDtfsCounter, 5662 mSDsluCounter, 2138 mSDsCounter, 0 mSdLazyCounter, 2003 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5662 SdHoareTripleChecker+Valid, 2760 SdHoareTripleChecker+Invalid, 2199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 2003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:00,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5662 Valid, 2760 Invalid, 2199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 2003 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:33:00,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2024-10-12 20:33:00,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 646. [2024-10-12 20:33:00,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 624 states have (on average 1.2996794871794872) internal successors, (811), 645 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 811 transitions. [2024-10-12 20:33:00,256 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 811 transitions. Word has length 96 [2024-10-12 20:33:00,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:00,256 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 811 transitions. [2024-10-12 20:33:00,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:00,256 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 811 transitions. [2024-10-12 20:33:00,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:33:00,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:00,257 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] [2024-10-12 20:33:00,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-10-12 20:33:00,257 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:33:00,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:00,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1773066592, now seen corresponding path program 1 times [2024-10-12 20:33:00,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:00,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37989309] [2024-10-12 20:33:00,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:00,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:00,401 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-12 20:33:00,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:00,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37989309] [2024-10-12 20:33:00,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37989309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:00,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:00,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:00,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996892189] [2024-10-12 20:33:00,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:00,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:00,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:00,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:00,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:00,403 INFO L87 Difference]: Start difference. First operand 646 states and 811 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:01,019 INFO L93 Difference]: Finished difference Result 1006 states and 1272 transitions. [2024-10-12 20:33:01,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:33:01,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:33:01,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:01,021 INFO L225 Difference]: With dead ends: 1006 [2024-10-12 20:33:01,021 INFO L226 Difference]: Without dead ends: 930 [2024-10-12 20:33:01,021 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-12 20:33:01,022 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 1979 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1979 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:01,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1979 Valid, 2290 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:33:01,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2024-10-12 20:33:01,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 646. [2024-10-12 20:33:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 624 states have (on average 1.2980769230769231) internal successors, (810), 645 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 810 transitions. [2024-10-12 20:33:01,027 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 810 transitions. Word has length 96 [2024-10-12 20:33:01,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:01,027 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 810 transitions. [2024-10-12 20:33:01,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:01,027 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 810 transitions. [2024-10-12 20:33:01,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:33:01,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:01,028 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] [2024-10-12 20:33:01,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-10-12 20:33:01,028 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:33:01,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:01,029 INFO L85 PathProgramCache]: Analyzing trace with hash 865275896, now seen corresponding path program 1 times [2024-10-12 20:33:01,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:01,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743061225] [2024-10-12 20:33:01,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:01,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:01,202 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-12 20:33:01,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:01,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743061225] [2024-10-12 20:33:01,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743061225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:01,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:01,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:01,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268688892] [2024-10-12 20:33:01,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:01,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:01,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:01,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:01,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:01,203 INFO L87 Difference]: Start difference. First operand 646 states and 810 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:01,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:01,895 INFO L93 Difference]: Finished difference Result 1004 states and 1268 transitions. [2024-10-12 20:33:01,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:33:01,895 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:33:01,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:01,896 INFO L225 Difference]: With dead ends: 1004 [2024-10-12 20:33:01,896 INFO L226 Difference]: Without dead ends: 930 [2024-10-12 20:33:01,896 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-12 20:33:01,897 INFO L432 NwaCegarLoop]: 592 mSDtfsCounter, 2563 mSDsluCounter, 2193 mSDsCounter, 0 mSdLazyCounter, 1928 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2563 SdHoareTripleChecker+Valid, 2785 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:01,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2563 Valid, 2785 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1928 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:33:01,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2024-10-12 20:33:01,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 646. [2024-10-12 20:33:01,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 624 states have (on average 1.296474358974359) internal successors, (809), 645 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 809 transitions. [2024-10-12 20:33:01,901 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 809 transitions. Word has length 96 [2024-10-12 20:33:01,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:01,901 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 809 transitions. [2024-10-12 20:33:01,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:01,901 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 809 transitions. [2024-10-12 20:33:01,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-12 20:33:01,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:01,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:01,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-10-12 20:33:01,902 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:33:01,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:01,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1790687854, now seen corresponding path program 1 times [2024-10-12 20:33:01,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:01,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995098814] [2024-10-12 20:33:01,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:01,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:02,049 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-12 20:33:02,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:02,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995098814] [2024-10-12 20:33:02,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995098814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:02,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:02,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:02,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833994201] [2024-10-12 20:33:02,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:02,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:02,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:02,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:02,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:02,050 INFO L87 Difference]: Start difference. First operand 646 states and 809 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:02,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:02,699 INFO L93 Difference]: Finished difference Result 1044 states and 1325 transitions. [2024-10-12 20:33:02,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:33:02,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-12 20:33:02,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:02,701 INFO L225 Difference]: With dead ends: 1044 [2024-10-12 20:33:02,701 INFO L226 Difference]: Without dead ends: 958 [2024-10-12 20:33:02,701 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-12 20:33:02,701 INFO L432 NwaCegarLoop]: 709 mSDtfsCounter, 1690 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 1921 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 2977 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:02,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1690 Valid, 2977 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1921 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:33:02,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-12 20:33:02,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 642. [2024-10-12 20:33:02,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.2967741935483872) internal successors, (804), 641 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:02,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 804 transitions. [2024-10-12 20:33:02,706 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 804 transitions. Word has length 97 [2024-10-12 20:33:02,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:02,706 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 804 transitions. [2024-10-12 20:33:02,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:02,706 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 804 transitions. [2024-10-12 20:33:02,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-12 20:33:02,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:02,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:02,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-10-12 20:33:02,707 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:33:02,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:02,707 INFO L85 PathProgramCache]: Analyzing trace with hash -971517062, now seen corresponding path program 1 times [2024-10-12 20:33:02,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:02,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694406943] [2024-10-12 20:33:02,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:02,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:02,860 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-12 20:33:02,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:02,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694406943] [2024-10-12 20:33:02,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694406943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:02,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:02,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:02,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379938901] [2024-10-12 20:33:02,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:02,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:02,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:02,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:02,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:02,862 INFO L87 Difference]: Start difference. First operand 642 states and 804 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:03,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:03,495 INFO L93 Difference]: Finished difference Result 931 states and 1156 transitions. [2024-10-12 20:33:03,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:33:03,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-12 20:33:03,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:03,496 INFO L225 Difference]: With dead ends: 931 [2024-10-12 20:33:03,497 INFO L226 Difference]: Without dead ends: 926 [2024-10-12 20:33:03,497 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-12 20:33:03,497 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 2870 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2870 SdHoareTripleChecker+Valid, 2334 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:03,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2870 Valid, 2334 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1702 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:33:03,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-12 20:33:03,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 638. [2024-10-12 20:33:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.297077922077922) internal successors, (799), 637 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 799 transitions. [2024-10-12 20:33:03,502 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 799 transitions. Word has length 97 [2024-10-12 20:33:03,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:03,502 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 799 transitions. [2024-10-12 20:33:03,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:03,502 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 799 transitions. [2024-10-12 20:33:03,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-12 20:33:03,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:03,503 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:03,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-10-12 20:33:03,504 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:33:03,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:03,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1316426182, now seen corresponding path program 1 times [2024-10-12 20:33:03,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:03,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269697912] [2024-10-12 20:33:03,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:03,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:03,673 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-12 20:33:03,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:03,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269697912] [2024-10-12 20:33:03,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269697912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:03,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:03,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:03,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071525982] [2024-10-12 20:33:03,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:03,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:03,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:03,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:03,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:03,675 INFO L87 Difference]: Start difference. First operand 638 states and 799 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:04,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:04,359 INFO L93 Difference]: Finished difference Result 1000 states and 1261 transitions. [2024-10-12 20:33:04,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:33:04,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-12 20:33:04,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:04,360 INFO L225 Difference]: With dead ends: 1000 [2024-10-12 20:33:04,360 INFO L226 Difference]: Without dead ends: 926 [2024-10-12 20:33:04,361 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-12 20:33:04,361 INFO L432 NwaCegarLoop]: 607 mSDtfsCounter, 2552 mSDsluCounter, 2226 mSDsCounter, 0 mSdLazyCounter, 1936 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2552 SdHoareTripleChecker+Valid, 2833 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:04,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2552 Valid, 2833 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1936 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:33:04,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-12 20:33:04,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 638. [2024-10-12 20:33:04,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.2954545454545454) internal successors, (798), 637 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 798 transitions. [2024-10-12 20:33:04,366 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 798 transitions. Word has length 97 [2024-10-12 20:33:04,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:04,366 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 798 transitions. [2024-10-12 20:33:04,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:04,366 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 798 transitions. [2024-10-12 20:33:04,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-12 20:33:04,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:04,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:04,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-10-12 20:33:04,367 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:33:04,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:04,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1365796076, now seen corresponding path program 1 times [2024-10-12 20:33:04,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:04,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393204673] [2024-10-12 20:33:04,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:04,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:04,530 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-12 20:33:04,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:04,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393204673] [2024-10-12 20:33:04,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393204673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:04,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:04,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:04,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935312968] [2024-10-12 20:33:04,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:04,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:04,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:04,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:04,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:04,532 INFO L87 Difference]: Start difference. First operand 638 states and 798 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:05,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:05,209 INFO L93 Difference]: Finished difference Result 1001 states and 1261 transitions. [2024-10-12 20:33:05,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:33:05,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-12 20:33:05,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:05,210 INFO L225 Difference]: With dead ends: 1001 [2024-10-12 20:33:05,210 INFO L226 Difference]: Without dead ends: 926 [2024-10-12 20:33:05,211 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-12 20:33:05,211 INFO L432 NwaCegarLoop]: 607 mSDtfsCounter, 2550 mSDsluCounter, 2226 mSDsCounter, 0 mSdLazyCounter, 1932 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2550 SdHoareTripleChecker+Valid, 2833 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:05,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2550 Valid, 2833 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1932 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:33:05,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-12 20:33:05,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 638. [2024-10-12 20:33:05,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.2938311688311688) internal successors, (797), 637 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 797 transitions. [2024-10-12 20:33:05,215 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 797 transitions. Word has length 97 [2024-10-12 20:33:05,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:05,215 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 797 transitions. [2024-10-12 20:33:05,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:05,215 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 797 transitions. [2024-10-12 20:33:05,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-12 20:33:05,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:05,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] [2024-10-12 20:33:05,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-10-12 20:33:05,216 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:33:05,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:05,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1202009913, now seen corresponding path program 1 times [2024-10-12 20:33:05,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:05,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310043658] [2024-10-12 20:33:05,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:05,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:05,387 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-12 20:33:05,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:05,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310043658] [2024-10-12 20:33:05,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310043658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:05,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:05,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:05,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367277636] [2024-10-12 20:33:05,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:05,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:05,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:05,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:05,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:05,399 INFO L87 Difference]: Start difference. First operand 638 states and 797 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:06,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:06,109 INFO L93 Difference]: Finished difference Result 1040 states and 1317 transitions. [2024-10-12 20:33:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:33:06,109 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-12 20:33:06,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:06,110 INFO L225 Difference]: With dead ends: 1040 [2024-10-12 20:33:06,110 INFO L226 Difference]: Without dead ends: 954 [2024-10-12 20:33:06,111 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-12 20:33:06,111 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 2451 mSDsluCounter, 2532 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2451 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 2093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:06,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2451 Valid, 3253 Invalid, 2093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:33:06,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-12 20:33:06,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 634. [2024-10-12 20:33:06,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.2941176470588236) internal successors, (792), 633 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:06,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 792 transitions. [2024-10-12 20:33:06,115 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 792 transitions. Word has length 97 [2024-10-12 20:33:06,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:06,116 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 792 transitions. [2024-10-12 20:33:06,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:06,116 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 792 transitions. [2024-10-12 20:33:06,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-12 20:33:06,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:06,116 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:33:06,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-10-12 20:33:06,116 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:33:06,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:06,117 INFO L85 PathProgramCache]: Analyzing trace with hash 236768823, now seen corresponding path program 1 times [2024-10-12 20:33:06,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:06,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937833779] [2024-10-12 20:33:06,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:06,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:06,594 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-12 20:33:06,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:06,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937833779] [2024-10-12 20:33:06,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937833779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:06,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:06,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 20:33:06,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100414838] [2024-10-12 20:33:06,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:06,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 20:33:06,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:06,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 20:33:06,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:33:06,595 INFO L87 Difference]: Start difference. First operand 634 states and 792 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:07,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:07,231 INFO L93 Difference]: Finished difference Result 1540 states and 1971 transitions. [2024-10-12 20:33:07,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 20:33:07,231 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-12 20:33:07,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:07,232 INFO L225 Difference]: With dead ends: 1540 [2024-10-12 20:33:07,232 INFO L226 Difference]: Without dead ends: 1403 [2024-10-12 20:33:07,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-12 20:33:07,233 INFO L432 NwaCegarLoop]: 1484 mSDtfsCounter, 3814 mSDsluCounter, 7770 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3814 SdHoareTripleChecker+Valid, 9254 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:07,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3814 Valid, 9254 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:33:07,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2024-10-12 20:33:07,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 571. [2024-10-12 20:33:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 553 states have (on average 1.2911392405063291) internal successors, (714), 570 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:07,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 714 transitions. [2024-10-12 20:33:07,237 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 714 transitions. Word has length 98 [2024-10-12 20:33:07,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:07,237 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 714 transitions. [2024-10-12 20:33:07,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:07,238 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 714 transitions. [2024-10-12 20:33:07,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-12 20:33:07,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:07,238 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:07,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-10-12 20:33:07,238 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:33:07,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:07,239 INFO L85 PathProgramCache]: Analyzing trace with hash 843370531, now seen corresponding path program 1 times [2024-10-12 20:33:07,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:07,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785313811] [2024-10-12 20:33:07,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:07,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:07,751 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-12 20:33:07,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:07,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785313811] [2024-10-12 20:33:07,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785313811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:07,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:07,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 20:33:07,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499623141] [2024-10-12 20:33:07,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:07,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 20:33:07,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:07,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 20:33:07,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:33:07,753 INFO L87 Difference]: Start difference. First operand 571 states and 714 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:08,646 INFO L93 Difference]: Finished difference Result 1344 states and 1703 transitions. [2024-10-12 20:33:08,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 20:33:08,646 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-12 20:33:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:08,647 INFO L225 Difference]: With dead ends: 1344 [2024-10-12 20:33:08,648 INFO L226 Difference]: Without dead ends: 1254 [2024-10-12 20:33:08,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-12 20:33:08,648 INFO L432 NwaCegarLoop]: 1144 mSDtfsCounter, 3617 mSDsluCounter, 6325 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3617 SdHoareTripleChecker+Valid, 7469 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:08,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3617 Valid, 7469 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:33:08,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-10-12 20:33:08,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 555. [2024-10-12 20:33:08,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 539 states have (on average 1.2894248608534322) internal successors, (695), 554 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:08,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 695 transitions. [2024-10-12 20:33:08,652 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 695 transitions. Word has length 98 [2024-10-12 20:33:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:08,653 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 695 transitions. [2024-10-12 20:33:08,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:08,653 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 695 transitions. [2024-10-12 20:33:08,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-12 20:33:08,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:08,654 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:08,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-10-12 20:33:08,654 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:33:08,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:08,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1087150783, now seen corresponding path program 1 times [2024-10-12 20:33:08,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:08,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587335203] [2024-10-12 20:33:08,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:08,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:09,034 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-12 20:33:09,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:09,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587335203] [2024-10-12 20:33:09,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587335203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:09,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:09,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 20:33:09,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504432827] [2024-10-12 20:33:09,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:09,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 20:33:09,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:09,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 20:33:09,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:33:09,036 INFO L87 Difference]: Start difference. First operand 555 states and 695 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:09,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:09,737 INFO L93 Difference]: Finished difference Result 1376 states and 1759 transitions. [2024-10-12 20:33:09,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 20:33:09,737 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-12 20:33:09,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:09,738 INFO L225 Difference]: With dead ends: 1376 [2024-10-12 20:33:09,739 INFO L226 Difference]: Without dead ends: 1269 [2024-10-12 20:33:09,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-12 20:33:09,739 INFO L432 NwaCegarLoop]: 1189 mSDtfsCounter, 3577 mSDsluCounter, 8620 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3577 SdHoareTripleChecker+Valid, 9809 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:09,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3577 Valid, 9809 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:33:09,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2024-10-12 20:33:09,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 522. [2024-10-12 20:33:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 509 states have (on average 1.2868369351669942) internal successors, (655), 521 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:09,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 655 transitions. [2024-10-12 20:33:09,754 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 655 transitions. Word has length 98 [2024-10-12 20:33:09,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:09,754 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 655 transitions. [2024-10-12 20:33:09,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:09,754 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 655 transitions. [2024-10-12 20:33:09,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-12 20:33:09,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:09,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:09,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-10-12 20:33:09,755 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:33:09,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:09,755 INFO L85 PathProgramCache]: Analyzing trace with hash -534371604, now seen corresponding path program 1 times [2024-10-12 20:33:09,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:09,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087704277] [2024-10-12 20:33:09,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:09,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:10,173 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-12 20:33:10,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:10,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087704277] [2024-10-12 20:33:10,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087704277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:10,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:10,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 20:33:10,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804992689] [2024-10-12 20:33:10,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:10,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 20:33:10,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:10,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 20:33:10,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:33:10,174 INFO L87 Difference]: Start difference. First operand 522 states and 655 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:11,011 INFO L93 Difference]: Finished difference Result 1343 states and 1718 transitions. [2024-10-12 20:33:11,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:33:11,011 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-12 20:33:11,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:11,013 INFO L225 Difference]: With dead ends: 1343 [2024-10-12 20:33:11,013 INFO L226 Difference]: Without dead ends: 1251 [2024-10-12 20:33:11,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-10-12 20:33:11,013 INFO L432 NwaCegarLoop]: 1328 mSDtfsCounter, 3669 mSDsluCounter, 8563 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3669 SdHoareTripleChecker+Valid, 9891 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:11,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3669 Valid, 9891 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:33:11,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2024-10-12 20:33:11,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 504. [2024-10-12 20:33:11,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 491 states have (on average 1.2830957230142566) internal successors, (630), 503 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 630 transitions. [2024-10-12 20:33:11,027 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 630 transitions. Word has length 98 [2024-10-12 20:33:11,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:11,027 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 630 transitions. [2024-10-12 20:33:11,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 630 transitions. [2024-10-12 20:33:11,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-12 20:33:11,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:11,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:11,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-10-12 20:33:11,028 INFO L396 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-12 20:33:11,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:11,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1209646256, now seen corresponding path program 1 times [2024-10-12 20:33:11,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:11,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305278386] [2024-10-12 20:33:11,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:11,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:12,553 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-12 20:33:12,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:12,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305278386] [2024-10-12 20:33:12,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305278386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:12,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:12,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2024-10-12 20:33:12,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613209850] [2024-10-12 20:33:12,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:12,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-12 20:33:12,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:12,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-12 20:33:12,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=986, Unknown=0, NotChecked=0, Total=1056 [2024-10-12 20:33:12,554 INFO L87 Difference]: Start difference. First operand 504 states and 630 transitions. Second operand has 33 states, 33 states have (on average 2.9696969696969697) internal successors, (98), 32 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)