./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.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 8381803db0f296b6c475c94ca7dd8f9a2c79c383b82b37638a653c8556f3f15c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:43:02,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:43:02,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:43:02,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:43:02,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:43:02,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:43:02,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:43:02,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:43:02,228 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:43:02,230 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:43:02,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:43:02,230 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:43:02,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:43:02,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:43:02,231 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:43:02,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:43:02,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:43:02,231 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:43:02,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:43:02,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:43:02,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:43:02,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:43:02,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:43:02,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:43:02,236 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:43:02,236 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:43:02,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:43:02,237 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:43:02,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:43:02,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:43:02,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:43:02,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:43:02,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:43:02,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:43:02,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:43:02,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:43:02,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:43:02,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:43:02,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:43:02,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:43:02,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:43:02,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:43:02,240 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 -> 8381803db0f296b6c475c94ca7dd8f9a2c79c383b82b37638a653c8556f3f15c [2024-11-11 21:43:02,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:43:02,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:43:02,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:43:02,491 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:43:02,492 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:43:02,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2024-11-11 21:43:03,829 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:43:04,117 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:43:04,117 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2024-11-11 21:43:04,136 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e66748028/4d296615cbd74bfd9e62c18015b02195/FLAG643d677ce [2024-11-11 21:43:04,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e66748028/4d296615cbd74bfd9e62c18015b02195 [2024-11-11 21:43:04,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:43:04,399 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:43:04,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:43:04,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:43:04,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:43:04,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:43:04" (1/1) ... [2024-11-11 21:43:04,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7af3a78b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:04, skipping insertion in model container [2024-11-11 21:43:04,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:43:04" (1/1) ... [2024-11-11 21:43:04,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:43:04,784 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[11561,11574] [2024-11-11 21:43:04,817 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[15618,15631] [2024-11-11 21:43:04,825 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[16839,16852] [2024-11-11 21:43:04,829 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[17545,17558] [2024-11-11 21:43:04,836 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19131,19144] [2024-11-11 21:43:04,844 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19837,19850] [2024-11-11 21:43:04,849 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[20908,20921] [2024-11-11 21:43:04,858 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[23398,23411] [2024-11-11 21:43:04,865 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[24107,24120] [2024-11-11 21:43:04,870 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[25144,25157] [2024-11-11 21:43:04,877 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[27082,27095] [2024-11-11 21:43:04,896 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31116,31129] [2024-11-11 21:43:04,903 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31825,31838] [2024-11-11 21:43:04,914 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[32899,32912] [2024-11-11 21:43:04,926 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[34874,34887] [2024-11-11 21:43:04,941 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[38255,38268] [2024-11-11 21:43:05,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:43:05,075 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:43:05,120 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[11561,11574] [2024-11-11 21:43:05,128 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[15618,15631] [2024-11-11 21:43:05,132 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[16839,16852] [2024-11-11 21:43:05,137 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[17545,17558] [2024-11-11 21:43:05,145 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19131,19144] [2024-11-11 21:43:05,151 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19837,19850] [2024-11-11 21:43:05,155 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[20908,20921] [2024-11-11 21:43:05,165 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[23398,23411] [2024-11-11 21:43:05,168 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[24107,24120] [2024-11-11 21:43:05,171 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[25144,25157] [2024-11-11 21:43:05,177 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[27082,27095] [2024-11-11 21:43:05,187 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31116,31129] [2024-11-11 21:43:05,190 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31825,31838] [2024-11-11 21:43:05,192 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[32899,32912] [2024-11-11 21:43:05,197 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[34874,34887] [2024-11-11 21:43:05,204 WARN L250 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[38255,38268] [2024-11-11 21:43:05,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:43:05,304 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:43:05,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:05 WrapperNode [2024-11-11 21:43:05,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:43:05,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:43:05,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:43:05,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:43:05,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:05" (1/1) ... [2024-11-11 21:43:05,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:05" (1/1) ... [2024-11-11 21:43:05,413 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3756 [2024-11-11 21:43:05,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:43:05,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:43:05,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:43:05,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:43:05,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:05" (1/1) ... [2024-11-11 21:43:05,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:05" (1/1) ... [2024-11-11 21:43:05,437 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:05" (1/1) ... [2024-11-11 21:43:05,476 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-11-11 21:43:05,477 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:05" (1/1) ... [2024-11-11 21:43:05,477 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:05" (1/1) ... [2024-11-11 21:43:05,509 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:05" (1/1) ... [2024-11-11 21:43:05,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:05" (1/1) ... [2024-11-11 21:43:05,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:05" (1/1) ... [2024-11-11 21:43:05,546 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:05" (1/1) ... [2024-11-11 21:43:05,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:43:05,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:43:05,568 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:43:05,568 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:43:05,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:05" (1/1) ... [2024-11-11 21:43:05,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:43:05,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:43:05,601 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-11-11 21:43:05,604 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-11-11 21:43:05,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:43:05,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:43:05,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:43:05,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:43:05,839 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:43:05,841 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:43:07,619 INFO L? ?]: Removed 602 outVars from TransFormulas that were not future-live. [2024-11-11 21:43:07,619 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:43:07,651 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:43:07,651 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 21:43:07,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:43:07 BoogieIcfgContainer [2024-11-11 21:43:07,652 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:43:07,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:43:07,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:43:07,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:43:07,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:43:04" (1/3) ... [2024-11-11 21:43:07,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726712da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:43:07, skipping insertion in model container [2024-11-11 21:43:07,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:05" (2/3) ... [2024-11-11 21:43:07,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726712da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:43:07, skipping insertion in model container [2024-11-11 21:43:07,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:43:07" (3/3) ... [2024-11-11 21:43:07,664 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2024-11-11 21:43:07,680 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:43:07,680 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-11 21:43:07,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:43:07,779 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;@3193238d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:43:07,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-11 21:43:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand has 629 states, 612 states have (on average 1.8480392156862746) internal successors, (1131), 628 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:07,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 21:43:07,815 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:07,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:43:07,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:07,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:07,827 INFO L85 PathProgramCache]: Analyzing trace with hash -729096350, now seen corresponding path program 1 times [2024-11-11 21:43:07,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:07,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065252967] [2024-11-11 21:43:07,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:07,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:08,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:08,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065252967] [2024-11-11 21:43:08,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065252967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:08,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:08,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:43:08,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636913433] [2024-11-11 21:43:08,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:08,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:43:08,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:08,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:43:08,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:43:08,388 INFO L87 Difference]: Start difference. First operand has 629 states, 612 states have (on average 1.8480392156862746) internal successors, (1131), 628 states have internal predecessors, (1131), 0 states have call successors, (0), 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 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:08,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:08,835 INFO L93 Difference]: Finished difference Result 976 states and 1692 transitions. [2024-11-11 21:43:08,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:43:08,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-11 21:43:08,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:08,853 INFO L225 Difference]: With dead ends: 976 [2024-11-11 21:43:08,853 INFO L226 Difference]: Without dead ends: 504 [2024-11-11 21:43:08,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:43:08,860 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 2533 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:08,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 621 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:43:08,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-11 21:43:08,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2024-11-11 21:43:08,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 488 states have (on average 1.305327868852459) internal successors, (637), 503 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 637 transitions. [2024-11-11 21:43:08,930 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 637 transitions. Word has length 72 [2024-11-11 21:43:08,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:08,930 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 637 transitions. [2024-11-11 21:43:08,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:08,930 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 637 transitions. [2024-11-11 21:43:08,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-11 21:43:08,933 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:08,933 INFO L218 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] [2024-11-11 21:43:08,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:43:08,933 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:08,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:08,937 INFO L85 PathProgramCache]: Analyzing trace with hash -2012921467, now seen corresponding path program 1 times [2024-11-11 21:43:08,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:08,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661725103] [2024-11-11 21:43:08,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:08,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:09,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:09,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661725103] [2024-11-11 21:43:09,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661725103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:09,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:09,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:43:09,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354686323] [2024-11-11 21:43:09,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:09,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:43:09,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:09,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:43:09,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:43:09,142 INFO L87 Difference]: Start difference. First operand 504 states and 637 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:09,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:09,379 INFO L93 Difference]: Finished difference Result 842 states and 1093 transitions. [2024-11-11 21:43:09,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:43:09,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-11-11 21:43:09,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:09,382 INFO L225 Difference]: With dead ends: 842 [2024-11-11 21:43:09,382 INFO L226 Difference]: Without dead ends: 440 [2024-11-11 21:43:09,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:43:09,384 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 1646 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:09,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1646 Valid, 337 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:43:09,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-11 21:43:09,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2024-11-11 21:43:09,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 424 states have (on average 1.330188679245283) internal successors, (564), 439 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 564 transitions. [2024-11-11 21:43:09,399 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 564 transitions. Word has length 73 [2024-11-11 21:43:09,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:09,399 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 564 transitions. [2024-11-11 21:43:09,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:09,400 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 564 transitions. [2024-11-11 21:43:09,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 21:43:09,401 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:09,401 INFO L218 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] [2024-11-11 21:43:09,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:43:09,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:09,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:09,402 INFO L85 PathProgramCache]: Analyzing trace with hash -800948093, now seen corresponding path program 1 times [2024-11-11 21:43:09,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:09,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459711642] [2024-11-11 21:43:09,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:09,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:09,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-11-11 21:43:09,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:09,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459711642] [2024-11-11 21:43:09,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459711642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:09,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:09,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:43:09,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236976777] [2024-11-11 21:43:09,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:09,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:43:09,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:09,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:43:09,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:43:09,556 INFO L87 Difference]: Start difference. First operand 440 states and 564 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:09,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:09,833 INFO L93 Difference]: Finished difference Result 778 states and 1019 transitions. [2024-11-11 21:43:09,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:43:09,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-11-11 21:43:09,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:09,835 INFO L225 Difference]: With dead ends: 778 [2024-11-11 21:43:09,836 INFO L226 Difference]: Without dead ends: 420 [2024-11-11 21:43:09,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:43:09,837 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 1514 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:09,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 302 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:43:09,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-11 21:43:09,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-11-11 21:43:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 404 states have (on average 1.3341584158415842) internal successors, (539), 419 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:09,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 539 transitions. [2024-11-11 21:43:09,859 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 539 transitions. Word has length 74 [2024-11-11 21:43:09,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:09,860 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 539 transitions. [2024-11-11 21:43:09,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:09,860 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 539 transitions. [2024-11-11 21:43:09,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-11 21:43:09,861 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:09,861 INFO L218 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] [2024-11-11 21:43:09,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:43:09,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:09,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:09,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1628151892, now seen corresponding path program 1 times [2024-11-11 21:43:09,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:09,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819660992] [2024-11-11 21:43:09,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:09,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:10,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-11-11 21:43:10,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:10,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819660992] [2024-11-11 21:43:10,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819660992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:10,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:10,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:43:10,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344417408] [2024-11-11 21:43:10,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:10,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:43:10,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:10,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:43:10,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:43:10,053 INFO L87 Difference]: Start difference. First operand 420 states and 539 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:10,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:10,303 INFO L93 Difference]: Finished difference Result 758 states and 993 transitions. [2024-11-11 21:43:10,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:43:10,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-11-11 21:43:10,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:10,305 INFO L225 Difference]: With dead ends: 758 [2024-11-11 21:43:10,305 INFO L226 Difference]: Without dead ends: 404 [2024-11-11 21:43:10,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:43:10,307 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 1475 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:10,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 308 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:43:10,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-11 21:43:10,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2024-11-11 21:43:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 388 states have (on average 1.3402061855670102) internal successors, (520), 403 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 520 transitions. [2024-11-11 21:43:10,319 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 520 transitions. Word has length 75 [2024-11-11 21:43:10,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:10,319 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 520 transitions. [2024-11-11 21:43:10,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 520 transitions. [2024-11-11 21:43:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-11 21:43:10,321 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:10,321 INFO L218 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] [2024-11-11 21:43:10,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:43:10,321 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:10,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:10,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1037752348, now seen corresponding path program 1 times [2024-11-11 21:43:10,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:10,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796665493] [2024-11-11 21:43:10,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:10,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:10,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:10,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796665493] [2024-11-11 21:43:10,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796665493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:10,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:10,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:43:10,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367203862] [2024-11-11 21:43:10,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:10,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:43:10,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:10,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:43:10,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:43:10,462 INFO L87 Difference]: Start difference. First operand 404 states and 520 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:10,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:10,686 INFO L93 Difference]: Finished difference Result 742 states and 973 transitions. [2024-11-11 21:43:10,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:43:10,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-11-11 21:43:10,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:10,688 INFO L225 Difference]: With dead ends: 742 [2024-11-11 21:43:10,688 INFO L226 Difference]: Without dead ends: 393 [2024-11-11 21:43:10,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:43:10,689 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 1450 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:10,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 305 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:43:10,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-11 21:43:10,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-11 21:43:10,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3448275862068966) internal successors, (507), 392 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 507 transitions. [2024-11-11 21:43:10,706 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 507 transitions. Word has length 76 [2024-11-11 21:43:10,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:10,707 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 507 transitions. [2024-11-11 21:43:10,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 507 transitions. [2024-11-11 21:43:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 21:43:10,713 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:10,713 INFO L218 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] [2024-11-11 21:43:10,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:43:10,713 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:10,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:10,714 INFO L85 PathProgramCache]: Analyzing trace with hash -142744767, now seen corresponding path program 1 times [2024-11-11 21:43:10,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:10,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381583866] [2024-11-11 21:43:10,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:10,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:11,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:11,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381583866] [2024-11-11 21:43:11,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381583866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:11,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:11,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:11,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286890610] [2024-11-11 21:43:11,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:11,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:11,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:11,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:11,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:11,013 INFO L87 Difference]: Start difference. First operand 393 states and 507 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:11,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:11,634 INFO L93 Difference]: Finished difference Result 695 states and 915 transitions. [2024-11-11 21:43:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:11,634 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-11-11 21:43:11,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:11,636 INFO L225 Difference]: With dead ends: 695 [2024-11-11 21:43:11,636 INFO L226 Difference]: Without dead ends: 605 [2024-11-11 21:43:11,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:43:11,637 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 2840 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2840 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:11,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2840 Valid, 1259 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:11,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-11 21:43:11,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 393. [2024-11-11 21:43:11,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3421750663129974) internal successors, (506), 392 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:11,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 506 transitions. [2024-11-11 21:43:11,647 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 506 transitions. Word has length 77 [2024-11-11 21:43:11,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:11,648 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 506 transitions. [2024-11-11 21:43:11,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:11,648 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 506 transitions. [2024-11-11 21:43:11,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 21:43:11,649 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:11,649 INFO L218 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] [2024-11-11 21:43:11,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:43:11,649 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:11,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:11,649 INFO L85 PathProgramCache]: Analyzing trace with hash -2022253705, now seen corresponding path program 1 times [2024-11-11 21:43:11,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:11,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88616403] [2024-11-11 21:43:11,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:11,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:12,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:12,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88616403] [2024-11-11 21:43:12,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88616403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:12,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:12,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 21:43:12,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120252803] [2024-11-11 21:43:12,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:12,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:43:12,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:12,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:43:12,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:43:12,035 INFO L87 Difference]: Start difference. First operand 393 states and 506 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:12,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:12,821 INFO L93 Difference]: Finished difference Result 683 states and 883 transitions. [2024-11-11 21:43:12,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:43:12,822 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-11-11 21:43:12,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:12,823 INFO L225 Difference]: With dead ends: 683 [2024-11-11 21:43:12,824 INFO L226 Difference]: Without dead ends: 613 [2024-11-11 21:43:12,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2024-11-11 21:43:12,825 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 3410 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3410 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:12,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3410 Valid, 1442 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:43:12,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-11 21:43:12,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 406. [2024-11-11 21:43:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 390 states have (on average 1.3461538461538463) internal successors, (525), 405 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 525 transitions. [2024-11-11 21:43:12,833 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 525 transitions. Word has length 77 [2024-11-11 21:43:12,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:12,833 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 525 transitions. [2024-11-11 21:43:12,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 525 transitions. [2024-11-11 21:43:12,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 21:43:12,834 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:12,834 INFO L218 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] [2024-11-11 21:43:12,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:43:12,834 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:12,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:12,835 INFO L85 PathProgramCache]: Analyzing trace with hash -110056603, now seen corresponding path program 1 times [2024-11-11 21:43:12,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:12,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968007680] [2024-11-11 21:43:12,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:12,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:13,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:13,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968007680] [2024-11-11 21:43:13,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968007680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:13,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:13,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:13,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700475188] [2024-11-11 21:43:13,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:13,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:13,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:13,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:13,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:13,164 INFO L87 Difference]: Start difference. First operand 406 states and 525 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:13,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:13,832 INFO L93 Difference]: Finished difference Result 738 states and 968 transitions. [2024-11-11 21:43:13,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:13,832 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-11-11 21:43:13,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:13,834 INFO L225 Difference]: With dead ends: 738 [2024-11-11 21:43:13,834 INFO L226 Difference]: Without dead ends: 609 [2024-11-11 21:43:13,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:43:13,835 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 2323 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2323 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:13,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2323 Valid, 1598 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:13,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-11 21:43:13,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 393. [2024-11-11 21:43:13,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.339522546419098) internal successors, (505), 392 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:13,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 505 transitions. [2024-11-11 21:43:13,844 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 505 transitions. Word has length 77 [2024-11-11 21:43:13,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:13,844 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 505 transitions. [2024-11-11 21:43:13,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:13,845 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 505 transitions. [2024-11-11 21:43:13,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 21:43:13,846 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:13,846 INFO L218 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] [2024-11-11 21:43:13,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:43:13,847 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:13,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash 679839246, now seen corresponding path program 1 times [2024-11-11 21:43:13,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:13,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410155913] [2024-11-11 21:43:13,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:13,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:14,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-11-11 21:43:14,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:14,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410155913] [2024-11-11 21:43:14,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410155913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:14,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:14,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:43:14,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042127598] [2024-11-11 21:43:14,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:14,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:43:14,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:14,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:43:14,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:43:14,170 INFO L87 Difference]: Start difference. First operand 393 states and 505 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:14,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:14,733 INFO L93 Difference]: Finished difference Result 760 states and 963 transitions. [2024-11-11 21:43:14,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:43:14,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-11-11 21:43:14,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:14,736 INFO L225 Difference]: With dead ends: 760 [2024-11-11 21:43:14,736 INFO L226 Difference]: Without dead ends: 547 [2024-11-11 21:43:14,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:43:14,738 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 2069 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2069 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:14,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2069 Valid, 1149 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:14,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-11-11 21:43:14,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 393. [2024-11-11 21:43:14,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.336870026525199) internal successors, (504), 392 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 504 transitions. [2024-11-11 21:43:14,746 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 504 transitions. Word has length 77 [2024-11-11 21:43:14,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:14,746 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 504 transitions. [2024-11-11 21:43:14,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:14,746 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 504 transitions. [2024-11-11 21:43:14,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 21:43:14,747 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:14,747 INFO L218 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] [2024-11-11 21:43:14,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:43:14,747 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:14,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:14,753 INFO L85 PathProgramCache]: Analyzing trace with hash -204100811, now seen corresponding path program 1 times [2024-11-11 21:43:14,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:14,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960045305] [2024-11-11 21:43:14,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:14,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:15,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:15,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:15,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960045305] [2024-11-11 21:43:15,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960045305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:15,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:15,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 21:43:15,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288854613] [2024-11-11 21:43:15,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:15,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:43:15,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:15,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:43:15,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:43:15,187 INFO L87 Difference]: Start difference. First operand 393 states and 504 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:16,276 INFO L93 Difference]: Finished difference Result 952 states and 1281 transitions. [2024-11-11 21:43:16,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 21:43:16,277 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-11 21:43:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:16,280 INFO L225 Difference]: With dead ends: 952 [2024-11-11 21:43:16,280 INFO L226 Difference]: Without dead ends: 853 [2024-11-11 21:43:16,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-11 21:43:16,281 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 3685 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3685 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:16,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3685 Valid, 1841 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 21:43:16,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-11-11 21:43:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 397. [2024-11-11 21:43:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3333333333333333) internal successors, (508), 396 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:16,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 508 transitions. [2024-11-11 21:43:16,291 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 508 transitions. Word has length 79 [2024-11-11 21:43:16,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:16,292 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 508 transitions. [2024-11-11 21:43:16,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:16,292 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 508 transitions. [2024-11-11 21:43:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 21:43:16,292 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:16,293 INFO L218 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] [2024-11-11 21:43:16,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:43:16,293 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:16,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:16,294 INFO L85 PathProgramCache]: Analyzing trace with hash -612946039, now seen corresponding path program 1 times [2024-11-11 21:43:16,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:16,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347934443] [2024-11-11 21:43:16,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:16,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:16,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:16,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347934443] [2024-11-11 21:43:16,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347934443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:16,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:16,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:16,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545286166] [2024-11-11 21:43:16,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:16,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:16,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:16,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:16,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:16,570 INFO L87 Difference]: Start difference. First operand 397 states and 508 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:17,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:17,161 INFO L93 Difference]: Finished difference Result 678 states and 881 transitions. [2024-11-11 21:43:17,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:17,162 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-11 21:43:17,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:17,163 INFO L225 Difference]: With dead ends: 678 [2024-11-11 21:43:17,163 INFO L226 Difference]: Without dead ends: 601 [2024-11-11 21:43:17,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:43:17,164 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 2729 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2729 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:17,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2729 Valid, 1298 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:17,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-11 21:43:17,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 397. [2024-11-11 21:43:17,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.330708661417323) internal successors, (507), 396 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:17,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 507 transitions. [2024-11-11 21:43:17,172 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 507 transitions. Word has length 79 [2024-11-11 21:43:17,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:17,172 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 507 transitions. [2024-11-11 21:43:17,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:17,172 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 507 transitions. [2024-11-11 21:43:17,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 21:43:17,175 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:17,176 INFO L218 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] [2024-11-11 21:43:17,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:43:17,176 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:17,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:17,176 INFO L85 PathProgramCache]: Analyzing trace with hash -244843864, now seen corresponding path program 1 times [2024-11-11 21:43:17,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:17,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621479455] [2024-11-11 21:43:17,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:17,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:17,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:17,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:17,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621479455] [2024-11-11 21:43:17,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621479455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:17,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:17,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:17,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089780933] [2024-11-11 21:43:17,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:17,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:17,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:17,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:17,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:17,395 INFO L87 Difference]: Start difference. First operand 397 states and 507 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:17,959 INFO L93 Difference]: Finished difference Result 678 states and 879 transitions. [2024-11-11 21:43:17,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:17,960 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-11 21:43:17,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:17,962 INFO L225 Difference]: With dead ends: 678 [2024-11-11 21:43:17,962 INFO L226 Difference]: Without dead ends: 601 [2024-11-11 21:43:17,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:43:17,963 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 1285 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:17,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1285 Valid, 1283 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:17,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-11 21:43:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 397. [2024-11-11 21:43:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3280839895013123) internal successors, (506), 396 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:17,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 506 transitions. [2024-11-11 21:43:17,970 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 506 transitions. Word has length 79 [2024-11-11 21:43:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:17,970 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 506 transitions. [2024-11-11 21:43:17,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 506 transitions. [2024-11-11 21:43:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 21:43:17,971 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:17,971 INFO L218 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] [2024-11-11 21:43:17,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:43:17,972 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:17,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:17,972 INFO L85 PathProgramCache]: Analyzing trace with hash 391973260, now seen corresponding path program 1 times [2024-11-11 21:43:17,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:17,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762656274] [2024-11-11 21:43:17,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:17,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:18,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:18,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:18,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762656274] [2024-11-11 21:43:18,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762656274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:18,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:18,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:18,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692223052] [2024-11-11 21:43:18,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:18,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:18,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:18,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:18,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:18,234 INFO L87 Difference]: Start difference. First operand 397 states and 506 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:18,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:18,823 INFO L93 Difference]: Finished difference Result 674 states and 874 transitions. [2024-11-11 21:43:18,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:18,823 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-11 21:43:18,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:18,825 INFO L225 Difference]: With dead ends: 674 [2024-11-11 21:43:18,825 INFO L226 Difference]: Without dead ends: 601 [2024-11-11 21:43:18,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:43:18,827 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 2722 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2722 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:18,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2722 Valid, 1298 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:18,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-11 21:43:18,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 397. [2024-11-11 21:43:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3254593175853018) internal successors, (505), 396 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 505 transitions. [2024-11-11 21:43:18,833 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 505 transitions. Word has length 79 [2024-11-11 21:43:18,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:18,834 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 505 transitions. [2024-11-11 21:43:18,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:18,835 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 505 transitions. [2024-11-11 21:43:18,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 21:43:18,836 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:18,836 INFO L218 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] [2024-11-11 21:43:18,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:43:18,836 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:18,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:18,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1786631023, now seen corresponding path program 1 times [2024-11-11 21:43:18,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:18,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238891834] [2024-11-11 21:43:18,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:18,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:19,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:19,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238891834] [2024-11-11 21:43:19,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238891834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:19,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:19,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 21:43:19,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837479144] [2024-11-11 21:43:19,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:19,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 21:43:19,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:19,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 21:43:19,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:43:19,281 INFO L87 Difference]: Start difference. First operand 397 states and 505 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:20,182 INFO L93 Difference]: Finished difference Result 833 states and 1091 transitions. [2024-11-11 21:43:20,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 21:43:20,183 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-11 21:43:20,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:20,185 INFO L225 Difference]: With dead ends: 833 [2024-11-11 21:43:20,185 INFO L226 Difference]: Without dead ends: 689 [2024-11-11 21:43:20,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2024-11-11 21:43:20,186 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 1897 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 1906 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:20,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1897 Valid, 2558 Invalid, 1918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1906 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 21:43:20,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2024-11-11 21:43:20,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 397. [2024-11-11 21:43:20,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3228346456692914) internal successors, (504), 396 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:20,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 504 transitions. [2024-11-11 21:43:20,192 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 504 transitions. Word has length 79 [2024-11-11 21:43:20,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:20,193 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 504 transitions. [2024-11-11 21:43:20,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:20,193 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 504 transitions. [2024-11-11 21:43:20,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 21:43:20,194 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:20,194 INFO L218 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] [2024-11-11 21:43:20,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:43:20,194 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:20,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:20,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1207195179, now seen corresponding path program 1 times [2024-11-11 21:43:20,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:20,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91694375] [2024-11-11 21:43:20,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:20,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:20,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:20,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91694375] [2024-11-11 21:43:20,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91694375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:20,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:20,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:20,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147551819] [2024-11-11 21:43:20,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:20,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:20,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:20,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:20,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:20,423 INFO L87 Difference]: Start difference. First operand 397 states and 504 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:20,996 INFO L93 Difference]: Finished difference Result 678 states and 875 transitions. [2024-11-11 21:43:20,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:20,996 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-11 21:43:20,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:20,998 INFO L225 Difference]: With dead ends: 678 [2024-11-11 21:43:20,998 INFO L226 Difference]: Without dead ends: 601 [2024-11-11 21:43:20,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:43:20,999 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 2222 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2222 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:20,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2222 Valid, 1304 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:21,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-11 21:43:21,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 397. [2024-11-11 21:43:21,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3202099737532809) internal successors, (503), 396 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:21,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 503 transitions. [2024-11-11 21:43:21,008 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 503 transitions. Word has length 79 [2024-11-11 21:43:21,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:21,008 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 503 transitions. [2024-11-11 21:43:21,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 503 transitions. [2024-11-11 21:43:21,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 21:43:21,009 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:21,009 INFO L218 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] [2024-11-11 21:43:21,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:43:21,010 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:21,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:21,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1616040407, now seen corresponding path program 1 times [2024-11-11 21:43:21,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:21,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461096398] [2024-11-11 21:43:21,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:21,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:21,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:21,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461096398] [2024-11-11 21:43:21,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461096398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:21,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:21,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:21,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877918698] [2024-11-11 21:43:21,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:21,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:21,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:21,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:21,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:21,253 INFO L87 Difference]: Start difference. First operand 397 states and 503 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:21,802 INFO L93 Difference]: Finished difference Result 704 states and 912 transitions. [2024-11-11 21:43:21,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:21,802 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-11 21:43:21,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:21,804 INFO L225 Difference]: With dead ends: 704 [2024-11-11 21:43:21,804 INFO L226 Difference]: Without dead ends: 605 [2024-11-11 21:43:21,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:43:21,805 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 2141 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2141 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:21,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2141 Valid, 1948 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:43:21,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-11 21:43:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 397. [2024-11-11 21:43:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3175853018372703) internal successors, (502), 396 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 502 transitions. [2024-11-11 21:43:21,810 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 502 transitions. Word has length 79 [2024-11-11 21:43:21,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:21,810 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 502 transitions. [2024-11-11 21:43:21,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 502 transitions. [2024-11-11 21:43:21,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:43:21,811 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:21,811 INFO L218 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] [2024-11-11 21:43:21,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:43:21,812 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:21,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:21,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1975429315, now seen corresponding path program 1 times [2024-11-11 21:43:21,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:21,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183689471] [2024-11-11 21:43:21,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:22,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:22,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:22,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183689471] [2024-11-11 21:43:22,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183689471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:22,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:22,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:22,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587201191] [2024-11-11 21:43:22,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:22,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:22,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:22,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:22,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:22,020 INFO L87 Difference]: Start difference. First operand 397 states and 502 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:22,578 INFO L93 Difference]: Finished difference Result 704 states and 913 transitions. [2024-11-11 21:43:22,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:22,578 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-11 21:43:22,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:22,580 INFO L225 Difference]: With dead ends: 704 [2024-11-11 21:43:22,580 INFO L226 Difference]: Without dead ends: 605 [2024-11-11 21:43:22,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:43:22,581 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 1504 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:22,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1854 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:43:22,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-11 21:43:22,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 393. [2024-11-11 21:43:22,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3183023872679045) internal successors, (497), 392 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:22,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 497 transitions. [2024-11-11 21:43:22,587 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 497 transitions. Word has length 80 [2024-11-11 21:43:22,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:22,588 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 497 transitions. [2024-11-11 21:43:22,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:22,588 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 497 transitions. [2024-11-11 21:43:22,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:43:22,589 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:22,589 INFO L218 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] [2024-11-11 21:43:22,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:43:22,589 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:22,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:22,589 INFO L85 PathProgramCache]: Analyzing trace with hash 2135531548, now seen corresponding path program 1 times [2024-11-11 21:43:22,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:22,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483279872] [2024-11-11 21:43:22,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:22,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:22,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:22,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:22,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483279872] [2024-11-11 21:43:22,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483279872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:22,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:22,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:22,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447909392] [2024-11-11 21:43:22,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:22,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:22,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:22,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:22,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:22,833 INFO L87 Difference]: Start difference. First operand 393 states and 497 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:23,355 INFO L93 Difference]: Finished difference Result 651 states and 832 transitions. [2024-11-11 21:43:23,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:23,356 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 21:43:23,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:23,357 INFO L225 Difference]: With dead ends: 651 [2024-11-11 21:43:23,357 INFO L226 Difference]: Without dead ends: 581 [2024-11-11 21:43:23,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:43:23,358 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 2228 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2228 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:23,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2228 Valid, 1584 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:43:23,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-11 21:43:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 393. [2024-11-11 21:43:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3156498673740054) internal successors, (496), 392 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 496 transitions. [2024-11-11 21:43:23,363 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 496 transitions. Word has length 81 [2024-11-11 21:43:23,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:23,363 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 496 transitions. [2024-11-11 21:43:23,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:23,364 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 496 transitions. [2024-11-11 21:43:23,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:43:23,364 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:23,364 INFO L218 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] [2024-11-11 21:43:23,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:43:23,365 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:23,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:23,365 INFO L85 PathProgramCache]: Analyzing trace with hash -247238646, now seen corresponding path program 1 times [2024-11-11 21:43:23,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:23,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536576054] [2024-11-11 21:43:23,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:23,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:23,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:23,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536576054] [2024-11-11 21:43:23,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536576054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:23,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:23,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 21:43:23,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781281456] [2024-11-11 21:43:23,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:23,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:43:23,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:23,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:43:23,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:43:23,770 INFO L87 Difference]: Start difference. First operand 393 states and 496 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:24,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:24,646 INFO L93 Difference]: Finished difference Result 887 states and 1171 transitions. [2024-11-11 21:43:24,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 21:43:24,646 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 21:43:24,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:24,648 INFO L225 Difference]: With dead ends: 887 [2024-11-11 21:43:24,649 INFO L226 Difference]: Without dead ends: 805 [2024-11-11 21:43:24,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-11 21:43:24,650 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 4021 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4021 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:24,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4021 Valid, 1595 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:43:24,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-11 21:43:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 397. [2024-11-11 21:43:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3123359580052494) internal successors, (500), 396 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:24,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 500 transitions. [2024-11-11 21:43:24,657 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 500 transitions. Word has length 81 [2024-11-11 21:43:24,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:24,657 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 500 transitions. [2024-11-11 21:43:24,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:24,658 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 500 transitions. [2024-11-11 21:43:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:43:24,658 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:24,659 INFO L218 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] [2024-11-11 21:43:24,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 21:43:24,660 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:24,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:24,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1648828412, now seen corresponding path program 1 times [2024-11-11 21:43:24,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:24,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961795482] [2024-11-11 21:43:24,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:24,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:24,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:24,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:24,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961795482] [2024-11-11 21:43:24,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961795482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:24,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:24,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:24,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75638966] [2024-11-11 21:43:24,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:24,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:24,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:24,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:24,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:24,949 INFO L87 Difference]: Start difference. First operand 397 states and 500 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:25,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:25,450 INFO L93 Difference]: Finished difference Result 652 states and 832 transitions. [2024-11-11 21:43:25,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:25,451 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 21:43:25,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:25,452 INFO L225 Difference]: With dead ends: 652 [2024-11-11 21:43:25,452 INFO L226 Difference]: Without dead ends: 585 [2024-11-11 21:43:25,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:43:25,453 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 2146 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2146 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:25,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2146 Valid, 1750 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:43:25,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-11 21:43:25,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 397. [2024-11-11 21:43:25,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3097112860892388) internal successors, (499), 396 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:25,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 499 transitions. [2024-11-11 21:43:25,458 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 499 transitions. Word has length 81 [2024-11-11 21:43:25,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:25,459 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 499 transitions. [2024-11-11 21:43:25,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 499 transitions. [2024-11-11 21:43:25,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:43:25,460 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:25,460 INFO L218 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] [2024-11-11 21:43:25,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 21:43:25,460 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:25,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:25,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1380394973, now seen corresponding path program 1 times [2024-11-11 21:43:25,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:25,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775941268] [2024-11-11 21:43:25,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:25,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:25,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:25,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775941268] [2024-11-11 21:43:25,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775941268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:25,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:25,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 21:43:25,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049765535] [2024-11-11 21:43:25,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:25,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:43:25,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:25,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:43:25,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:43:25,805 INFO L87 Difference]: Start difference. First operand 397 states and 499 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:26,669 INFO L93 Difference]: Finished difference Result 823 states and 1074 transitions. [2024-11-11 21:43:26,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 21:43:26,669 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 21:43:26,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:26,671 INFO L225 Difference]: With dead ends: 823 [2024-11-11 21:43:26,671 INFO L226 Difference]: Without dead ends: 753 [2024-11-11 21:43:26,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-11 21:43:26,672 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 4086 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4086 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:26,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4086 Valid, 1638 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:43:26,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-11-11 21:43:26,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 401. [2024-11-11 21:43:26,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.3064935064935066) internal successors, (503), 400 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:26,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 503 transitions. [2024-11-11 21:43:26,678 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 503 transitions. Word has length 81 [2024-11-11 21:43:26,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:26,678 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 503 transitions. [2024-11-11 21:43:26,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:26,679 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 503 transitions. [2024-11-11 21:43:26,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:43:26,679 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:26,679 INFO L218 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] [2024-11-11 21:43:26,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 21:43:26,680 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:26,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:26,680 INFO L85 PathProgramCache]: Analyzing trace with hash -90069907, now seen corresponding path program 1 times [2024-11-11 21:43:26,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:26,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447888872] [2024-11-11 21:43:26,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:26,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:26,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:26,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:26,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447888872] [2024-11-11 21:43:26,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447888872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:26,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:26,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:26,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767913527] [2024-11-11 21:43:26,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:26,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:26,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:26,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:26,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:26,904 INFO L87 Difference]: Start difference. First operand 401 states and 503 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:27,446 INFO L93 Difference]: Finished difference Result 652 states and 830 transitions. [2024-11-11 21:43:27,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:27,448 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 21:43:27,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:27,450 INFO L225 Difference]: With dead ends: 652 [2024-11-11 21:43:27,450 INFO L226 Difference]: Without dead ends: 585 [2024-11-11 21:43:27,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:43:27,450 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 2143 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2143 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:27,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2143 Valid, 1754 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:43:27,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-11 21:43:27,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 401. [2024-11-11 21:43:27,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.3038961038961039) internal successors, (502), 400 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:27,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 502 transitions. [2024-11-11 21:43:27,455 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 502 transitions. Word has length 81 [2024-11-11 21:43:27,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:27,455 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 502 transitions. [2024-11-11 21:43:27,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:27,455 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 502 transitions. [2024-11-11 21:43:27,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:43:27,456 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:27,456 INFO L218 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] [2024-11-11 21:43:27,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 21:43:27,456 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:27,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:27,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1355696644, now seen corresponding path program 1 times [2024-11-11 21:43:27,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:27,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664526551] [2024-11-11 21:43:27,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:27,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:27,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:27,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:27,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664526551] [2024-11-11 21:43:27,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664526551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:27,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:27,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:27,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556896446] [2024-11-11 21:43:27,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:27,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:27,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:27,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:27,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:27,659 INFO L87 Difference]: Start difference. First operand 401 states and 502 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:28,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:28,117 INFO L93 Difference]: Finished difference Result 590 states and 736 transitions. [2024-11-11 21:43:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:28,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 21:43:28,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:28,119 INFO L225 Difference]: With dead ends: 590 [2024-11-11 21:43:28,119 INFO L226 Difference]: Without dead ends: 585 [2024-11-11 21:43:28,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:43:28,119 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 2297 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2297 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:28,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2297 Valid, 1430 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:43:28,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-11 21:43:28,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 401. [2024-11-11 21:43:28,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.3012987012987014) internal successors, (501), 400 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:28,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 501 transitions. [2024-11-11 21:43:28,124 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 501 transitions. Word has length 81 [2024-11-11 21:43:28,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:28,124 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 501 transitions. [2024-11-11 21:43:28,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:28,124 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 501 transitions. [2024-11-11 21:43:28,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:43:28,125 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:28,125 INFO L218 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] [2024-11-11 21:43:28,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 21:43:28,125 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:28,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:28,126 INFO L85 PathProgramCache]: Analyzing trace with hash 558624169, now seen corresponding path program 1 times [2024-11-11 21:43:28,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:28,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908995295] [2024-11-11 21:43:28,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:28,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:28,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:28,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908995295] [2024-11-11 21:43:28,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908995295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:28,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:28,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:28,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123365730] [2024-11-11 21:43:28,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:28,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:28,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:28,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:28,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:28,290 INFO L87 Difference]: Start difference. First operand 401 states and 501 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:28,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:28,699 INFO L93 Difference]: Finished difference Result 652 states and 827 transitions. [2024-11-11 21:43:28,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:28,700 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 21:43:28,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:28,701 INFO L225 Difference]: With dead ends: 652 [2024-11-11 21:43:28,701 INFO L226 Difference]: Without dead ends: 585 [2024-11-11 21:43:28,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:43:28,702 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 1919 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1919 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:28,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1919 Valid, 1260 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:43:28,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-11 21:43:28,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 401. [2024-11-11 21:43:28,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.2987012987012987) internal successors, (500), 400 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:28,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 500 transitions. [2024-11-11 21:43:28,707 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 500 transitions. Word has length 81 [2024-11-11 21:43:28,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:28,707 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 500 transitions. [2024-11-11 21:43:28,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:28,707 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 500 transitions. [2024-11-11 21:43:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:43:28,708 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:28,708 INFO L218 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] [2024-11-11 21:43:28,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 21:43:28,708 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:28,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:28,709 INFO L85 PathProgramCache]: Analyzing trace with hash -237124242, now seen corresponding path program 1 times [2024-11-11 21:43:28,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:28,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060872607] [2024-11-11 21:43:28,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:28,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:28,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:28,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060872607] [2024-11-11 21:43:28,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060872607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:28,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:28,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:28,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613477807] [2024-11-11 21:43:28,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:28,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:28,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:28,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:28,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:28,974 INFO L87 Difference]: Start difference. First operand 401 states and 500 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:29,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:29,428 INFO L93 Difference]: Finished difference Result 650 states and 823 transitions. [2024-11-11 21:43:29,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:29,429 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 21:43:29,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:29,430 INFO L225 Difference]: With dead ends: 650 [2024-11-11 21:43:29,430 INFO L226 Difference]: Without dead ends: 585 [2024-11-11 21:43:29,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:43:29,431 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 2215 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2215 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:29,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2215 Valid, 1564 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:43:29,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-11 21:43:29,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 401. [2024-11-11 21:43:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.2961038961038962) internal successors, (499), 400 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:29,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 499 transitions. [2024-11-11 21:43:29,441 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 499 transitions. Word has length 81 [2024-11-11 21:43:29,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:29,441 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 499 transitions. [2024-11-11 21:43:29,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 499 transitions. [2024-11-11 21:43:29,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:43:29,443 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:29,443 INFO L218 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] [2024-11-11 21:43:29,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 21:43:29,443 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:29,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:29,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1610096682, now seen corresponding path program 1 times [2024-11-11 21:43:29,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:29,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979715147] [2024-11-11 21:43:29,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:29,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:29,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:29,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979715147] [2024-11-11 21:43:29,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979715147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:29,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:29,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:29,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283631027] [2024-11-11 21:43:29,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:29,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:29,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:29,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:29,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:29,630 INFO L87 Difference]: Start difference. First operand 401 states and 499 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:30,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:30,069 INFO L93 Difference]: Finished difference Result 683 states and 867 transitions. [2024-11-11 21:43:30,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:30,069 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 21:43:30,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:30,071 INFO L225 Difference]: With dead ends: 683 [2024-11-11 21:43:30,071 INFO L226 Difference]: Without dead ends: 601 [2024-11-11 21:43:30,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:43:30,072 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 2446 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2446 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:30,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2446 Valid, 1494 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:43:30,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-11 21:43:30,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 401. [2024-11-11 21:43:30,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.2935064935064935) internal successors, (498), 400 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 498 transitions. [2024-11-11 21:43:30,082 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 498 transitions. Word has length 81 [2024-11-11 21:43:30,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:30,082 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 498 transitions. [2024-11-11 21:43:30,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:30,083 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 498 transitions. [2024-11-11 21:43:30,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:43:30,084 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:30,085 INFO L218 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] [2024-11-11 21:43:30,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-11 21:43:30,085 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:30,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:30,085 INFO L85 PathProgramCache]: Analyzing trace with hash -302100420, now seen corresponding path program 1 times [2024-11-11 21:43:30,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:30,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960789403] [2024-11-11 21:43:30,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:30,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:30,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:30,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960789403] [2024-11-11 21:43:30,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960789403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:30,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:30,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:30,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532249742] [2024-11-11 21:43:30,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:30,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:30,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:30,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:30,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:30,372 INFO L87 Difference]: Start difference. First operand 401 states and 498 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:30,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:30,847 INFO L93 Difference]: Finished difference Result 655 states and 826 transitions. [2024-11-11 21:43:30,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:30,847 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 21:43:30,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:30,849 INFO L225 Difference]: With dead ends: 655 [2024-11-11 21:43:30,849 INFO L226 Difference]: Without dead ends: 585 [2024-11-11 21:43:30,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:43:30,850 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 2184 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2184 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:30,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2184 Valid, 1620 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:43:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-11 21:43:30,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 401. [2024-11-11 21:43:30,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.290909090909091) internal successors, (497), 400 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:30,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 497 transitions. [2024-11-11 21:43:30,855 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 497 transitions. Word has length 81 [2024-11-11 21:43:30,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:30,855 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 497 transitions. [2024-11-11 21:43:30,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 497 transitions. [2024-11-11 21:43:30,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:43:30,856 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:30,856 INFO L218 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] [2024-11-11 21:43:30,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-11 21:43:30,856 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:30,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:30,857 INFO L85 PathProgramCache]: Analyzing trace with hash -286808248, now seen corresponding path program 1 times [2024-11-11 21:43:30,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:30,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519203339] [2024-11-11 21:43:30,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:30,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:31,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:31,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519203339] [2024-11-11 21:43:31,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519203339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:31,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:31,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:31,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945967427] [2024-11-11 21:43:31,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:31,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:31,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:31,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:31,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:31,043 INFO L87 Difference]: Start difference. First operand 401 states and 497 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:31,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:31,535 INFO L93 Difference]: Finished difference Result 726 states and 921 transitions. [2024-11-11 21:43:31,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:31,536 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 21:43:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:31,537 INFO L225 Difference]: With dead ends: 726 [2024-11-11 21:43:31,537 INFO L226 Difference]: Without dead ends: 621 [2024-11-11 21:43:31,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:43:31,538 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 1673 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:31,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 1684 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:43:31,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-11 21:43:31,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 401. [2024-11-11 21:43:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.2883116883116883) internal successors, (496), 400 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 496 transitions. [2024-11-11 21:43:31,543 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 496 transitions. Word has length 81 [2024-11-11 21:43:31,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:31,543 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 496 transitions. [2024-11-11 21:43:31,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 496 transitions. [2024-11-11 21:43:31,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:43:31,544 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:31,544 INFO L218 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] [2024-11-11 21:43:31,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-11 21:43:31,545 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:31,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:31,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1055423202, now seen corresponding path program 1 times [2024-11-11 21:43:31,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:31,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485554449] [2024-11-11 21:43:31,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:31,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:31,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:31,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:31,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485554449] [2024-11-11 21:43:31,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485554449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:31,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:31,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:31,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058040762] [2024-11-11 21:43:31,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:31,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:31,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:31,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:31,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:31,736 INFO L87 Difference]: Start difference. First operand 401 states and 496 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:32,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:32,206 INFO L93 Difference]: Finished difference Result 590 states and 728 transitions. [2024-11-11 21:43:32,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:32,206 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 21:43:32,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:32,208 INFO L225 Difference]: With dead ends: 590 [2024-11-11 21:43:32,208 INFO L226 Difference]: Without dead ends: 585 [2024-11-11 21:43:32,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:43:32,208 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 2175 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2175 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:32,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2175 Valid, 1620 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:43:32,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-11 21:43:32,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 401. [2024-11-11 21:43:32,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.2857142857142858) internal successors, (495), 400 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 495 transitions. [2024-11-11 21:43:32,213 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 495 transitions. Word has length 81 [2024-11-11 21:43:32,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:32,213 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 495 transitions. [2024-11-11 21:43:32,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:32,214 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 495 transitions. [2024-11-11 21:43:32,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:43:32,214 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:32,214 INFO L218 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] [2024-11-11 21:43:32,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-11 21:43:32,215 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:32,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:32,215 INFO L85 PathProgramCache]: Analyzing trace with hash 856773900, now seen corresponding path program 1 times [2024-11-11 21:43:32,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:32,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421689635] [2024-11-11 21:43:32,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:32,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:32,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:32,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421689635] [2024-11-11 21:43:32,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421689635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:32,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:32,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 21:43:32,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088867747] [2024-11-11 21:43:32,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:32,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:43:32,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:32,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:43:32,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:43:32,509 INFO L87 Difference]: Start difference. First operand 401 states and 495 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:33,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:33,283 INFO L93 Difference]: Finished difference Result 826 states and 1066 transitions. [2024-11-11 21:43:33,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 21:43:33,284 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 21:43:33,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:33,286 INFO L225 Difference]: With dead ends: 826 [2024-11-11 21:43:33,286 INFO L226 Difference]: Without dead ends: 809 [2024-11-11 21:43:33,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-11 21:43:33,287 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 4698 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4698 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:33,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4698 Valid, 1696 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:33,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2024-11-11 21:43:33,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 405. [2024-11-11 21:43:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 389 states have (on average 1.2827763496143958) internal successors, (499), 404 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 499 transitions. [2024-11-11 21:43:33,291 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 499 transitions. Word has length 81 [2024-11-11 21:43:33,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:33,292 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 499 transitions. [2024-11-11 21:43:33,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:33,292 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 499 transitions. [2024-11-11 21:43:33,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:43:33,292 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:33,293 INFO L218 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] [2024-11-11 21:43:33,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-11 21:43:33,293 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:33,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:33,293 INFO L85 PathProgramCache]: Analyzing trace with hash -544552721, now seen corresponding path program 1 times [2024-11-11 21:43:33,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:33,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752986409] [2024-11-11 21:43:33,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:33,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:33,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:33,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752986409] [2024-11-11 21:43:33,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752986409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:33,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:33,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:33,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680623556] [2024-11-11 21:43:33,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:33,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:33,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:33,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:33,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:33,486 INFO L87 Difference]: Start difference. First operand 405 states and 499 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:34,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:34,022 INFO L93 Difference]: Finished difference Result 656 states and 824 transitions. [2024-11-11 21:43:34,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:34,023 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 21:43:34,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:34,024 INFO L225 Difference]: With dead ends: 656 [2024-11-11 21:43:34,024 INFO L226 Difference]: Without dead ends: 589 [2024-11-11 21:43:34,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:43:34,025 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 2172 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2172 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:34,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2172 Valid, 1620 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:43:34,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-11 21:43:34,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 405. [2024-11-11 21:43:34,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 389 states have (on average 1.2802056555269923) internal successors, (498), 404 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 498 transitions. [2024-11-11 21:43:34,031 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 498 transitions. Word has length 81 [2024-11-11 21:43:34,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:34,031 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 498 transitions. [2024-11-11 21:43:34,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:34,031 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 498 transitions. [2024-11-11 21:43:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:43:34,032 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:34,032 INFO L218 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] [2024-11-11 21:43:34,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-11 21:43:34,033 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:34,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:34,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1810559777, now seen corresponding path program 1 times [2024-11-11 21:43:34,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:34,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078249373] [2024-11-11 21:43:34,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:34,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:34,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:34,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078249373] [2024-11-11 21:43:34,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078249373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:34,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:34,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:34,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809495844] [2024-11-11 21:43:34,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:34,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:34,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:34,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:34,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:34,191 INFO L87 Difference]: Start difference. First operand 405 states and 498 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:34,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:34,608 INFO L93 Difference]: Finished difference Result 594 states and 730 transitions. [2024-11-11 21:43:34,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:34,608 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 21:43:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:34,610 INFO L225 Difference]: With dead ends: 594 [2024-11-11 21:43:34,610 INFO L226 Difference]: Without dead ends: 589 [2024-11-11 21:43:34,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:43:34,611 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 1231 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:34,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 1312 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:43:34,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-11 21:43:34,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 405. [2024-11-11 21:43:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 389 states have (on average 1.2776349614395888) internal successors, (497), 404 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:34,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 497 transitions. [2024-11-11 21:43:34,616 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 497 transitions. Word has length 81 [2024-11-11 21:43:34,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:34,616 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 497 transitions. [2024-11-11 21:43:34,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 497 transitions. [2024-11-11 21:43:34,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-11 21:43:34,617 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:34,617 INFO L218 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] [2024-11-11 21:43:34,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-11 21:43:34,617 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:34,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:34,617 INFO L85 PathProgramCache]: Analyzing trace with hash -423596437, now seen corresponding path program 1 times [2024-11-11 21:43:34,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:34,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083401026] [2024-11-11 21:43:34,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:34,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:34,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:34,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083401026] [2024-11-11 21:43:34,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083401026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:34,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:34,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:34,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024480095] [2024-11-11 21:43:34,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:34,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:34,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:34,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:34,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:34,814 INFO L87 Difference]: Start difference. First operand 405 states and 497 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:35,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:35,259 INFO L93 Difference]: Finished difference Result 659 states and 824 transitions. [2024-11-11 21:43:35,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:35,259 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-11 21:43:35,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:35,261 INFO L225 Difference]: With dead ends: 659 [2024-11-11 21:43:35,261 INFO L226 Difference]: Without dead ends: 589 [2024-11-11 21:43:35,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:43:35,262 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 2432 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2432 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:35,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2432 Valid, 1328 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:43:35,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-11 21:43:35,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 401. [2024-11-11 21:43:35,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.277922077922078) internal successors, (492), 400 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:35,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 492 transitions. [2024-11-11 21:43:35,266 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 492 transitions. Word has length 82 [2024-11-11 21:43:35,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:35,267 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 492 transitions. [2024-11-11 21:43:35,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:35,267 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 492 transitions. [2024-11-11 21:43:35,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-11 21:43:35,268 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:35,268 INFO L218 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] [2024-11-11 21:43:35,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-11 21:43:35,268 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:35,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:35,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1323094470, now seen corresponding path program 1 times [2024-11-11 21:43:35,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:35,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882627358] [2024-11-11 21:43:35,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:35,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:35,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:35,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882627358] [2024-11-11 21:43:35,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882627358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:35,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:35,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:35,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851117395] [2024-11-11 21:43:35,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:35,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:35,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:35,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:35,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:35,445 INFO L87 Difference]: Start difference. First operand 401 states and 492 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:36,048 INFO L93 Difference]: Finished difference Result 679 states and 854 transitions. [2024-11-11 21:43:36,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:36,049 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-11 21:43:36,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:36,050 INFO L225 Difference]: With dead ends: 679 [2024-11-11 21:43:36,050 INFO L226 Difference]: Without dead ends: 597 [2024-11-11 21:43:36,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:43:36,051 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 1980 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1980 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:36,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1980 Valid, 1777 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:36,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-11 21:43:36,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 397. [2024-11-11 21:43:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.2782152230971129) internal successors, (487), 396 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 487 transitions. [2024-11-11 21:43:36,056 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 487 transitions. Word has length 82 [2024-11-11 21:43:36,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:36,056 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 487 transitions. [2024-11-11 21:43:36,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:36,056 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 487 transitions. [2024-11-11 21:43:36,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-11 21:43:36,057 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:36,057 INFO L218 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] [2024-11-11 21:43:36,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-11 21:43:36,057 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:36,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:36,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1458444177, now seen corresponding path program 1 times [2024-11-11 21:43:36,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:36,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755812201] [2024-11-11 21:43:36,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:36,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:36,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:36,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755812201] [2024-11-11 21:43:36,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755812201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:36,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:36,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:36,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239453477] [2024-11-11 21:43:36,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:36,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:36,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:36,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:36,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:36,237 INFO L87 Difference]: Start difference. First operand 397 states and 487 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:36,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:36,702 INFO L93 Difference]: Finished difference Result 614 states and 757 transitions. [2024-11-11 21:43:36,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:36,702 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-11 21:43:36,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:36,704 INFO L225 Difference]: With dead ends: 614 [2024-11-11 21:43:36,704 INFO L226 Difference]: Without dead ends: 597 [2024-11-11 21:43:36,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:43:36,705 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 1922 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1922 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:36,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1922 Valid, 1825 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:43:36,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-11 21:43:36,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 393. [2024-11-11 21:43:36,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.2785145888594165) internal successors, (482), 392 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:36,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 482 transitions. [2024-11-11 21:43:36,708 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 482 transitions. Word has length 82 [2024-11-11 21:43:36,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:36,709 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 482 transitions. [2024-11-11 21:43:36,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:36,709 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 482 transitions. [2024-11-11 21:43:36,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-11 21:43:36,709 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:36,709 INFO L218 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] [2024-11-11 21:43:36,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-11 21:43:36,710 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:36,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:36,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1687929497, now seen corresponding path program 1 times [2024-11-11 21:43:36,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:36,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813101100] [2024-11-11 21:43:36,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:36,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:37,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:37,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813101100] [2024-11-11 21:43:37,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813101100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:37,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:37,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 21:43:37,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151748384] [2024-11-11 21:43:37,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:37,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 21:43:37,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:37,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 21:43:37,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:43:37,082 INFO L87 Difference]: Start difference. First operand 393 states and 482 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:37,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:37,583 INFO L93 Difference]: Finished difference Result 906 states and 1133 transitions. [2024-11-11 21:43:37,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:37,584 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-11 21:43:37,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:37,585 INFO L225 Difference]: With dead ends: 906 [2024-11-11 21:43:37,585 INFO L226 Difference]: Without dead ends: 723 [2024-11-11 21:43:37,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-11 21:43:37,586 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 1306 mSDsluCounter, 2658 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 3205 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:37,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1306 Valid, 3205 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:43:37,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-11-11 21:43:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 275. [2024-11-11 21:43:37,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 264 states have (on average 1.2651515151515151) internal successors, (334), 274 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:37,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 334 transitions. [2024-11-11 21:43:37,590 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 334 transitions. Word has length 83 [2024-11-11 21:43:37,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:37,591 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 334 transitions. [2024-11-11 21:43:37,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 334 transitions. [2024-11-11 21:43:37,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-11 21:43:37,591 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:37,591 INFO L218 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] [2024-11-11 21:43:37,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-11 21:43:37,591 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:37,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:37,592 INFO L85 PathProgramCache]: Analyzing trace with hash -119228615, now seen corresponding path program 1 times [2024-11-11 21:43:37,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:37,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129489293] [2024-11-11 21:43:37,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:37,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:38,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:38,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129489293] [2024-11-11 21:43:38,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129489293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:38,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:38,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 21:43:38,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403038103] [2024-11-11 21:43:38,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:38,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:43:38,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:38,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:43:38,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:43:38,068 INFO L87 Difference]: Start difference. First operand 275 states and 334 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:38,465 INFO L93 Difference]: Finished difference Result 452 states and 580 transitions. [2024-11-11 21:43:38,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:43:38,465 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-11 21:43:38,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:38,466 INFO L225 Difference]: With dead ends: 452 [2024-11-11 21:43:38,467 INFO L226 Difference]: Without dead ends: 354 [2024-11-11 21:43:38,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-11 21:43:38,467 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 1397 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:38,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 2061 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:43:38,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-11 21:43:38,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 242. [2024-11-11 21:43:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 234 states have (on average 1.2564102564102564) internal successors, (294), 241 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 294 transitions. [2024-11-11 21:43:38,470 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 294 transitions. Word has length 83 [2024-11-11 21:43:38,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:38,470 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 294 transitions. [2024-11-11 21:43:38,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:38,470 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 294 transitions. [2024-11-11 21:43:38,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-11 21:43:38,471 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:38,471 INFO L218 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] [2024-11-11 21:43:38,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-11 21:43:38,471 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:38,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:38,473 INFO L85 PathProgramCache]: Analyzing trace with hash 2051820758, now seen corresponding path program 1 times [2024-11-11 21:43:38,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:38,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893566446] [2024-11-11 21:43:38,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:38,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:38,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:38,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:38,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893566446] [2024-11-11 21:43:38,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893566446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:38,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:38,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-11 21:43:38,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495783981] [2024-11-11 21:43:38,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:38,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 21:43:38,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:38,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 21:43:38,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:43:38,867 INFO L87 Difference]: Start difference. First operand 242 states and 294 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:39,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:39,490 INFO L93 Difference]: Finished difference Result 649 states and 837 transitions. [2024-11-11 21:43:39,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 21:43:39,491 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-11 21:43:39,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:39,492 INFO L225 Difference]: With dead ends: 649 [2024-11-11 21:43:39,492 INFO L226 Difference]: Without dead ends: 568 [2024-11-11 21:43:39,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-11-11 21:43:39,493 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 1154 mSDsluCounter, 2797 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 3213 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:39,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 3213 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:43:39,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-11 21:43:39,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 226. [2024-11-11 21:43:39,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 220 states have (on average 1.25) internal successors, (275), 225 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:39,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 275 transitions. [2024-11-11 21:43:39,496 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 275 transitions. Word has length 83 [2024-11-11 21:43:39,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:39,497 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 275 transitions. [2024-11-11 21:43:39,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:39,497 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 275 transitions. [2024-11-11 21:43:39,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-11 21:43:39,497 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:39,497 INFO L218 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] [2024-11-11 21:43:39,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-11 21:43:39,498 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:39,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:39,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1787055611, now seen corresponding path program 1 times [2024-11-11 21:43:39,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:39,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814361494] [2024-11-11 21:43:39,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:39,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:39,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:39,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:39,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814361494] [2024-11-11 21:43:39,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814361494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:39,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:39,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-11 21:43:39,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257202597] [2024-11-11 21:43:39,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:39,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 21:43:39,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:39,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 21:43:39,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:43:39,868 INFO L87 Difference]: Start difference. First operand 226 states and 275 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:40,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:40,416 INFO L93 Difference]: Finished difference Result 585 states and 771 transitions. [2024-11-11 21:43:40,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 21:43:40,417 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-11 21:43:40,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:40,418 INFO L225 Difference]: With dead ends: 585 [2024-11-11 21:43:40,418 INFO L226 Difference]: Without dead ends: 457 [2024-11-11 21:43:40,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-11-11 21:43:40,419 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 741 mSDsluCounter, 4276 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 4819 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:40,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 4819 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:43:40,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-11 21:43:40,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 163. [2024-11-11 21:43:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 161 states have (on average 1.2422360248447204) internal successors, (200), 162 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 200 transitions. [2024-11-11 21:43:40,421 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 200 transitions. Word has length 83 [2024-11-11 21:43:40,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:40,421 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 200 transitions. [2024-11-11 21:43:40,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:40,421 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 200 transitions. [2024-11-11 21:43:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-11 21:43:40,422 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:40,422 INFO L218 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-11-11 21:43:40,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-11 21:43:40,422 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:40,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:40,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1707932206, now seen corresponding path program 1 times [2024-11-11 21:43:40,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:40,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458291194] [2024-11-11 21:43:40,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:40,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:40,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:40,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458291194] [2024-11-11 21:43:40,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458291194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:40,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:40,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:40,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84275007] [2024-11-11 21:43:40,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:40,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:40,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:40,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:40,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:40,582 INFO L87 Difference]: Start difference. First operand 163 states and 200 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 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-11-11 21:43:40,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:40,866 INFO L93 Difference]: Finished difference Result 338 states and 441 transitions. [2024-11-11 21:43:40,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:40,867 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 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-11-11 21:43:40,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:40,867 INFO L225 Difference]: With dead ends: 338 [2024-11-11 21:43:40,867 INFO L226 Difference]: Without dead ends: 255 [2024-11-11 21:43:40,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:43:40,868 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 413 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:40,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 764 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:43:40,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-11 21:43:40,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 163. [2024-11-11 21:43:40,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 161 states have (on average 1.236024844720497) internal successors, (199), 162 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 199 transitions. [2024-11-11 21:43:40,870 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 199 transitions. Word has length 84 [2024-11-11 21:43:40,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:40,870 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 199 transitions. [2024-11-11 21:43:40,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 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-11-11 21:43:40,870 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 199 transitions. [2024-11-11 21:43:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-11 21:43:40,870 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:40,871 INFO L218 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-11-11 21:43:40,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-11 21:43:40,871 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:40,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:40,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1161243347, now seen corresponding path program 1 times [2024-11-11 21:43:40,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:40,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378306745] [2024-11-11 21:43:40,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:40,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:41,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:42,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:42,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378306745] [2024-11-11 21:43:42,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378306745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:42,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:42,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-11-11 21:43:42,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314182823] [2024-11-11 21:43:42,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:42,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-11 21:43:42,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:42,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-11 21:43:42,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2024-11-11 21:43:42,001 INFO L87 Difference]: Start difference. First operand 163 states and 199 transitions. Second operand has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 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-11-11 21:43:44,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:44,406 INFO L93 Difference]: Finished difference Result 631 states and 835 transitions. [2024-11-11 21:43:44,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-11 21:43:44,406 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 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-11-11 21:43:44,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:44,408 INFO L225 Difference]: With dead ends: 631 [2024-11-11 21:43:44,408 INFO L226 Difference]: Without dead ends: 625 [2024-11-11 21:43:44,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=426, Invalid=2124, Unknown=0, NotChecked=0, Total=2550 [2024-11-11 21:43:44,409 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 1295 mSDsluCounter, 7337 mSDsCounter, 0 mSdLazyCounter, 3884 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 7883 SdHoareTripleChecker+Invalid, 3896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:44,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 7883 Invalid, 3896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3884 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 21:43:44,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-11 21:43:44,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 184. [2024-11-11 21:43:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 182 states have (on average 1.2362637362637363) internal successors, (225), 183 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:44,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 225 transitions. [2024-11-11 21:43:44,412 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 225 transitions. Word has length 86 [2024-11-11 21:43:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:44,413 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 225 transitions. [2024-11-11 21:43:44,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 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-11-11 21:43:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 225 transitions. [2024-11-11 21:43:44,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-11 21:43:44,413 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:44,413 INFO L218 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-11-11 21:43:44,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-11 21:43:44,413 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:44,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:44,414 INFO L85 PathProgramCache]: Analyzing trace with hash 91928287, now seen corresponding path program 1 times [2024-11-11 21:43:44,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:44,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144167670] [2024-11-11 21:43:44,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:44,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:44,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:44,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:44,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144167670] [2024-11-11 21:43:44,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144167670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:44,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:44,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 21:43:44,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682975383] [2024-11-11 21:43:44,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:44,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:43:44,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:44,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:43:44,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:43:44,757 INFO L87 Difference]: Start difference. First operand 184 states and 225 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 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-11-11 21:43:45,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:45,063 INFO L93 Difference]: Finished difference Result 262 states and 336 transitions. [2024-11-11 21:43:45,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:43:45,063 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 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-11-11 21:43:45,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:45,064 INFO L225 Difference]: With dead ends: 262 [2024-11-11 21:43:45,064 INFO L226 Difference]: Without dead ends: 256 [2024-11-11 21:43:45,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-11-11 21:43:45,064 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 831 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:45,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1185 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:43:45,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-11 21:43:45,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 157. [2024-11-11 21:43:45,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.2371794871794872) internal successors, (193), 156 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:45,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 193 transitions. [2024-11-11 21:43:45,066 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 193 transitions. Word has length 87 [2024-11-11 21:43:45,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:45,067 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 193 transitions. [2024-11-11 21:43:45,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 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-11-11 21:43:45,067 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 193 transitions. [2024-11-11 21:43:45,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-11 21:43:45,067 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:45,067 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:43:45,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-11 21:43:45,067 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:45,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:45,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2132814901, now seen corresponding path program 1 times [2024-11-11 21:43:45,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:45,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854857487] [2024-11-11 21:43:45,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:45,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:45,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:45,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:45,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854857487] [2024-11-11 21:43:45,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854857487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:45,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:45,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:43:45,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894099436] [2024-11-11 21:43:45,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:45,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:43:45,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:45,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:43:45,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:43:45,164 INFO L87 Difference]: Start difference. First operand 157 states and 193 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:45,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:45,301 INFO L93 Difference]: Finished difference Result 807 states and 1143 transitions. [2024-11-11 21:43:45,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 21:43:45,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-11-11 21:43:45,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:45,303 INFO L225 Difference]: With dead ends: 807 [2024-11-11 21:43:45,303 INFO L226 Difference]: Without dead ends: 742 [2024-11-11 21:43:45,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-11 21:43:45,304 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 1268 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:45,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 2157 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:43:45,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-11-11 21:43:45,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 220. [2024-11-11 21:43:45,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.3013698630136987) internal successors, (285), 219 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:45,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 285 transitions. [2024-11-11 21:43:45,313 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 285 transitions. Word has length 114 [2024-11-11 21:43:45,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:45,313 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 285 transitions. [2024-11-11 21:43:45,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:45,313 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 285 transitions. [2024-11-11 21:43:45,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 21:43:45,314 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:45,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:43:45,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-11 21:43:45,314 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:45,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:45,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1778175941, now seen corresponding path program 1 times [2024-11-11 21:43:45,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:45,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981028390] [2024-11-11 21:43:45,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:45,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:45,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:45,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981028390] [2024-11-11 21:43:45,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981028390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:45,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:45,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:43:45,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553093192] [2024-11-11 21:43:45,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:45,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:43:45,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:45,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:43:45,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:43:45,441 INFO L87 Difference]: Start difference. First operand 220 states and 285 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:45,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:45,530 INFO L93 Difference]: Finished difference Result 925 states and 1313 transitions. [2024-11-11 21:43:45,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:43:45,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-11 21:43:45,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:45,533 INFO L225 Difference]: With dead ends: 925 [2024-11-11 21:43:45,533 INFO L226 Difference]: Without dead ends: 797 [2024-11-11 21:43:45,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:43:45,534 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 1034 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:45,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 1201 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:43:45,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-11-11 21:43:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 346. [2024-11-11 21:43:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.3623188405797102) internal successors, (470), 345 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 470 transitions. [2024-11-11 21:43:45,542 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 470 transitions. Word has length 116 [2024-11-11 21:43:45,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:45,542 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 470 transitions. [2024-11-11 21:43:45,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:45,543 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 470 transitions. [2024-11-11 21:43:45,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 21:43:45,543 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:45,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:43:45,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-11 21:43:45,543 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:45,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:45,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1881237749, now seen corresponding path program 1 times [2024-11-11 21:43:45,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:45,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115300889] [2024-11-11 21:43:45,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:45,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:45,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:45,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:45,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115300889] [2024-11-11 21:43:45,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115300889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:45,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:45,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:43:45,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942123705] [2024-11-11 21:43:45,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:45,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:43:45,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:45,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:43:45,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:43:45,647 INFO L87 Difference]: Start difference. First operand 346 states and 470 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:45,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:45,738 INFO L93 Difference]: Finished difference Result 1051 states and 1498 transitions. [2024-11-11 21:43:45,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:43:45,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-11 21:43:45,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:45,744 INFO L225 Difference]: With dead ends: 1051 [2024-11-11 21:43:45,745 INFO L226 Difference]: Without dead ends: 923 [2024-11-11 21:43:45,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:43:45,749 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 1034 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:45,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 1131 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:43:45,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-11 21:43:45,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 535. [2024-11-11 21:43:45,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.398876404494382) internal successors, (747), 534 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:45,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 747 transitions. [2024-11-11 21:43:45,757 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 747 transitions. Word has length 116 [2024-11-11 21:43:45,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:45,757 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 747 transitions. [2024-11-11 21:43:45,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:45,757 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 747 transitions. [2024-11-11 21:43:45,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 21:43:45,758 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:45,758 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:43:45,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-11 21:43:45,758 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:45,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:45,758 INFO L85 PathProgramCache]: Analyzing trace with hash -455453719, now seen corresponding path program 1 times [2024-11-11 21:43:45,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:45,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178367239] [2024-11-11 21:43:45,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:45,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:45,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:45,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178367239] [2024-11-11 21:43:45,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178367239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:45,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:45,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:43:45,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162301205] [2024-11-11 21:43:45,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:45,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:43:45,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:45,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:43:45,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:43:45,863 INFO L87 Difference]: Start difference. First operand 535 states and 747 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:45,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:45,933 INFO L93 Difference]: Finished difference Result 1177 states and 1683 transitions. [2024-11-11 21:43:45,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:43:45,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-11 21:43:45,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:45,935 INFO L225 Difference]: With dead ends: 1177 [2024-11-11 21:43:45,935 INFO L226 Difference]: Without dead ends: 1049 [2024-11-11 21:43:45,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:43:45,936 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 1109 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:45,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 1156 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:43:45,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2024-11-11 21:43:45,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 661. [2024-11-11 21:43:45,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.412121212121212) internal successors, (932), 660 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:45,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 932 transitions. [2024-11-11 21:43:45,943 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 932 transitions. Word has length 116 [2024-11-11 21:43:45,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:45,943 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 932 transitions. [2024-11-11 21:43:45,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:45,943 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 932 transitions. [2024-11-11 21:43:45,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 21:43:45,944 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:45,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:43:45,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-11 21:43:45,944 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:45,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:45,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2067568748, now seen corresponding path program 1 times [2024-11-11 21:43:45,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:45,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267419635] [2024-11-11 21:43:45,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:45,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:46,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:46,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267419635] [2024-11-11 21:43:46,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267419635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:46,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:46,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:43:46,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959446631] [2024-11-11 21:43:46,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:46,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:43:46,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:46,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:43:46,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:43:46,104 INFO L87 Difference]: Start difference. First operand 661 states and 932 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:46,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:46,191 INFO L93 Difference]: Finished difference Result 1232 states and 1767 transitions. [2024-11-11 21:43:46,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:43:46,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-11 21:43:46,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:46,193 INFO L225 Difference]: With dead ends: 1232 [2024-11-11 21:43:46,193 INFO L226 Difference]: Without dead ends: 663 [2024-11-11 21:43:46,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:43:46,194 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 172 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:46,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 550 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:43:46,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2024-11-11 21:43:46,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 661. [2024-11-11 21:43:46,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.4045454545454545) internal successors, (927), 660 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:46,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 927 transitions. [2024-11-11 21:43:46,200 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 927 transitions. Word has length 116 [2024-11-11 21:43:46,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:46,200 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 927 transitions. [2024-11-11 21:43:46,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:46,200 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 927 transitions. [2024-11-11 21:43:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 21:43:46,201 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:46,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:43:46,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-11 21:43:46,201 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:46,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:46,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1298275755, now seen corresponding path program 1 times [2024-11-11 21:43:46,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:46,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413927202] [2024-11-11 21:43:46,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:46,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:46,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:46,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:46,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413927202] [2024-11-11 21:43:46,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413927202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:46,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:46,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:43:46,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937530611] [2024-11-11 21:43:46,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:46,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:43:46,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:46,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:43:46,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:43:46,245 INFO L87 Difference]: Start difference. First operand 661 states and 927 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:46,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:46,260 INFO L93 Difference]: Finished difference Result 1741 states and 2488 transitions. [2024-11-11 21:43:46,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:43:46,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-11 21:43:46,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:46,262 INFO L225 Difference]: With dead ends: 1741 [2024-11-11 21:43:46,262 INFO L226 Difference]: Without dead ends: 1172 [2024-11-11 21:43:46,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:43:46,263 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 82 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:46,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 449 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:43:46,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2024-11-11 21:43:46,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1170. [2024-11-11 21:43:46,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1169 states have (on average 1.4029084687767321) internal successors, (1640), 1169 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:46,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1640 transitions. [2024-11-11 21:43:46,274 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1640 transitions. Word has length 116 [2024-11-11 21:43:46,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:46,274 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1640 transitions. [2024-11-11 21:43:46,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:46,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1640 transitions. [2024-11-11 21:43:46,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 21:43:46,275 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:46,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:43:46,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-11 21:43:46,275 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:46,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:46,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1451686365, now seen corresponding path program 1 times [2024-11-11 21:43:46,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:46,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090218282] [2024-11-11 21:43:46,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:46,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:46,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:46,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090218282] [2024-11-11 21:43:46,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090218282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:46,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:46,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:43:46,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733667624] [2024-11-11 21:43:46,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:46,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:43:46,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:46,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:43:46,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:43:46,410 INFO L87 Difference]: Start difference. First operand 1170 states and 1640 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:46,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:46,509 INFO L93 Difference]: Finished difference Result 2377 states and 3366 transitions. [2024-11-11 21:43:46,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:43:46,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-11 21:43:46,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:46,512 INFO L225 Difference]: With dead ends: 2377 [2024-11-11 21:43:46,512 INFO L226 Difference]: Without dead ends: 2136 [2024-11-11 21:43:46,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:43:46,513 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 1025 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:46,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 1195 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:43:46,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2024-11-11 21:43:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 1409. [2024-11-11 21:43:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1408 states have (on average 1.4076704545454546) internal successors, (1982), 1408 states have internal predecessors, (1982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 1982 transitions. [2024-11-11 21:43:46,531 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 1982 transitions. Word has length 116 [2024-11-11 21:43:46,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:46,531 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 1982 transitions. [2024-11-11 21:43:46,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1982 transitions. [2024-11-11 21:43:46,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 21:43:46,532 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:46,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:43:46,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-11 21:43:46,533 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:46,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:46,533 INFO L85 PathProgramCache]: Analyzing trace with hash -871511505, now seen corresponding path program 1 times [2024-11-11 21:43:46,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:46,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841315481] [2024-11-11 21:43:46,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:46,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:46,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:46,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841315481] [2024-11-11 21:43:46,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841315481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:46,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:46,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:43:46,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641090433] [2024-11-11 21:43:46,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:46,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:43:46,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:46,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:43:46,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:43:46,644 INFO L87 Difference]: Start difference. First operand 1409 states and 1982 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:46,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:46,723 INFO L93 Difference]: Finished difference Result 2616 states and 3708 transitions. [2024-11-11 21:43:46,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:43:46,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-11 21:43:46,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:46,726 INFO L225 Difference]: With dead ends: 2616 [2024-11-11 21:43:46,726 INFO L226 Difference]: Without dead ends: 2375 [2024-11-11 21:43:46,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:43:46,727 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 965 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:46,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1326 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:43:46,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2024-11-11 21:43:46,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 1648. [2024-11-11 21:43:46,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1647 states have (on average 1.4110503946569521) internal successors, (2324), 1647 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2324 transitions. [2024-11-11 21:43:46,747 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2324 transitions. Word has length 116 [2024-11-11 21:43:46,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:46,747 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2324 transitions. [2024-11-11 21:43:46,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:46,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2324 transitions. [2024-11-11 21:43:46,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-11 21:43:46,748 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:46,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:43:46,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-11 21:43:46,749 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:46,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:46,749 INFO L85 PathProgramCache]: Analyzing trace with hash -389045736, now seen corresponding path program 1 times [2024-11-11 21:43:46,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:46,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080720752] [2024-11-11 21:43:46,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:46,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:46,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:46,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:46,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080720752] [2024-11-11 21:43:46,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080720752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:46,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:46,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:43:46,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074695022] [2024-11-11 21:43:46,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:46,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:43:46,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:46,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:43:46,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:43:46,826 INFO L87 Difference]: Start difference. First operand 1648 states and 2324 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:46,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:46,844 INFO L93 Difference]: Finished difference Result 4123 states and 5839 transitions. [2024-11-11 21:43:46,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:43:46,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2024-11-11 21:43:46,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:46,848 INFO L225 Difference]: With dead ends: 4123 [2024-11-11 21:43:46,848 INFO L226 Difference]: Without dead ends: 2567 [2024-11-11 21:43:46,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:43:46,850 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 95 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:46,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 418 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:43:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2024-11-11 21:43:46,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2461. [2024-11-11 21:43:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2461 states, 2460 states have (on average 1.4048780487804877) internal successors, (3456), 2460 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 3456 transitions. [2024-11-11 21:43:46,871 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 3456 transitions. Word has length 117 [2024-11-11 21:43:46,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:46,871 INFO L471 AbstractCegarLoop]: Abstraction has 2461 states and 3456 transitions. [2024-11-11 21:43:46,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:46,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 3456 transitions. [2024-11-11 21:43:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-11 21:43:46,872 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:46,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:43:46,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-11 21:43:46,872 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:46,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:46,873 INFO L85 PathProgramCache]: Analyzing trace with hash 966003247, now seen corresponding path program 1 times [2024-11-11 21:43:46,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:46,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058626142] [2024-11-11 21:43:46,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:46,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:46,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:46,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:46,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058626142] [2024-11-11 21:43:46,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058626142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:46,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:46,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:43:46,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11465061] [2024-11-11 21:43:46,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:46,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:43:46,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:46,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:43:46,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:43:46,949 INFO L87 Difference]: Start difference. First operand 2461 states and 3456 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:46,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:46,970 INFO L93 Difference]: Finished difference Result 7043 states and 9899 transitions. [2024-11-11 21:43:46,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:43:46,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-11-11 21:43:46,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:46,976 INFO L225 Difference]: With dead ends: 7043 [2024-11-11 21:43:46,976 INFO L226 Difference]: Without dead ends: 4674 [2024-11-11 21:43:46,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:43:46,979 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 88 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:46,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 418 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:43:46,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4674 states. [2024-11-11 21:43:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4674 to 4516. [2024-11-11 21:43:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4516 states, 4515 states have (on average 1.3966777408637874) internal successors, (6306), 4515 states have internal predecessors, (6306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4516 states to 4516 states and 6306 transitions. [2024-11-11 21:43:47,018 INFO L78 Accepts]: Start accepts. Automaton has 4516 states and 6306 transitions. Word has length 118 [2024-11-11 21:43:47,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:47,018 INFO L471 AbstractCegarLoop]: Abstraction has 4516 states and 6306 transitions. [2024-11-11 21:43:47,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:47,018 INFO L276 IsEmpty]: Start isEmpty. Operand 4516 states and 6306 transitions. [2024-11-11 21:43:47,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 21:43:47,019 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:47,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:43:47,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-11 21:43:47,019 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:47,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:47,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1314946245, now seen corresponding path program 1 times [2024-11-11 21:43:47,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:47,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938731889] [2024-11-11 21:43:47,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:47,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:47,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-11-11 21:43:47,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:47,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938731889] [2024-11-11 21:43:47,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938731889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:47,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:47,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:43:47,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423278027] [2024-11-11 21:43:47,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:47,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:43:47,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:47,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:43:47,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:43:47,114 INFO L87 Difference]: Start difference. First operand 4516 states and 6306 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:47,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:47,142 INFO L93 Difference]: Finished difference Result 13052 states and 18176 transitions. [2024-11-11 21:43:47,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:43:47,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-11-11 21:43:47,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:47,153 INFO L225 Difference]: With dead ends: 13052 [2024-11-11 21:43:47,153 INFO L226 Difference]: Without dead ends: 8628 [2024-11-11 21:43:47,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:43:47,159 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 81 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:47,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 418 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:43:47,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8628 states. [2024-11-11 21:43:47,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8628 to 8314. [2024-11-11 21:43:47,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8314 states, 8313 states have (on average 1.3832551425478166) internal successors, (11499), 8313 states have internal predecessors, (11499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:47,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8314 states to 8314 states and 11499 transitions. [2024-11-11 21:43:47,244 INFO L78 Accepts]: Start accepts. Automaton has 8314 states and 11499 transitions. Word has length 119 [2024-11-11 21:43:47,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:47,244 INFO L471 AbstractCegarLoop]: Abstraction has 8314 states and 11499 transitions. [2024-11-11 21:43:47,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:47,245 INFO L276 IsEmpty]: Start isEmpty. Operand 8314 states and 11499 transitions. [2024-11-11 21:43:47,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-11 21:43:47,245 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:47,245 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:43:47,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-11 21:43:47,246 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:47,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:47,246 INFO L85 PathProgramCache]: Analyzing trace with hash -590316034, now seen corresponding path program 1 times [2024-11-11 21:43:47,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:47,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233980878] [2024-11-11 21:43:47,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:47,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:47,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:47,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:47,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233980878] [2024-11-11 21:43:47,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233980878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:47,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:47,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:43:47,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855340860] [2024-11-11 21:43:47,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:47,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:43:47,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:47,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:43:47,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:43:47,329 INFO L87 Difference]: Start difference. First operand 8314 states and 11499 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:47,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:47,381 INFO L93 Difference]: Finished difference Result 24134 states and 33209 transitions. [2024-11-11 21:43:47,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:43:47,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2024-11-11 21:43:47,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:47,403 INFO L225 Difference]: With dead ends: 24134 [2024-11-11 21:43:47,404 INFO L226 Difference]: Without dead ends: 15912 [2024-11-11 21:43:47,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:43:47,415 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 74 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:47,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 417 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:43:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15912 states. [2024-11-11 21:43:47,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15912 to 15286. [2024-11-11 21:43:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15286 states, 15285 states have (on average 1.3654563297350344) internal successors, (20871), 15285 states have internal predecessors, (20871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15286 states to 15286 states and 20871 transitions. [2024-11-11 21:43:47,569 INFO L78 Accepts]: Start accepts. Automaton has 15286 states and 20871 transitions. Word has length 120 [2024-11-11 21:43:47,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:47,569 INFO L471 AbstractCegarLoop]: Abstraction has 15286 states and 20871 transitions. [2024-11-11 21:43:47,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 15286 states and 20871 transitions. [2024-11-11 21:43:47,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-11 21:43:47,570 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:47,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:43:47,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-11 21:43:47,570 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:47,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:47,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1670009354, now seen corresponding path program 1 times [2024-11-11 21:43:47,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:47,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157343412] [2024-11-11 21:43:47,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:47,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:47,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:47,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:47,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157343412] [2024-11-11 21:43:47,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157343412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:47,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:47,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:43:47,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628716583] [2024-11-11 21:43:47,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:47,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:43:47,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:47,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:43:47,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:43:47,651 INFO L87 Difference]: Start difference. First operand 15286 states and 20871 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:47,730 INFO L93 Difference]: Finished difference Result 44426 states and 60233 transitions. [2024-11-11 21:43:47,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:43:47,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-11-11 21:43:47,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:47,763 INFO L225 Difference]: With dead ends: 44426 [2024-11-11 21:43:47,763 INFO L226 Difference]: Without dead ends: 29232 [2024-11-11 21:43:47,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:43:47,783 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 64 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:47,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 415 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:43:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29232 states. [2024-11-11 21:43:48,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29232 to 27982. [2024-11-11 21:43:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27982 states, 27981 states have (on average 1.3433043851184732) internal successors, (37587), 27981 states have internal predecessors, (37587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27982 states to 27982 states and 37587 transitions. [2024-11-11 21:43:48,151 INFO L78 Accepts]: Start accepts. Automaton has 27982 states and 37587 transitions. Word has length 121 [2024-11-11 21:43:48,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:48,151 INFO L471 AbstractCegarLoop]: Abstraction has 27982 states and 37587 transitions. [2024-11-11 21:43:48,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:48,152 INFO L276 IsEmpty]: Start isEmpty. Operand 27982 states and 37587 transitions. [2024-11-11 21:43:48,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-11 21:43:48,152 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:48,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:43:48,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-11 21:43:48,152 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:48,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:48,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1801378661, now seen corresponding path program 1 times [2024-11-11 21:43:48,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:48,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269443901] [2024-11-11 21:43:48,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:48,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:48,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:48,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:48,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269443901] [2024-11-11 21:43:48,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269443901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:48,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:48,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:43:48,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180192220] [2024-11-11 21:43:48,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:48,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:43:48,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:48,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:43:48,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:43:48,356 INFO L87 Difference]: Start difference. First operand 27982 states and 37587 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:48,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:48,433 INFO L93 Difference]: Finished difference Result 28560 states and 38356 transitions. [2024-11-11 21:43:48,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:43:48,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-11-11 21:43:48,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:48,466 INFO L225 Difference]: With dead ends: 28560 [2024-11-11 21:43:48,466 INFO L226 Difference]: Without dead ends: 28558 [2024-11-11 21:43:48,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:43:48,476 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:48,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 928 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:43:48,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28558 states. [2024-11-11 21:43:48,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28558 to 28558. [2024-11-11 21:43:48,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28558 states, 28557 states have (on average 1.3285359106348706) internal successors, (37939), 28557 states have internal predecessors, (37939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28558 states to 28558 states and 37939 transitions. [2024-11-11 21:43:48,933 INFO L78 Accepts]: Start accepts. Automaton has 28558 states and 37939 transitions. Word has length 122 [2024-11-11 21:43:48,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:48,933 INFO L471 AbstractCegarLoop]: Abstraction has 28558 states and 37939 transitions. [2024-11-11 21:43:48,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 28558 states and 37939 transitions. [2024-11-11 21:43:48,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-11 21:43:48,934 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:48,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:43:48,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-11 21:43:48,934 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:48,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:48,935 INFO L85 PathProgramCache]: Analyzing trace with hash -66701655, now seen corresponding path program 1 times [2024-11-11 21:43:48,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:48,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107289601] [2024-11-11 21:43:48,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:48,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:48,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:48,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:48,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107289601] [2024-11-11 21:43:48,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107289601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:48,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:48,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:43:48,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888829302] [2024-11-11 21:43:48,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:48,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:43:48,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:48,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:43:48,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:43:48,991 INFO L87 Difference]: Start difference. First operand 28558 states and 37939 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:49,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:49,096 INFO L93 Difference]: Finished difference Result 57778 states and 76789 transitions. [2024-11-11 21:43:49,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:43:49,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-11-11 21:43:49,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:49,129 INFO L225 Difference]: With dead ends: 57778 [2024-11-11 21:43:49,129 INFO L226 Difference]: Without dead ends: 29312 [2024-11-11 21:43:49,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:43:49,157 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 107 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:49,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 345 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:43:49,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29312 states. [2024-11-11 21:43:49,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29312 to 29310. [2024-11-11 21:43:49,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29310 states, 29309 states have (on average 1.31410147053806) internal successors, (38515), 29309 states have internal predecessors, (38515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:49,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29310 states to 29310 states and 38515 transitions. [2024-11-11 21:43:49,437 INFO L78 Accepts]: Start accepts. Automaton has 29310 states and 38515 transitions. Word has length 122 [2024-11-11 21:43:49,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:49,437 INFO L471 AbstractCegarLoop]: Abstraction has 29310 states and 38515 transitions. [2024-11-11 21:43:49,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:49,438 INFO L276 IsEmpty]: Start isEmpty. Operand 29310 states and 38515 transitions. [2024-11-11 21:43:49,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-11 21:43:49,441 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:49,442 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:43:49,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-11 21:43:49,442 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:49,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:49,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1114959982, now seen corresponding path program 1 times [2024-11-11 21:43:49,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:49,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964576022] [2024-11-11 21:43:49,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:49,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:49,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:49,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964576022] [2024-11-11 21:43:49,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964576022] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:43:49,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917473414] [2024-11-11 21:43:49,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:49,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:43:49,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:43:49,897 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:43:49,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 21:43:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:50,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-11 21:43:50,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:43:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:50,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:43:52,359 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:52,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917473414] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:43:52,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:43:52,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2024-11-11 21:43:52,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221909908] [2024-11-11 21:43:52,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:43:52,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-11 21:43:52,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:52,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-11 21:43:52,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2024-11-11 21:43:52,362 INFO L87 Difference]: Start difference. First operand 29310 states and 38515 transitions. Second operand has 28 states, 28 states have (on average 12.892857142857142) internal successors, (361), 27 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:57,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:57,173 INFO L93 Difference]: Finished difference Result 280616 states and 367565 transitions. [2024-11-11 21:43:57,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-11-11 21:43:57,173 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 12.892857142857142) internal successors, (361), 27 states have internal predecessors, (361), 0 states have call successors, (0), 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 154 [2024-11-11 21:43:57,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:57,525 INFO L225 Difference]: With dead ends: 280616 [2024-11-11 21:43:57,526 INFO L226 Difference]: Without dead ends: 251398 [2024-11-11 21:43:57,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7082 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3035, Invalid=18135, Unknown=0, NotChecked=0, Total=21170 [2024-11-11 21:43:57,598 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 2918 mSDsluCounter, 4754 mSDsCounter, 0 mSdLazyCounter, 4594 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2918 SdHoareTripleChecker+Valid, 5017 SdHoareTripleChecker+Invalid, 4623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:57,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2918 Valid, 5017 Invalid, 4623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4594 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 21:43:57,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251398 states. [2024-11-11 21:43:59,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251398 to 150728. [2024-11-11 21:44:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150728 states, 150727 states have (on average 1.3037212974450496) internal successors, (196506), 150727 states have internal predecessors, (196506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150728 states to 150728 states and 196506 transitions. [2024-11-11 21:44:00,708 INFO L78 Accepts]: Start accepts. Automaton has 150728 states and 196506 transitions. Word has length 154 [2024-11-11 21:44:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:00,709 INFO L471 AbstractCegarLoop]: Abstraction has 150728 states and 196506 transitions. [2024-11-11 21:44:00,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 12.892857142857142) internal successors, (361), 27 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 150728 states and 196506 transitions. [2024-11-11 21:44:00,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-11 21:44:00,723 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:00,723 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:44:00,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 21:44:00,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2024-11-11 21:44:00,924 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:44:00,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:00,924 INFO L85 PathProgramCache]: Analyzing trace with hash -157592162, now seen corresponding path program 1 times [2024-11-11 21:44:00,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:00,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676536970] [2024-11-11 21:44:00,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:00,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:01,284 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:01,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:01,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676536970] [2024-11-11 21:44:01,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676536970] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:44:01,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735191372] [2024-11-11 21:44:01,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:01,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:44:01,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:44:01,287 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:44:01,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 21:44:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:01,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-11 21:44:01,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:44:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:02,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:44:02,715 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:02,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735191372] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:44:02,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:44:02,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-11-11 21:44:02,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006409381] [2024-11-11 21:44:02,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:44:02,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-11 21:44:02,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:02,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-11 21:44:02,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2024-11-11 21:44:02,716 INFO L87 Difference]: Start difference. First operand 150728 states and 196506 transitions. Second operand has 25 states, 25 states have (on average 16.52) internal successors, (413), 25 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:07,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:07,349 INFO L93 Difference]: Finished difference Result 497925 states and 650730 transitions. [2024-11-11 21:44:07,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-11-11 21:44:07,350 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 16.52) internal successors, (413), 25 states have internal predecessors, (413), 0 states have call successors, (0), 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 155 [2024-11-11 21:44:07,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:08,272 INFO L225 Difference]: With dead ends: 497925 [2024-11-11 21:44:08,273 INFO L226 Difference]: Without dead ends: 468707 [2024-11-11 21:44:08,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5662 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2624, Invalid=14146, Unknown=0, NotChecked=0, Total=16770 [2024-11-11 21:44:08,382 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 4180 mSDsluCounter, 2290 mSDsCounter, 0 mSdLazyCounter, 2267 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4180 SdHoareTripleChecker+Valid, 2505 SdHoareTripleChecker+Invalid, 2315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 2267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:08,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4180 Valid, 2505 Invalid, 2315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 2267 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 21:44:08,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468707 states. [2024-11-11 21:44:11,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468707 to 150697. [2024-11-11 21:44:11,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150697 states, 150696 states have (on average 1.303750597228858) internal successors, (196470), 150696 states have internal predecessors, (196470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:12,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150697 states to 150697 states and 196470 transitions. [2024-11-11 21:44:12,435 INFO L78 Accepts]: Start accepts. Automaton has 150697 states and 196470 transitions. Word has length 155 [2024-11-11 21:44:12,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:12,435 INFO L471 AbstractCegarLoop]: Abstraction has 150697 states and 196470 transitions. [2024-11-11 21:44:12,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 16.52) internal successors, (413), 25 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:12,435 INFO L276 IsEmpty]: Start isEmpty. Operand 150697 states and 196470 transitions. [2024-11-11 21:44:12,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-11 21:44:12,448 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:12,449 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 21:44:12,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 21:44:12,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2024-11-11 21:44:12,651 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:44:12,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:12,651 INFO L85 PathProgramCache]: Analyzing trace with hash 139304431, now seen corresponding path program 1 times [2024-11-11 21:44:12,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:12,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933493976] [2024-11-11 21:44:12,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:12,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:13,277 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:13,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:13,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933493976] [2024-11-11 21:44:13,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933493976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:44:13,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182668913] [2024-11-11 21:44:13,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:13,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:44:13,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:44:13,279 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:44:13,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 21:44:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:13,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-11 21:44:13,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:44:14,000 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:14,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:44:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:14,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182668913] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:44:14,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:44:14,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2024-11-11 21:44:14,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332434589] [2024-11-11 21:44:14,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:44:14,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-11 21:44:14,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:14,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-11 21:44:14,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2024-11-11 21:44:14,567 INFO L87 Difference]: Start difference. First operand 150697 states and 196470 transitions. Second operand has 28 states, 28 states have (on average 15.071428571428571) internal successors, (422), 28 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)