./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52cbb0c1391c9e840599beece58e1ecbc8d18028ef540ea98f759da7158f4609 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:50:58,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:50:58,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:50:58,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:50:58,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:50:58,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:50:58,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:50:58,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:50:58,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:50:58,489 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:50:58,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:50:58,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:50:58,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:50:58,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:50:58,495 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:50:58,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:50:58,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:50:58,496 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:50:58,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:50:58,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:50:58,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:50:58,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:50:58,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:50:58,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:50:58,497 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:50:58,498 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:50:58,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:50:58,498 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:50:58,499 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:50:58,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:50:58,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:50:58,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:50:58,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:50:58,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:50:58,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:50:58,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:50:58,502 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:50:58,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:50:58,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:50:58,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:50:58,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:50:58,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:50:58,504 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52cbb0c1391c9e840599beece58e1ecbc8d18028ef540ea98f759da7158f4609 [2024-10-11 03:50:58,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:50:58,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:50:58,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:50:58,814 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:50:58,814 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:50:58,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-11 03:51:00,361 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:51:00,765 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:51:00,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-11 03:51:00,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b168e7c32/828b80aabc914ee298b2f0b5b25fbeb1/FLAG2292a2f0f [2024-10-11 03:51:00,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b168e7c32/828b80aabc914ee298b2f0b5b25fbeb1 [2024-10-11 03:51:00,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:51:00,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:51:00,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:51:00,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:51:00,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:51:00,838 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:51:00" (1/1) ... [2024-10-11 03:51:00,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b8ba5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:00, skipping insertion in model container [2024-10-11 03:51:00,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:51:00" (1/1) ... [2024-10-11 03:51:00,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:51:01,442 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13531,13544] [2024-10-11 03:51:01,491 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18011,18024] [2024-10-11 03:51:01,511 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19303,19316] [2024-10-11 03:51:01,522 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20061,20074] [2024-10-11 03:51:01,542 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21681,21694] [2024-10-11 03:51:01,556 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22439,22452] [2024-10-11 03:51:01,566 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23525,23538] [2024-10-11 03:51:01,580 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26064,26077] [2024-10-11 03:51:01,589 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26825,26838] [2024-10-11 03:51:01,603 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27914,27927] [2024-10-11 03:51:01,615 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29919,29932] [2024-10-11 03:51:01,639 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33842,33855] [2024-10-11 03:51:01,650 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34603,34616] [2024-10-11 03:51:01,659 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35696,35709] [2024-10-11 03:51:01,679 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37705,37718] [2024-10-11 03:51:01,701 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41308,41321] [2024-10-11 03:51:01,747 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48185,48198] [2024-10-11 03:51:01,753 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48946,48959] [2024-10-11 03:51:01,763 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[50035,50048] [2024-10-11 03:51:01,779 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[52040,52053] [2024-10-11 03:51:01,792 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[55429,55442] [2024-10-11 03:51:01,818 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61126,61139] [2024-10-11 03:51:02,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:51:02,158 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:51:02,220 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13531,13544] [2024-10-11 03:51:02,232 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18011,18024] [2024-10-11 03:51:02,237 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19303,19316] [2024-10-11 03:51:02,242 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20061,20074] [2024-10-11 03:51:02,248 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21681,21694] [2024-10-11 03:51:02,252 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22439,22452] [2024-10-11 03:51:02,256 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23525,23538] [2024-10-11 03:51:02,264 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26064,26077] [2024-10-11 03:51:02,269 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26825,26838] [2024-10-11 03:51:02,273 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27914,27927] [2024-10-11 03:51:02,281 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29919,29932] [2024-10-11 03:51:02,293 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33842,33855] [2024-10-11 03:51:02,297 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34603,34616] [2024-10-11 03:51:02,301 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35696,35709] [2024-10-11 03:51:02,308 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37705,37718] [2024-10-11 03:51:02,321 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41308,41321] [2024-10-11 03:51:02,344 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48185,48198] [2024-10-11 03:51:02,347 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48946,48959] [2024-10-11 03:51:02,352 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[50035,50048] [2024-10-11 03:51:02,358 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[52040,52053] [2024-10-11 03:51:02,369 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[55429,55442] [2024-10-11 03:51:02,383 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61126,61139] [2024-10-11 03:51:02,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:51:02,588 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:51:02,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:02 WrapperNode [2024-10-11 03:51:02,589 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:51:02,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:51:02,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:51:02,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:51:02,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:02" (1/1) ... [2024-10-11 03:51:02,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:02" (1/1) ... [2024-10-11 03:51:02,886 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6748 [2024-10-11 03:51:02,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:51:02,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:51:02,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:51:02,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:51:02,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:02" (1/1) ... [2024-10-11 03:51:02,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:02" (1/1) ... [2024-10-11 03:51:02,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:02" (1/1) ... [2024-10-11 03:51:03,008 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:51:03,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:02" (1/1) ... [2024-10-11 03:51:03,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:02" (1/1) ... [2024-10-11 03:51:03,066 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:02" (1/1) ... [2024-10-11 03:51:03,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:02" (1/1) ... [2024-10-11 03:51:03,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:02" (1/1) ... [2024-10-11 03:51:03,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:02" (1/1) ... [2024-10-11 03:51:03,172 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:51:03,174 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:51:03,174 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:51:03,174 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:51:03,175 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:02" (1/1) ... [2024-10-11 03:51:03,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:51:03,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:51:03,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:51:03,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:51:03,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:51:03,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:51:03,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:51:03,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:51:03,559 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:51:03,561 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:51:07,054 INFO L? ?]: Removed 1001 outVars from TransFormulas that were not future-live. [2024-10-11 03:51:07,054 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:51:07,144 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:51:07,144 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:51:07,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:51:07 BoogieIcfgContainer [2024-10-11 03:51:07,145 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:51:07,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:51:07,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:51:07,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:51:07,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:51:00" (1/3) ... [2024-10-11 03:51:07,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e09dcb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:51:07, skipping insertion in model container [2024-10-11 03:51:07,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:02" (2/3) ... [2024-10-11 03:51:07,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e09dcb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:51:07, skipping insertion in model container [2024-10-11 03:51:07,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:51:07" (3/3) ... [2024-10-11 03:51:07,156 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-11 03:51:07,177 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:51:07,177 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-10-11 03:51:07,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:51:07,293 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;@690c871c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:51:07,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-10-11 03:51:07,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 1122 states, 1099 states have (on average 1.8616924476797088) internal successors, (2046), 1121 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:07,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 03:51:07,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:07,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:07,342 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:07,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:07,348 INFO L85 PathProgramCache]: Analyzing trace with hash -744865271, now seen corresponding path program 1 times [2024-10-11 03:51:07,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:07,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021574716] [2024-10-11 03:51:07,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:07,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:08,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:08,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:08,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021574716] [2024-10-11 03:51:08,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021574716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:08,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:08,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:08,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928144876] [2024-10-11 03:51:08,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:08,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:08,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:08,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:08,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:08,119 INFO L87 Difference]: Start difference. First operand has 1122 states, 1099 states have (on average 1.8616924476797088) internal successors, (2046), 1121 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:08,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:08,977 INFO L93 Difference]: Finished difference Result 1697 states and 2993 transitions. [2024-10-11 03:51:08,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:08,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-10-11 03:51:08,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:08,998 INFO L225 Difference]: With dead ends: 1697 [2024-10-11 03:51:08,998 INFO L226 Difference]: Without dead ends: 876 [2024-10-11 03:51:09,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:09,007 INFO L432 NwaCegarLoop]: 1016 mSDtfsCounter, 4497 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4497 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:09,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4497 Valid, 1056 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:51:09,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-10-11 03:51:09,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 876. [2024-10-11 03:51:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 854 states have (on average 1.3185011709601873) internal successors, (1126), 875 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1126 transitions. [2024-10-11 03:51:09,100 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1126 transitions. Word has length 84 [2024-10-11 03:51:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:09,101 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1126 transitions. [2024-10-11 03:51:09,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:09,101 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1126 transitions. [2024-10-11 03:51:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 03:51:09,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:09,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:09,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:51:09,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:09,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:09,106 INFO L85 PathProgramCache]: Analyzing trace with hash 861830130, now seen corresponding path program 1 times [2024-10-11 03:51:09,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:09,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456515599] [2024-10-11 03:51:09,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:09,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:09,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:09,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:09,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456515599] [2024-10-11 03:51:09,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456515599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:09,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:09,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:09,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014131719] [2024-10-11 03:51:09,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:09,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:09,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:09,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:09,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:09,370 INFO L87 Difference]: Start difference. First operand 876 states and 1126 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:09,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:09,879 INFO L93 Difference]: Finished difference Result 1445 states and 1914 transitions. [2024-10-11 03:51:09,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:09,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-10-11 03:51:09,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:09,883 INFO L225 Difference]: With dead ends: 1445 [2024-10-11 03:51:09,884 INFO L226 Difference]: Without dead ends: 745 [2024-10-11 03:51:09,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:09,887 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 2883 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2883 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:09,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2883 Valid, 569 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:51:09,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-10-11 03:51:09,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2024-10-11 03:51:09,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 723 states have (on average 1.3526970954356847) internal successors, (978), 744 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:09,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 978 transitions. [2024-10-11 03:51:09,915 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 978 transitions. Word has length 85 [2024-10-11 03:51:09,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:09,917 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 978 transitions. [2024-10-11 03:51:09,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:09,918 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 978 transitions. [2024-10-11 03:51:09,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 03:51:09,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:09,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:09,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:51:09,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:09,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:09,921 INFO L85 PathProgramCache]: Analyzing trace with hash 139657888, now seen corresponding path program 1 times [2024-10-11 03:51:09,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:09,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829276143] [2024-10-11 03:51:09,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:09,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:10,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:10,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829276143] [2024-10-11 03:51:10,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829276143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:10,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:10,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:10,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236989322] [2024-10-11 03:51:10,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:10,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:10,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:10,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:10,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:10,161 INFO L87 Difference]: Start difference. First operand 745 states and 978 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:10,764 INFO L93 Difference]: Finished difference Result 1314 states and 1765 transitions. [2024-10-11 03:51:10,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:10,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-11 03:51:10,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:10,768 INFO L225 Difference]: With dead ends: 1314 [2024-10-11 03:51:10,768 INFO L226 Difference]: Without dead ends: 705 [2024-10-11 03:51:10,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:10,770 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 2653 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2653 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:10,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2653 Valid, 466 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:51:10,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-11 03:51:10,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2024-10-11 03:51:10,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 683 states have (on average 1.3601756954612005) internal successors, (929), 704 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 929 transitions. [2024-10-11 03:51:10,788 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 929 transitions. Word has length 86 [2024-10-11 03:51:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:10,789 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 929 transitions. [2024-10-11 03:51:10,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 929 transitions. [2024-10-11 03:51:10,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 03:51:10,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:10,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:10,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:51:10,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:10,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:10,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1409043309, now seen corresponding path program 1 times [2024-10-11 03:51:10,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:10,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755066153] [2024-10-11 03:51:10,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:10,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:10,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:10,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755066153] [2024-10-11 03:51:10,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755066153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:10,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:10,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:10,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541520554] [2024-10-11 03:51:10,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:11,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:11,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:11,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:11,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:11,001 INFO L87 Difference]: Start difference. First operand 705 states and 929 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:11,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:11,467 INFO L93 Difference]: Finished difference Result 1274 states and 1715 transitions. [2024-10-11 03:51:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:11,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-10-11 03:51:11,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:11,473 INFO L225 Difference]: With dead ends: 1274 [2024-10-11 03:51:11,473 INFO L226 Difference]: Without dead ends: 667 [2024-10-11 03:51:11,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:11,475 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 2568 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2568 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:11,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2568 Valid, 506 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:51:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-10-11 03:51:11,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2024-10-11 03:51:11,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 645 states have (on average 1.3736434108527131) internal successors, (886), 666 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 886 transitions. [2024-10-11 03:51:11,495 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 886 transitions. Word has length 87 [2024-10-11 03:51:11,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:11,496 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 886 transitions. [2024-10-11 03:51:11,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 886 transitions. [2024-10-11 03:51:11,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 03:51:11,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:11,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:11,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:51:11,500 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:11,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:11,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1145590041, now seen corresponding path program 1 times [2024-10-11 03:51:11,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:11,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919754731] [2024-10-11 03:51:11,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:11,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:11,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:11,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919754731] [2024-10-11 03:51:11,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919754731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:11,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:11,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:11,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784347914] [2024-10-11 03:51:11,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:11,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:11,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:11,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:11,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:11,717 INFO L87 Difference]: Start difference. First operand 667 states and 886 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:12,188 INFO L93 Difference]: Finished difference Result 1236 states and 1671 transitions. [2024-10-11 03:51:12,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:12,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-10-11 03:51:12,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:12,191 INFO L225 Difference]: With dead ends: 1236 [2024-10-11 03:51:12,192 INFO L226 Difference]: Without dead ends: 642 [2024-10-11 03:51:12,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:12,194 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 2511 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2511 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:12,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2511 Valid, 493 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:51:12,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-10-11 03:51:12,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2024-10-11 03:51:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3838709677419354) internal successors, (858), 641 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:12,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 858 transitions. [2024-10-11 03:51:12,210 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 858 transitions. Word has length 88 [2024-10-11 03:51:12,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:12,214 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 858 transitions. [2024-10-11 03:51:12,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:12,214 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 858 transitions. [2024-10-11 03:51:12,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 03:51:12,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:12,216 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:12,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:51:12,216 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:12,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:12,220 INFO L85 PathProgramCache]: Analyzing trace with hash -81085098, now seen corresponding path program 1 times [2024-10-11 03:51:12,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:12,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612336108] [2024-10-11 03:51:12,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:12,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:12,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:12,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:12,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612336108] [2024-10-11 03:51:12,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612336108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:12,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:12,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:12,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064687524] [2024-10-11 03:51:12,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:12,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:12,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:12,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:12,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:12,402 INFO L87 Difference]: Start difference. First operand 642 states and 858 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:12,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:12,861 INFO L93 Difference]: Finished difference Result 1211 states and 1642 transitions. [2024-10-11 03:51:12,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:12,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-10-11 03:51:12,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:12,865 INFO L225 Difference]: With dead ends: 1211 [2024-10-11 03:51:12,865 INFO L226 Difference]: Without dead ends: 634 [2024-10-11 03:51:12,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:12,870 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 2434 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2434 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:12,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2434 Valid, 469 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:51:12,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-10-11 03:51:12,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2024-10-11 03:51:12,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3856209150326797) internal successors, (848), 633 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 848 transitions. [2024-10-11 03:51:12,882 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 848 transitions. Word has length 89 [2024-10-11 03:51:12,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:12,883 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 848 transitions. [2024-10-11 03:51:12,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:12,883 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 848 transitions. [2024-10-11 03:51:12,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 03:51:12,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:12,885 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:12,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:51:12,885 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:12,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:12,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1177000506, now seen corresponding path program 1 times [2024-10-11 03:51:12,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:12,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871309126] [2024-10-11 03:51:12,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:12,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:13,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:13,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:13,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871309126] [2024-10-11 03:51:13,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871309126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:13,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:13,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:51:13,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104683933] [2024-10-11 03:51:13,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:13,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:51:13,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:13,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:51:13,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:13,322 INFO L87 Difference]: Start difference. First operand 634 states and 848 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:14,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:14,399 INFO L93 Difference]: Finished difference Result 1196 states and 1557 transitions. [2024-10-11 03:51:14,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:51:14,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-10-11 03:51:14,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:14,403 INFO L225 Difference]: With dead ends: 1196 [2024-10-11 03:51:14,404 INFO L226 Difference]: Without dead ends: 851 [2024-10-11 03:51:14,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:51:14,405 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 2871 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2871 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 1524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:14,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2871 Valid, 1381 Invalid, 1524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:51:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2024-10-11 03:51:14,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 634. [2024-10-11 03:51:14,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3839869281045751) internal successors, (847), 633 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 847 transitions. [2024-10-11 03:51:14,421 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 847 transitions. Word has length 90 [2024-10-11 03:51:14,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:14,422 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 847 transitions. [2024-10-11 03:51:14,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 847 transitions. [2024-10-11 03:51:14,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 03:51:14,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:14,424 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:14,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:51:14,424 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:14,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:14,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1435926047, now seen corresponding path program 1 times [2024-10-11 03:51:14,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:14,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756959161] [2024-10-11 03:51:14,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:14,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:15,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:15,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:15,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756959161] [2024-10-11 03:51:15,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756959161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:15,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:15,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:51:15,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937325219] [2024-10-11 03:51:15,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:15,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:51:15,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:15,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:51:15,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:51:15,018 INFO L87 Difference]: Start difference. First operand 634 states and 847 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:16,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:16,583 INFO L93 Difference]: Finished difference Result 1084 states and 1457 transitions. [2024-10-11 03:51:16,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:51:16,584 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-10-11 03:51:16,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:16,592 INFO L225 Difference]: With dead ends: 1084 [2024-10-11 03:51:16,592 INFO L226 Difference]: Without dead ends: 985 [2024-10-11 03:51:16,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2024-10-11 03:51:16,594 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 2245 mSDsluCounter, 2289 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2245 SdHoareTripleChecker+Valid, 2755 SdHoareTripleChecker+Invalid, 2298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:16,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2245 Valid, 2755 Invalid, 2298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2290 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 03:51:16,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2024-10-11 03:51:16,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 641. [2024-10-11 03:51:16,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 619 states have (on average 1.384491114701131) internal successors, (857), 640 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 857 transitions. [2024-10-11 03:51:16,614 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 857 transitions. Word has length 90 [2024-10-11 03:51:16,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:16,614 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 857 transitions. [2024-10-11 03:51:16,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 857 transitions. [2024-10-11 03:51:16,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 03:51:16,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:16,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:16,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:51:16,618 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:16,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:16,618 INFO L85 PathProgramCache]: Analyzing trace with hash 546881237, now seen corresponding path program 1 times [2024-10-11 03:51:16,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:16,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122004414] [2024-10-11 03:51:16,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:16,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:17,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:17,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122004414] [2024-10-11 03:51:17,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122004414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:17,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:17,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:17,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133738833] [2024-10-11 03:51:17,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:17,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:17,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:17,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:17,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:17,010 INFO L87 Difference]: Start difference. First operand 641 states and 857 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:18,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:18,278 INFO L93 Difference]: Finished difference Result 1174 states and 1586 transitions. [2024-10-11 03:51:18,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:51:18,279 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-10-11 03:51:18,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:18,284 INFO L225 Difference]: With dead ends: 1174 [2024-10-11 03:51:18,285 INFO L226 Difference]: Without dead ends: 982 [2024-10-11 03:51:18,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:51:18,286 INFO L432 NwaCegarLoop]: 922 mSDtfsCounter, 2527 mSDsluCounter, 2375 mSDsCounter, 0 mSdLazyCounter, 2244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2527 SdHoareTripleChecker+Valid, 3297 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:18,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2527 Valid, 3297 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2244 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:51:18,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2024-10-11 03:51:18,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 634. [2024-10-11 03:51:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3823529411764706) internal successors, (846), 633 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:18,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 846 transitions. [2024-10-11 03:51:18,304 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 846 transitions. Word has length 90 [2024-10-11 03:51:18,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:18,304 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 846 transitions. [2024-10-11 03:51:18,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:18,305 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 846 transitions. [2024-10-11 03:51:18,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 03:51:18,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:18,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:18,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:51:18,307 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:18,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:18,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1452291629, now seen corresponding path program 1 times [2024-10-11 03:51:18,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:18,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061032038] [2024-10-11 03:51:18,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:18,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:18,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:18,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:18,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061032038] [2024-10-11 03:51:18,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061032038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:18,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:18,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:18,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717789332] [2024-10-11 03:51:18,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:18,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:18,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:18,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:18,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:18,702 INFO L87 Difference]: Start difference. First operand 634 states and 846 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:19,738 INFO L93 Difference]: Finished difference Result 1069 states and 1436 transitions. [2024-10-11 03:51:19,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:51:19,739 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-10-11 03:51:19,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:19,743 INFO L225 Difference]: With dead ends: 1069 [2024-10-11 03:51:19,743 INFO L226 Difference]: Without dead ends: 970 [2024-10-11 03:51:19,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:51:19,744 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 3475 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3475 SdHoareTripleChecker+Valid, 2052 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:19,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3475 Valid, 2052 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1650 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:51:19,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-10-11 03:51:19,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 634. [2024-10-11 03:51:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.380718954248366) internal successors, (845), 633 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:19,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 845 transitions. [2024-10-11 03:51:19,759 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 845 transitions. Word has length 90 [2024-10-11 03:51:19,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:19,759 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 845 transitions. [2024-10-11 03:51:19,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 845 transitions. [2024-10-11 03:51:19,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:51:19,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:19,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:19,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:51:19,762 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:19,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:19,762 INFO L85 PathProgramCache]: Analyzing trace with hash 280311879, now seen corresponding path program 1 times [2024-10-11 03:51:19,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:19,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092836666] [2024-10-11 03:51:19,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:19,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:20,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:20,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092836666] [2024-10-11 03:51:20,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092836666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:20,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:20,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:20,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743044523] [2024-10-11 03:51:20,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:20,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:20,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:20,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:20,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:20,096 INFO L87 Difference]: Start difference. First operand 634 states and 845 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:21,331 INFO L93 Difference]: Finished difference Result 1204 states and 1612 transitions. [2024-10-11 03:51:21,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:51:21,332 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:51:21,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:21,335 INFO L225 Difference]: With dead ends: 1204 [2024-10-11 03:51:21,335 INFO L226 Difference]: Without dead ends: 982 [2024-10-11 03:51:21,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:51:21,337 INFO L432 NwaCegarLoop]: 674 mSDtfsCounter, 1835 mSDsluCounter, 2207 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1835 SdHoareTripleChecker+Valid, 2881 SdHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:21,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1835 Valid, 2881 Invalid, 2273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:51:21,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2024-10-11 03:51:21,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 634. [2024-10-11 03:51:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3790849673202614) internal successors, (844), 633 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 844 transitions. [2024-10-11 03:51:21,349 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 844 transitions. Word has length 92 [2024-10-11 03:51:21,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:21,350 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 844 transitions. [2024-10-11 03:51:21,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:21,350 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 844 transitions. [2024-10-11 03:51:21,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:51:21,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:21,351 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:21,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:51:21,352 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:21,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:21,352 INFO L85 PathProgramCache]: Analyzing trace with hash 347470600, now seen corresponding path program 1 times [2024-10-11 03:51:21,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:21,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581119875] [2024-10-11 03:51:21,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:21,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:21,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:21,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:21,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581119875] [2024-10-11 03:51:21,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581119875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:21,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:21,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:21,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431572445] [2024-10-11 03:51:21,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:21,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:21,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:21,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:21,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:21,649 INFO L87 Difference]: Start difference. First operand 634 states and 844 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:22,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:22,510 INFO L93 Difference]: Finished difference Result 927 states and 1211 transitions. [2024-10-11 03:51:22,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:51:22,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:51:22,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:22,513 INFO L225 Difference]: With dead ends: 927 [2024-10-11 03:51:22,513 INFO L226 Difference]: Without dead ends: 922 [2024-10-11 03:51:22,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:51:22,514 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 2294 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2294 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:22,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2294 Valid, 1866 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:51:22,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-10-11 03:51:22,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 634. [2024-10-11 03:51:22,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3774509803921569) internal successors, (843), 633 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:22,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 843 transitions. [2024-10-11 03:51:22,528 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 843 transitions. Word has length 92 [2024-10-11 03:51:22,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:22,528 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 843 transitions. [2024-10-11 03:51:22,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:22,529 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 843 transitions. [2024-10-11 03:51:22,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:51:22,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:22,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:22,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:51:22,531 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:22,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:22,531 INFO L85 PathProgramCache]: Analyzing trace with hash -950419438, now seen corresponding path program 1 times [2024-10-11 03:51:22,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:22,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271925008] [2024-10-11 03:51:22,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:22,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:22,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:22,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271925008] [2024-10-11 03:51:22,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271925008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:22,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:22,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:22,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323741522] [2024-10-11 03:51:22,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:22,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:22,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:22,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:22,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:22,886 INFO L87 Difference]: Start difference. First operand 634 states and 843 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:24,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:24,038 INFO L93 Difference]: Finished difference Result 1116 states and 1499 transitions. [2024-10-11 03:51:24,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:51:24,039 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:51:24,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:24,042 INFO L225 Difference]: With dead ends: 1116 [2024-10-11 03:51:24,042 INFO L226 Difference]: Without dead ends: 978 [2024-10-11 03:51:24,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:51:24,043 INFO L432 NwaCegarLoop]: 725 mSDtfsCounter, 2590 mSDsluCounter, 2368 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2590 SdHoareTripleChecker+Valid, 3093 SdHoareTripleChecker+Invalid, 2418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:24,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2590 Valid, 3093 Invalid, 2418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2415 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:51:24,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-10-11 03:51:24,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 634. [2024-10-11 03:51:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3758169934640523) internal successors, (842), 633 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 842 transitions. [2024-10-11 03:51:24,056 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 842 transitions. Word has length 92 [2024-10-11 03:51:24,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:24,056 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 842 transitions. [2024-10-11 03:51:24,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:24,057 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 842 transitions. [2024-10-11 03:51:24,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:51:24,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:24,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:24,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:51:24,058 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:24,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:24,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1340210149, now seen corresponding path program 1 times [2024-10-11 03:51:24,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:24,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508101618] [2024-10-11 03:51:24,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:24,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:24,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:24,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:24,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508101618] [2024-10-11 03:51:24,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508101618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:24,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:24,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:24,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272149785] [2024-10-11 03:51:24,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:24,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:24,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:24,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:24,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:24,349 INFO L87 Difference]: Start difference. First operand 634 states and 842 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:25,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:25,197 INFO L93 Difference]: Finished difference Result 1001 states and 1319 transitions. [2024-10-11 03:51:25,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:51:25,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:51:25,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:25,200 INFO L225 Difference]: With dead ends: 1001 [2024-10-11 03:51:25,200 INFO L226 Difference]: Without dead ends: 922 [2024-10-11 03:51:25,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:51:25,202 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 3452 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3452 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:25,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3452 Valid, 1866 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1592 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:51:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-10-11 03:51:25,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 634. [2024-10-11 03:51:25,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3741830065359477) internal successors, (841), 633 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:25,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 841 transitions. [2024-10-11 03:51:25,214 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 841 transitions. Word has length 92 [2024-10-11 03:51:25,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:25,215 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 841 transitions. [2024-10-11 03:51:25,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:25,215 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 841 transitions. [2024-10-11 03:51:25,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:51:25,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:25,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:25,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:51:25,217 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:25,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:25,217 INFO L85 PathProgramCache]: Analyzing trace with hash 2065712337, now seen corresponding path program 1 times [2024-10-11 03:51:25,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:25,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398255640] [2024-10-11 03:51:25,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:25,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:25,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-10-11 03:51:25,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:25,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398255640] [2024-10-11 03:51:25,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398255640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:25,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:25,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:51:25,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125735898] [2024-10-11 03:51:25,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:25,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:51:25,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:25,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:51:25,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:51:25,867 INFO L87 Difference]: Start difference. First operand 634 states and 841 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:28,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:28,015 INFO L93 Difference]: Finished difference Result 1418 states and 1945 transitions. [2024-10-11 03:51:28,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:51:28,016 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:51:28,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:28,019 INFO L225 Difference]: With dead ends: 1418 [2024-10-11 03:51:28,019 INFO L226 Difference]: Without dead ends: 1280 [2024-10-11 03:51:28,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:51:28,020 INFO L432 NwaCegarLoop]: 707 mSDtfsCounter, 5336 mSDsluCounter, 3282 mSDsCounter, 0 mSdLazyCounter, 3273 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5336 SdHoareTripleChecker+Valid, 3989 SdHoareTripleChecker+Invalid, 3470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 3273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:28,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5336 Valid, 3989 Invalid, 3470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 3273 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 03:51:28,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2024-10-11 03:51:28,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 638. [2024-10-11 03:51:28,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3717532467532467) internal successors, (845), 637 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:28,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 845 transitions. [2024-10-11 03:51:28,034 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 845 transitions. Word has length 92 [2024-10-11 03:51:28,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:28,034 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 845 transitions. [2024-10-11 03:51:28,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:28,035 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 845 transitions. [2024-10-11 03:51:28,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:51:28,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:28,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:28,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:51:28,036 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:28,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:28,037 INFO L85 PathProgramCache]: Analyzing trace with hash -587338309, now seen corresponding path program 1 times [2024-10-11 03:51:28,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:28,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18554984] [2024-10-11 03:51:28,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:28,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:28,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:28,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18554984] [2024-10-11 03:51:28,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18554984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:28,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:28,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:28,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067426683] [2024-10-11 03:51:28,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:28,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:28,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:28,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:28,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:28,348 INFO L87 Difference]: Start difference. First operand 638 states and 845 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:29,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:29,200 INFO L93 Difference]: Finished difference Result 931 states and 1210 transitions. [2024-10-11 03:51:29,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:51:29,201 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:51:29,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:29,203 INFO L225 Difference]: With dead ends: 931 [2024-10-11 03:51:29,203 INFO L226 Difference]: Without dead ends: 926 [2024-10-11 03:51:29,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:51:29,204 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 3447 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3447 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:29,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3447 Valid, 1866 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:51:29,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-11 03:51:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 638. [2024-10-11 03:51:29,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.37012987012987) internal successors, (844), 637 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 844 transitions. [2024-10-11 03:51:29,218 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 844 transitions. Word has length 92 [2024-10-11 03:51:29,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:29,219 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 844 transitions. [2024-10-11 03:51:29,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 844 transitions. [2024-10-11 03:51:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:51:29,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:29,221 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:29,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:51:29,221 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:29,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:29,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1856213353, now seen corresponding path program 1 times [2024-10-11 03:51:29,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:29,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594398841] [2024-10-11 03:51:29,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:29,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:29,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:29,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:29,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594398841] [2024-10-11 03:51:29,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594398841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:29,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:29,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:29,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478441373] [2024-10-11 03:51:29,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:29,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:29,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:29,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:29,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:29,545 INFO L87 Difference]: Start difference. First operand 638 states and 844 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:30,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:30,463 INFO L93 Difference]: Finished difference Result 1040 states and 1381 transitions. [2024-10-11 03:51:30,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:51:30,464 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:51:30,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:30,466 INFO L225 Difference]: With dead ends: 1040 [2024-10-11 03:51:30,466 INFO L226 Difference]: Without dead ends: 958 [2024-10-11 03:51:30,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:51:30,467 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 2180 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2180 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:30,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2180 Valid, 2064 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:51:30,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-11 03:51:30,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 638. [2024-10-11 03:51:30,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3685064935064934) internal successors, (843), 637 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:30,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 843 transitions. [2024-10-11 03:51:30,480 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 843 transitions. Word has length 92 [2024-10-11 03:51:30,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:30,480 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 843 transitions. [2024-10-11 03:51:30,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:30,481 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 843 transitions. [2024-10-11 03:51:30,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:51:30,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:30,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:30,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:51:30,483 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:30,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:30,483 INFO L85 PathProgramCache]: Analyzing trace with hash -98755353, now seen corresponding path program 1 times [2024-10-11 03:51:30,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:30,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190134187] [2024-10-11 03:51:30,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:30,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:30,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-10-11 03:51:30,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:30,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190134187] [2024-10-11 03:51:30,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190134187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:30,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:30,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:30,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74770364] [2024-10-11 03:51:30,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:30,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:30,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:30,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:30,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:30,869 INFO L87 Difference]: Start difference. First operand 638 states and 843 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:31,885 INFO L93 Difference]: Finished difference Result 1067 states and 1425 transitions. [2024-10-11 03:51:31,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:51:31,886 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:51:31,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:31,888 INFO L225 Difference]: With dead ends: 1067 [2024-10-11 03:51:31,888 INFO L226 Difference]: Without dead ends: 974 [2024-10-11 03:51:31,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:51:31,889 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 2561 mSDsluCounter, 2238 mSDsCounter, 0 mSdLazyCounter, 2105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2561 SdHoareTripleChecker+Valid, 2786 SdHoareTripleChecker+Invalid, 2109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:31,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2561 Valid, 2786 Invalid, 2109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2105 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:51:31,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-11 03:51:31,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 638. [2024-10-11 03:51:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3668831168831168) internal successors, (842), 637 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 842 transitions. [2024-10-11 03:51:31,900 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 842 transitions. Word has length 92 [2024-10-11 03:51:31,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:31,900 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 842 transitions. [2024-10-11 03:51:31,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:31,900 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 842 transitions. [2024-10-11 03:51:31,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:51:31,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:31,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:31,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:51:31,902 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:31,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:31,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1488242838, now seen corresponding path program 1 times [2024-10-11 03:51:31,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:31,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138619068] [2024-10-11 03:51:31,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:31,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:32,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-10-11 03:51:32,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:32,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138619068] [2024-10-11 03:51:32,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138619068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:32,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:32,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:32,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493467808] [2024-10-11 03:51:32,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:32,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:32,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:32,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:32,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:32,193 INFO L87 Difference]: Start difference. First operand 638 states and 842 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:33,413 INFO L93 Difference]: Finished difference Result 1116 states and 1495 transitions. [2024-10-11 03:51:33,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:51:33,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:51:33,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:33,416 INFO L225 Difference]: With dead ends: 1116 [2024-10-11 03:51:33,416 INFO L226 Difference]: Without dead ends: 978 [2024-10-11 03:51:33,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:51:33,417 INFO L432 NwaCegarLoop]: 722 mSDtfsCounter, 2574 mSDsluCounter, 2356 mSDsCounter, 0 mSdLazyCounter, 2397 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2574 SdHoareTripleChecker+Valid, 3078 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:33,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2574 Valid, 3078 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2397 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:51:33,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-10-11 03:51:33,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 634. [2024-10-11 03:51:33,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3676470588235294) internal successors, (837), 633 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 837 transitions. [2024-10-11 03:51:33,428 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 837 transitions. Word has length 93 [2024-10-11 03:51:33,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:33,429 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 837 transitions. [2024-10-11 03:51:33,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 837 transitions. [2024-10-11 03:51:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:51:33,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:33,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:33,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:51:33,431 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:33,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:33,432 INFO L85 PathProgramCache]: Analyzing trace with hash 514536132, now seen corresponding path program 1 times [2024-10-11 03:51:33,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:33,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040644824] [2024-10-11 03:51:33,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:33,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:33,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:33,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040644824] [2024-10-11 03:51:33,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040644824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:33,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:33,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:33,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668254195] [2024-10-11 03:51:33,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:33,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:33,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:33,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:33,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:33,696 INFO L87 Difference]: Start difference. First operand 634 states and 837 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:34,637 INFO L93 Difference]: Finished difference Result 1078 states and 1433 transitions. [2024-10-11 03:51:34,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:51:34,638 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:51:34,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:34,641 INFO L225 Difference]: With dead ends: 1078 [2024-10-11 03:51:34,641 INFO L226 Difference]: Without dead ends: 970 [2024-10-11 03:51:34,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:51:34,642 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 3105 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3105 SdHoareTripleChecker+Valid, 2431 SdHoareTripleChecker+Invalid, 1898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:34,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3105 Valid, 2431 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1894 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:51:34,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-10-11 03:51:34,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 634. [2024-10-11 03:51:34,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3660130718954249) internal successors, (836), 633 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:34,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 836 transitions. [2024-10-11 03:51:34,653 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 836 transitions. Word has length 94 [2024-10-11 03:51:34,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:34,653 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 836 transitions. [2024-10-11 03:51:34,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:34,653 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 836 transitions. [2024-10-11 03:51:34,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:51:34,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:34,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:34,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:51:34,655 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:34,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:34,656 INFO L85 PathProgramCache]: Analyzing trace with hash 105690904, now seen corresponding path program 1 times [2024-10-11 03:51:34,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:34,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087177253] [2024-10-11 03:51:34,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:34,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:34,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:34,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087177253] [2024-10-11 03:51:34,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087177253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:34,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:34,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:34,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570419510] [2024-10-11 03:51:34,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:34,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:34,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:34,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:34,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:34,985 INFO L87 Difference]: Start difference. First operand 634 states and 836 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:35,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:35,831 INFO L93 Difference]: Finished difference Result 1001 states and 1311 transitions. [2024-10-11 03:51:35,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:51:35,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:51:35,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:35,833 INFO L225 Difference]: With dead ends: 1001 [2024-10-11 03:51:35,834 INFO L226 Difference]: Without dead ends: 922 [2024-10-11 03:51:35,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:51:35,834 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 3401 mSDsluCounter, 1436 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3401 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 1597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:35,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3401 Valid, 1886 Invalid, 1597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:51:35,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-10-11 03:51:35,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 634. [2024-10-11 03:51:35,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3643790849673203) internal successors, (835), 633 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 835 transitions. [2024-10-11 03:51:35,845 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 835 transitions. Word has length 94 [2024-10-11 03:51:35,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:35,846 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 835 transitions. [2024-10-11 03:51:35,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:35,846 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 835 transitions. [2024-10-11 03:51:35,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:51:35,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:35,848 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:35,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:51:35,848 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:35,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:35,849 INFO L85 PathProgramCache]: Analyzing trace with hash 909968804, now seen corresponding path program 1 times [2024-10-11 03:51:35,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:35,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042705293] [2024-10-11 03:51:35,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:35,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:36,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:36,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:36,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042705293] [2024-10-11 03:51:36,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042705293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:36,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:36,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:36,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94813664] [2024-10-11 03:51:36,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:36,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:36,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:36,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:36,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:36,212 INFO L87 Difference]: Start difference. First operand 634 states and 835 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:37,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:37,196 INFO L93 Difference]: Finished difference Result 1131 states and 1503 transitions. [2024-10-11 03:51:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:51:37,197 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:51:37,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:37,200 INFO L225 Difference]: With dead ends: 1131 [2024-10-11 03:51:37,200 INFO L226 Difference]: Without dead ends: 978 [2024-10-11 03:51:37,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:51:37,201 INFO L432 NwaCegarLoop]: 812 mSDtfsCounter, 2489 mSDsluCounter, 2222 mSDsCounter, 0 mSdLazyCounter, 2039 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2489 SdHoareTripleChecker+Valid, 3034 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:37,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2489 Valid, 3034 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2039 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:51:37,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-10-11 03:51:37,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 634. [2024-10-11 03:51:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3627450980392157) internal successors, (834), 633 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 834 transitions. [2024-10-11 03:51:37,212 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 834 transitions. Word has length 94 [2024-10-11 03:51:37,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:37,213 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 834 transitions. [2024-10-11 03:51:37,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:37,213 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 834 transitions. [2024-10-11 03:51:37,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:51:37,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:37,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:37,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:51:37,215 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:37,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:37,215 INFO L85 PathProgramCache]: Analyzing trace with hash -2106541419, now seen corresponding path program 1 times [2024-10-11 03:51:37,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:37,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707120576] [2024-10-11 03:51:37,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:37,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:37,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:37,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:37,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707120576] [2024-10-11 03:51:37,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707120576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:37,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:37,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:37,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535773917] [2024-10-11 03:51:37,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:37,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:37,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:37,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:37,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:37,516 INFO L87 Difference]: Start difference. First operand 634 states and 834 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:38,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:38,560 INFO L93 Difference]: Finished difference Result 1069 states and 1420 transitions. [2024-10-11 03:51:38,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:51:38,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:51:38,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:38,564 INFO L225 Difference]: With dead ends: 1069 [2024-10-11 03:51:38,564 INFO L226 Difference]: Without dead ends: 970 [2024-10-11 03:51:38,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:51:38,565 INFO L432 NwaCegarLoop]: 725 mSDtfsCounter, 2541 mSDsluCounter, 2568 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2541 SdHoareTripleChecker+Valid, 3293 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:38,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2541 Valid, 3293 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:51:38,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-10-11 03:51:38,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 634. [2024-10-11 03:51:38,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3611111111111112) internal successors, (833), 633 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:38,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 833 transitions. [2024-10-11 03:51:38,575 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 833 transitions. Word has length 94 [2024-10-11 03:51:38,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:38,576 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 833 transitions. [2024-10-11 03:51:38,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 833 transitions. [2024-10-11 03:51:38,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:51:38,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:38,577 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:38,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:51:38,578 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:38,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:38,578 INFO L85 PathProgramCache]: Analyzing trace with hash 556568795, now seen corresponding path program 1 times [2024-10-11 03:51:38,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:38,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572227725] [2024-10-11 03:51:38,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:38,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:38,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:38,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:38,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572227725] [2024-10-11 03:51:38,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572227725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:38,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:38,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:38,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132071022] [2024-10-11 03:51:38,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:38,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:38,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:38,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:38,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:38,923 INFO L87 Difference]: Start difference. First operand 634 states and 833 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:39,883 INFO L93 Difference]: Finished difference Result 1036 states and 1370 transitions. [2024-10-11 03:51:39,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:51:39,884 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:51:39,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:39,886 INFO L225 Difference]: With dead ends: 1036 [2024-10-11 03:51:39,886 INFO L226 Difference]: Without dead ends: 954 [2024-10-11 03:51:39,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:51:39,887 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 2582 mSDsluCounter, 2250 mSDsCounter, 0 mSdLazyCounter, 2124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2582 SdHoareTripleChecker+Valid, 2837 SdHoareTripleChecker+Invalid, 2128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:39,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2582 Valid, 2837 Invalid, 2128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2124 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:51:39,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-11 03:51:39,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 634. [2024-10-11 03:51:39,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3594771241830066) internal successors, (832), 633 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 832 transitions. [2024-10-11 03:51:39,896 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 832 transitions. Word has length 94 [2024-10-11 03:51:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:39,896 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 832 transitions. [2024-10-11 03:51:39,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:39,897 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 832 transitions. [2024-10-11 03:51:39,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:51:39,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:39,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:39,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:51:39,898 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:39,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:39,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2039186161, now seen corresponding path program 1 times [2024-10-11 03:51:39,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:39,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422728073] [2024-10-11 03:51:39,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:39,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:40,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:40,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:40,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422728073] [2024-10-11 03:51:40,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422728073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:40,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:40,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:40,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658856165] [2024-10-11 03:51:40,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:40,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:40,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:40,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:40,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:40,193 INFO L87 Difference]: Start difference. First operand 634 states and 832 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:41,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:41,199 INFO L93 Difference]: Finished difference Result 1040 states and 1372 transitions. [2024-10-11 03:51:41,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:51:41,200 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:51:41,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:41,202 INFO L225 Difference]: With dead ends: 1040 [2024-10-11 03:51:41,202 INFO L226 Difference]: Without dead ends: 954 [2024-10-11 03:51:41,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:51:41,203 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 2578 mSDsluCounter, 2250 mSDsCounter, 0 mSdLazyCounter, 2120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2578 SdHoareTripleChecker+Valid, 2837 SdHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:41,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2578 Valid, 2837 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2120 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:51:41,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-11 03:51:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 634. [2024-10-11 03:51:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.357843137254902) internal successors, (831), 633 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:41,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 831 transitions. [2024-10-11 03:51:41,213 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 831 transitions. Word has length 94 [2024-10-11 03:51:41,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:41,213 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 831 transitions. [2024-10-11 03:51:41,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:41,214 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 831 transitions. [2024-10-11 03:51:41,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:51:41,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:41,215 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:41,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:51:41,216 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:41,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:41,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1846935907, now seen corresponding path program 1 times [2024-10-11 03:51:41,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:41,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319774884] [2024-10-11 03:51:41,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:41,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:41,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:41,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319774884] [2024-10-11 03:51:41,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319774884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:41,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:41,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:41,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032191175] [2024-10-11 03:51:41,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:41,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:41,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:41,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:41,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:41,478 INFO L87 Difference]: Start difference. First operand 634 states and 831 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:42,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:42,396 INFO L93 Difference]: Finished difference Result 1078 states and 1424 transitions. [2024-10-11 03:51:42,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:51:42,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:51:42,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:42,399 INFO L225 Difference]: With dead ends: 1078 [2024-10-11 03:51:42,399 INFO L226 Difference]: Without dead ends: 970 [2024-10-11 03:51:42,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:51:42,400 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 1897 mSDsluCounter, 2039 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 2660 SdHoareTripleChecker+Invalid, 2020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:42,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1897 Valid, 2660 Invalid, 2020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:51:42,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-10-11 03:51:42,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 634. [2024-10-11 03:51:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3562091503267975) internal successors, (830), 633 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 830 transitions. [2024-10-11 03:51:42,409 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 830 transitions. Word has length 94 [2024-10-11 03:51:42,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:42,409 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 830 transitions. [2024-10-11 03:51:42,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 830 transitions. [2024-10-11 03:51:42,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:51:42,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:42,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:42,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 03:51:42,411 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:42,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:42,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1204221916, now seen corresponding path program 1 times [2024-10-11 03:51:42,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:42,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286002155] [2024-10-11 03:51:42,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:42,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:42,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:42,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286002155] [2024-10-11 03:51:42,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286002155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:42,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:42,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:42,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281034528] [2024-10-11 03:51:42,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:42,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:42,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:42,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:42,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:42,680 INFO L87 Difference]: Start difference. First operand 634 states and 830 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:43,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:43,548 INFO L93 Difference]: Finished difference Result 1069 states and 1415 transitions. [2024-10-11 03:51:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:51:43,548 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:51:43,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:43,550 INFO L225 Difference]: With dead ends: 1069 [2024-10-11 03:51:43,550 INFO L226 Difference]: Without dead ends: 970 [2024-10-11 03:51:43,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:51:43,551 INFO L432 NwaCegarLoop]: 724 mSDtfsCounter, 2489 mSDsluCounter, 2056 mSDsCounter, 0 mSdLazyCounter, 1895 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2489 SdHoareTripleChecker+Valid, 2780 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:43,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2489 Valid, 2780 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1895 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:51:43,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-10-11 03:51:43,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 634. [2024-10-11 03:51:43,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3545751633986929) internal successors, (829), 633 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:43,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 829 transitions. [2024-10-11 03:51:43,559 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 829 transitions. Word has length 94 [2024-10-11 03:51:43,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:43,559 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 829 transitions. [2024-10-11 03:51:43,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:43,559 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 829 transitions. [2024-10-11 03:51:43,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:51:43,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:43,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:43,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 03:51:43,561 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:43,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:43,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2102424565, now seen corresponding path program 1 times [2024-10-11 03:51:43,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:43,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959115658] [2024-10-11 03:51:43,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:43,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:43,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:43,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959115658] [2024-10-11 03:51:43,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959115658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:43,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:43,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:43,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679639245] [2024-10-11 03:51:43,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:43,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:43,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:43,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:43,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:43,831 INFO L87 Difference]: Start difference. First operand 634 states and 829 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:44,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:44,720 INFO L93 Difference]: Finished difference Result 1036 states and 1366 transitions. [2024-10-11 03:51:44,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:51:44,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:51:44,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:44,723 INFO L225 Difference]: With dead ends: 1036 [2024-10-11 03:51:44,723 INFO L226 Difference]: Without dead ends: 954 [2024-10-11 03:51:44,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:51:44,724 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 1965 mSDsluCounter, 1898 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1965 SdHoareTripleChecker+Valid, 2480 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:44,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1965 Valid, 2480 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:51:44,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-11 03:51:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 634. [2024-10-11 03:51:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3529411764705883) internal successors, (828), 633 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 828 transitions. [2024-10-11 03:51:44,735 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 828 transitions. Word has length 94 [2024-10-11 03:51:44,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:44,735 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 828 transitions. [2024-10-11 03:51:44,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:44,736 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 828 transitions. [2024-10-11 03:51:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:51:44,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:44,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:44,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 03:51:44,738 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:44,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:44,739 INFO L85 PathProgramCache]: Analyzing trace with hash -210482352, now seen corresponding path program 1 times [2024-10-11 03:51:44,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:44,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837687612] [2024-10-11 03:51:44,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:44,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:45,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:45,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:45,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837687612] [2024-10-11 03:51:45,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837687612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:45,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:45,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:45,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131796557] [2024-10-11 03:51:45,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:45,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:45,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:45,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:45,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:45,015 INFO L87 Difference]: Start difference. First operand 634 states and 828 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:46,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:46,071 INFO L93 Difference]: Finished difference Result 1078 states and 1422 transitions. [2024-10-11 03:51:46,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:51:46,071 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:51:46,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:46,075 INFO L225 Difference]: With dead ends: 1078 [2024-10-11 03:51:46,075 INFO L226 Difference]: Without dead ends: 970 [2024-10-11 03:51:46,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:51:46,076 INFO L432 NwaCegarLoop]: 811 mSDtfsCounter, 1709 mSDsluCounter, 2706 mSDsCounter, 0 mSdLazyCounter, 2407 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 3517 SdHoareTripleChecker+Invalid, 2410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:46,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1709 Valid, 3517 Invalid, 2410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2407 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:51:46,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-10-11 03:51:46,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 634. [2024-10-11 03:51:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3513071895424837) internal successors, (827), 633 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 827 transitions. [2024-10-11 03:51:46,086 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 827 transitions. Word has length 94 [2024-10-11 03:51:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:46,086 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 827 transitions. [2024-10-11 03:51:46,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 827 transitions. [2024-10-11 03:51:46,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:51:46,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:46,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:46,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 03:51:46,088 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:46,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:46,088 INFO L85 PathProgramCache]: Analyzing trace with hash -619327580, now seen corresponding path program 1 times [2024-10-11 03:51:46,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:46,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900645177] [2024-10-11 03:51:46,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:46,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:46,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:46,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900645177] [2024-10-11 03:51:46,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900645177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:46,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:46,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:46,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610097758] [2024-10-11 03:51:46,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:46,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:46,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:46,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:46,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:46,406 INFO L87 Difference]: Start difference. First operand 634 states and 827 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:47,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:47,421 INFO L93 Difference]: Finished difference Result 1040 states and 1368 transitions. [2024-10-11 03:51:47,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:51:47,421 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:51:47,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:47,424 INFO L225 Difference]: With dead ends: 1040 [2024-10-11 03:51:47,424 INFO L226 Difference]: Without dead ends: 954 [2024-10-11 03:51:47,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:51:47,425 INFO L432 NwaCegarLoop]: 793 mSDtfsCounter, 2556 mSDsluCounter, 2620 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2556 SdHoareTripleChecker+Valid, 3413 SdHoareTripleChecker+Invalid, 2380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:47,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2556 Valid, 3413 Invalid, 2380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:51:47,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-11 03:51:47,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 634. [2024-10-11 03:51:47,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3496732026143792) internal successors, (826), 633 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 826 transitions. [2024-10-11 03:51:47,433 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 826 transitions. Word has length 94 [2024-10-11 03:51:47,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:47,434 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 826 transitions. [2024-10-11 03:51:47,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:47,434 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 826 transitions. [2024-10-11 03:51:47,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:51:47,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:47,435 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:47,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 03:51:47,436 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:47,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:47,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1484555531, now seen corresponding path program 1 times [2024-10-11 03:51:47,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:47,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517625965] [2024-10-11 03:51:47,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:47,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:47,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:47,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:47,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517625965] [2024-10-11 03:51:47,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517625965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:47,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:47,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:47,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699764532] [2024-10-11 03:51:47,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:47,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:47,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:47,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:47,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:47,706 INFO L87 Difference]: Start difference. First operand 634 states and 826 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:48,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:48,802 INFO L93 Difference]: Finished difference Result 1101 states and 1458 transitions. [2024-10-11 03:51:48,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:51:48,803 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:51:48,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:48,806 INFO L225 Difference]: With dead ends: 1101 [2024-10-11 03:51:48,806 INFO L226 Difference]: Without dead ends: 978 [2024-10-11 03:51:48,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:51:48,807 INFO L432 NwaCegarLoop]: 812 mSDtfsCounter, 2505 mSDsluCounter, 2772 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2505 SdHoareTripleChecker+Valid, 3584 SdHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:48,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2505 Valid, 3584 Invalid, 2354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:51:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-10-11 03:51:48,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 634. [2024-10-11 03:51:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3480392156862746) internal successors, (825), 633 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:48,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 825 transitions. [2024-10-11 03:51:48,816 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 825 transitions. Word has length 94 [2024-10-11 03:51:48,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:48,816 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 825 transitions. [2024-10-11 03:51:48,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:48,817 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 825 transitions. [2024-10-11 03:51:48,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:51:48,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:48,818 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:48,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 03:51:48,818 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:48,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:48,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1893494246, now seen corresponding path program 1 times [2024-10-11 03:51:48,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:48,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902665149] [2024-10-11 03:51:48,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:48,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:49,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:49,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:49,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902665149] [2024-10-11 03:51:49,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902665149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:49,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:49,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:49,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675811176] [2024-10-11 03:51:49,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:49,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:49,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:49,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:49,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:49,059 INFO L87 Difference]: Start difference. First operand 634 states and 825 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:49,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:49,985 INFO L93 Difference]: Finished difference Result 1036 states and 1362 transitions. [2024-10-11 03:51:49,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:51:49,985 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:51:49,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:49,987 INFO L225 Difference]: With dead ends: 1036 [2024-10-11 03:51:49,987 INFO L226 Difference]: Without dead ends: 954 [2024-10-11 03:51:49,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:51:49,988 INFO L432 NwaCegarLoop]: 601 mSDtfsCounter, 1916 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1916 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:49,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1916 Valid, 2553 Invalid, 1987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:51:49,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-11 03:51:49,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 634. [2024-10-11 03:51:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.34640522875817) internal successors, (824), 633 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:49,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 824 transitions. [2024-10-11 03:51:49,996 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 824 transitions. Word has length 94 [2024-10-11 03:51:49,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:49,996 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 824 transitions. [2024-10-11 03:51:49,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:49,996 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 824 transitions. [2024-10-11 03:51:49,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:51:49,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:49,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:49,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 03:51:49,998 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:49,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:49,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1723188937, now seen corresponding path program 1 times [2024-10-11 03:51:49,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:49,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535566166] [2024-10-11 03:51:49,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:49,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:50,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:50,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:50,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535566166] [2024-10-11 03:51:50,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535566166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:50,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:50,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:50,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840285267] [2024-10-11 03:51:50,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:50,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:50,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:50,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:50,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:50,223 INFO L87 Difference]: Start difference. First operand 634 states and 824 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:51,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:51,101 INFO L93 Difference]: Finished difference Result 1034 states and 1358 transitions. [2024-10-11 03:51:51,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:51:51,102 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:51:51,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:51,104 INFO L225 Difference]: With dead ends: 1034 [2024-10-11 03:51:51,104 INFO L226 Difference]: Without dead ends: 954 [2024-10-11 03:51:51,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:51:51,106 INFO L432 NwaCegarLoop]: 604 mSDtfsCounter, 2879 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2879 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:51,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2879 Valid, 2568 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1967 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:51:51,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-11 03:51:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 634. [2024-10-11 03:51:51,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3447712418300655) internal successors, (823), 633 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:51,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 823 transitions. [2024-10-11 03:51:51,115 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 823 transitions. Word has length 94 [2024-10-11 03:51:51,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:51,115 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 823 transitions. [2024-10-11 03:51:51,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:51,116 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 823 transitions. [2024-10-11 03:51:51,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:51:51,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:51,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:51,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 03:51:51,117 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:51,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:51,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1766740068, now seen corresponding path program 1 times [2024-10-11 03:51:51,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:51,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408966111] [2024-10-11 03:51:51,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:51,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:51,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:51,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:51,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408966111] [2024-10-11 03:51:51,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408966111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:51,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:51,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:51,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903808928] [2024-10-11 03:51:51,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:51,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:51,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:51,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:51,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:51,421 INFO L87 Difference]: Start difference. First operand 634 states and 823 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:52,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:52,390 INFO L93 Difference]: Finished difference Result 998 states and 1294 transitions. [2024-10-11 03:51:52,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:51:52,390 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-11 03:51:52,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:52,392 INFO L225 Difference]: With dead ends: 998 [2024-10-11 03:51:52,392 INFO L226 Difference]: Without dead ends: 922 [2024-10-11 03:51:52,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:51:52,393 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 2650 mSDsluCounter, 1995 mSDsCounter, 0 mSdLazyCounter, 1958 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2650 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:52,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2650 Valid, 2507 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1958 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:51:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-10-11 03:51:52,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 634. [2024-10-11 03:51:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3431372549019607) internal successors, (822), 633 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:52,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 822 transitions. [2024-10-11 03:51:52,402 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 822 transitions. Word has length 96 [2024-10-11 03:51:52,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:52,403 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 822 transitions. [2024-10-11 03:51:52,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 822 transitions. [2024-10-11 03:51:52,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:51:52,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:52,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:52,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 03:51:52,404 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:52,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:52,405 INFO L85 PathProgramCache]: Analyzing trace with hash -854297767, now seen corresponding path program 1 times [2024-10-11 03:51:52,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:52,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723645877] [2024-10-11 03:51:52,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:52,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:52,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:52,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723645877] [2024-10-11 03:51:52,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723645877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:52,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:52,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:52,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787437772] [2024-10-11 03:51:52,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:52,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:52,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:52,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:52,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:52,688 INFO L87 Difference]: Start difference. First operand 634 states and 822 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:53,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:53,800 INFO L93 Difference]: Finished difference Result 1040 states and 1361 transitions. [2024-10-11 03:51:53,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:51:53,801 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-11 03:51:53,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:53,802 INFO L225 Difference]: With dead ends: 1040 [2024-10-11 03:51:53,802 INFO L226 Difference]: Without dead ends: 954 [2024-10-11 03:51:53,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:51:53,803 INFO L432 NwaCegarLoop]: 788 mSDtfsCounter, 2540 mSDsluCounter, 2608 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2540 SdHoareTripleChecker+Valid, 3396 SdHoareTripleChecker+Invalid, 2355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:53,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2540 Valid, 3396 Invalid, 2355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:51:53,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-11 03:51:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 634. [2024-10-11 03:51:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.341503267973856) internal successors, (821), 633 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:53,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 821 transitions. [2024-10-11 03:51:53,809 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 821 transitions. Word has length 96 [2024-10-11 03:51:53,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:53,810 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 821 transitions. [2024-10-11 03:51:53,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:53,810 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 821 transitions. [2024-10-11 03:51:53,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:51:53,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:53,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:53,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 03:51:53,812 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:53,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1255893419, now seen corresponding path program 1 times [2024-10-11 03:51:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:53,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409492778] [2024-10-11 03:51:53,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:53,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:54,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:54,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:54,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409492778] [2024-10-11 03:51:54,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409492778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:54,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:54,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:54,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120200667] [2024-10-11 03:51:54,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:54,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:54,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:54,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:54,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:54,118 INFO L87 Difference]: Start difference. First operand 634 states and 821 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:55,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:55,213 INFO L93 Difference]: Finished difference Result 1001 states and 1295 transitions. [2024-10-11 03:51:55,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:51:55,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-11 03:51:55,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:55,215 INFO L225 Difference]: With dead ends: 1001 [2024-10-11 03:51:55,215 INFO L226 Difference]: Without dead ends: 922 [2024-10-11 03:51:55,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:51:55,216 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 2641 mSDsluCounter, 2025 mSDsCounter, 0 mSdLazyCounter, 1963 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2641 SdHoareTripleChecker+Valid, 2550 SdHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:55,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2641 Valid, 2550 Invalid, 1967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1963 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:51:55,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-10-11 03:51:55,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 634. [2024-10-11 03:51:55,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3398692810457515) internal successors, (820), 633 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 820 transitions. [2024-10-11 03:51:55,222 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 820 transitions. Word has length 96 [2024-10-11 03:51:55,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:55,222 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 820 transitions. [2024-10-11 03:51:55,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:55,223 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 820 transitions. [2024-10-11 03:51:55,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:51:55,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:55,224 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:55,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 03:51:55,224 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:55,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:55,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1126876775, now seen corresponding path program 1 times [2024-10-11 03:51:55,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:55,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439398559] [2024-10-11 03:51:55,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:55,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:55,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-10-11 03:51:55,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:55,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439398559] [2024-10-11 03:51:55,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439398559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:55,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:55,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:55,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939217518] [2024-10-11 03:51:55,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:55,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:55,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:55,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:55,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:55,445 INFO L87 Difference]: Start difference. First operand 634 states and 820 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:56,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:56,324 INFO L93 Difference]: Finished difference Result 1045 states and 1363 transitions. [2024-10-11 03:51:56,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:51:56,324 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-11 03:51:56,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:56,326 INFO L225 Difference]: With dead ends: 1045 [2024-10-11 03:51:56,326 INFO L226 Difference]: Without dead ends: 954 [2024-10-11 03:51:56,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:51:56,327 INFO L432 NwaCegarLoop]: 601 mSDtfsCounter, 2864 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2864 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:56,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2864 Valid, 2553 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:51:56,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-11 03:51:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 634. [2024-10-11 03:51:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.338235294117647) internal successors, (819), 633 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 819 transitions. [2024-10-11 03:51:56,333 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 819 transitions. Word has length 96 [2024-10-11 03:51:56,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:56,333 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 819 transitions. [2024-10-11 03:51:56,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 819 transitions. [2024-10-11 03:51:56,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:51:56,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:56,334 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:56,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 03:51:56,335 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:56,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:56,335 INFO L85 PathProgramCache]: Analyzing trace with hash 443260260, now seen corresponding path program 1 times [2024-10-11 03:51:56,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:56,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504923328] [2024-10-11 03:51:56,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:56,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:56,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-10-11 03:51:56,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:56,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504923328] [2024-10-11 03:51:56,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504923328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:56,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:56,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:56,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103129723] [2024-10-11 03:51:56,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:56,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:56,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:56,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:56,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:56,584 INFO L87 Difference]: Start difference. First operand 634 states and 819 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:57,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:57,464 INFO L93 Difference]: Finished difference Result 1001 states and 1293 transitions. [2024-10-11 03:51:57,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:51:57,465 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-11 03:51:57,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:57,466 INFO L225 Difference]: With dead ends: 1001 [2024-10-11 03:51:57,466 INFO L226 Difference]: Without dead ends: 922 [2024-10-11 03:51:57,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:51:57,467 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 1850 mSDsluCounter, 2069 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1850 SdHoareTripleChecker+Valid, 2612 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:57,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1850 Valid, 2612 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1969 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:51:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-10-11 03:51:57,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 634. [2024-10-11 03:51:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3366013071895424) internal successors, (818), 633 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 818 transitions. [2024-10-11 03:51:57,473 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 818 transitions. Word has length 96 [2024-10-11 03:51:57,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:57,474 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 818 transitions. [2024-10-11 03:51:57,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:57,474 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 818 transitions. [2024-10-11 03:51:57,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:51:57,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:57,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:57,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-11 03:51:57,475 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:57,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:57,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1939509934, now seen corresponding path program 1 times [2024-10-11 03:51:57,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:57,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757892548] [2024-10-11 03:51:57,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:57,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:57,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:57,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757892548] [2024-10-11 03:51:57,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757892548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:57,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:57,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:57,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99872608] [2024-10-11 03:51:57,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:57,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:57,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:57,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:57,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:57,706 INFO L87 Difference]: Start difference. First operand 634 states and 818 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:58,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:58,645 INFO L93 Difference]: Finished difference Result 1045 states and 1360 transitions. [2024-10-11 03:51:58,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:51:58,646 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-11 03:51:58,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:58,647 INFO L225 Difference]: With dead ends: 1045 [2024-10-11 03:51:58,647 INFO L226 Difference]: Without dead ends: 954 [2024-10-11 03:51:58,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:51:58,648 INFO L432 NwaCegarLoop]: 604 mSDtfsCounter, 2858 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 1933 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2858 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:58,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2858 Valid, 2568 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1933 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:51:58,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-11 03:51:58,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 634. [2024-10-11 03:51:58,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3349673202614378) internal successors, (817), 633 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 817 transitions. [2024-10-11 03:51:58,658 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 817 transitions. Word has length 96 [2024-10-11 03:51:58,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:58,658 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 817 transitions. [2024-10-11 03:51:58,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 817 transitions. [2024-10-11 03:51:58,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:51:58,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:58,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:58,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-11 03:51:58,659 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:58,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:58,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1544761606, now seen corresponding path program 1 times [2024-10-11 03:51:58,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:58,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447567513] [2024-10-11 03:51:58,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:58,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:58,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:58,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:58,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447567513] [2024-10-11 03:51:58,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447567513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:58,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:58,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:58,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425426853] [2024-10-11 03:51:58,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:58,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:58,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:58,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:58,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:58,891 INFO L87 Difference]: Start difference. First operand 634 states and 817 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:59,950 INFO L93 Difference]: Finished difference Result 1084 states and 1412 transitions. [2024-10-11 03:51:59,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:51:59,951 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-11 03:51:59,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:59,952 INFO L225 Difference]: With dead ends: 1084 [2024-10-11 03:51:59,952 INFO L226 Difference]: Without dead ends: 970 [2024-10-11 03:51:59,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:51:59,953 INFO L432 NwaCegarLoop]: 656 mSDtfsCounter, 1800 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 2059 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1800 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 2063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:59,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1800 Valid, 2800 Invalid, 2063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2059 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:51:59,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-10-11 03:51:59,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 634. [2024-10-11 03:51:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3333333333333333) internal successors, (816), 633 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 816 transitions. [2024-10-11 03:51:59,961 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 816 transitions. Word has length 96 [2024-10-11 03:51:59,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:59,961 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 816 transitions. [2024-10-11 03:51:59,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:59,961 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 816 transitions. [2024-10-11 03:51:59,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:51:59,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:59,962 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:59,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-11 03:51:59,963 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:59,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:59,963 INFO L85 PathProgramCache]: Analyzing trace with hash -52113932, now seen corresponding path program 1 times [2024-10-11 03:51:59,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:59,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726421630] [2024-10-11 03:51:59,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:59,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:00,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:00,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:00,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726421630] [2024-10-11 03:52:00,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726421630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:00,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:00,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:00,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497473741] [2024-10-11 03:52:00,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:00,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:00,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:00,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:00,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:00,173 INFO L87 Difference]: Start difference. First operand 634 states and 816 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:01,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:01,178 INFO L93 Difference]: Finished difference Result 996 states and 1285 transitions. [2024-10-11 03:52:01,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:01,179 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-11 03:52:01,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:01,180 INFO L225 Difference]: With dead ends: 996 [2024-10-11 03:52:01,181 INFO L226 Difference]: Without dead ends: 922 [2024-10-11 03:52:01,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:52:01,181 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 2874 mSDsluCounter, 1806 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2874 SdHoareTripleChecker+Valid, 2379 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:01,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2874 Valid, 2379 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:52:01,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-10-11 03:52:01,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 634. [2024-10-11 03:52:01,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3316993464052287) internal successors, (815), 633 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 815 transitions. [2024-10-11 03:52:01,190 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 815 transitions. Word has length 96 [2024-10-11 03:52:01,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:01,190 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 815 transitions. [2024-10-11 03:52:01,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:01,191 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 815 transitions. [2024-10-11 03:52:01,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:52:01,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:01,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:01,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-11 03:52:01,192 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:52:01,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:01,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1952926503, now seen corresponding path program 1 times [2024-10-11 03:52:01,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:01,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910704755] [2024-10-11 03:52:01,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:01,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:01,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:01,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:01,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910704755] [2024-10-11 03:52:01,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910704755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:01,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:01,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:01,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296507169] [2024-10-11 03:52:01,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:01,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:01,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:01,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:01,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:01,420 INFO L87 Difference]: Start difference. First operand 634 states and 815 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:02,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:02,230 INFO L93 Difference]: Finished difference Result 998 states and 1286 transitions. [2024-10-11 03:52:02,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:52:02,230 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-11 03:52:02,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:02,232 INFO L225 Difference]: With dead ends: 998 [2024-10-11 03:52:02,232 INFO L226 Difference]: Without dead ends: 922 [2024-10-11 03:52:02,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:52:02,232 INFO L432 NwaCegarLoop]: 520 mSDtfsCounter, 3065 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3065 SdHoareTripleChecker+Valid, 2166 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:02,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3065 Valid, 2166 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:52:02,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-10-11 03:52:02,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 634. [2024-10-11 03:52:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3300653594771241) internal successors, (814), 633 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 814 transitions. [2024-10-11 03:52:02,239 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 814 transitions. Word has length 96 [2024-10-11 03:52:02,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:02,239 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 814 transitions. [2024-10-11 03:52:02,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:02,239 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 814 transitions. [2024-10-11 03:52:02,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:52:02,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:02,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:02,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-11 03:52:02,241 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:52:02,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:02,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1693346717, now seen corresponding path program 1 times [2024-10-11 03:52:02,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:02,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480684766] [2024-10-11 03:52:02,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:02,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:02,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:02,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:02,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480684766] [2024-10-11 03:52:02,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480684766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:02,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:02,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:02,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751263266] [2024-10-11 03:52:02,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:02,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:02,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:02,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:02,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:02,471 INFO L87 Difference]: Start difference. First operand 634 states and 814 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:03,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:03,273 INFO L93 Difference]: Finished difference Result 998 states and 1284 transitions. [2024-10-11 03:52:03,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:03,273 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-11 03:52:03,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:03,275 INFO L225 Difference]: With dead ends: 998 [2024-10-11 03:52:03,275 INFO L226 Difference]: Without dead ends: 922 [2024-10-11 03:52:03,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:52:03,276 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 3062 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3062 SdHoareTripleChecker+Valid, 2181 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:03,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3062 Valid, 2181 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1704 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:52:03,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-10-11 03:52:03,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 634. [2024-10-11 03:52:03,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 612 states have (on average 1.3284313725490196) internal successors, (813), 633 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:03,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 813 transitions. [2024-10-11 03:52:03,284 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 813 transitions. Word has length 96 [2024-10-11 03:52:03,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:03,284 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 813 transitions. [2024-10-11 03:52:03,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:03,284 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 813 transitions. [2024-10-11 03:52:03,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:52:03,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:03,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:03,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-11 03:52:03,286 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:52:03,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:03,286 INFO L85 PathProgramCache]: Analyzing trace with hash -927310799, now seen corresponding path program 1 times [2024-10-11 03:52:03,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:03,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955384888] [2024-10-11 03:52:03,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:03,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:03,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:03,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955384888] [2024-10-11 03:52:03,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955384888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:03,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:03,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:52:03,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792051766] [2024-10-11 03:52:03,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:03,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:52:03,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:03,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:52:03,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:52:03,704 INFO L87 Difference]: Start difference. First operand 634 states and 813 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:05,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:05,050 INFO L93 Difference]: Finished difference Result 1262 states and 1674 transitions. [2024-10-11 03:52:05,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:52:05,050 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-11 03:52:05,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:05,052 INFO L225 Difference]: With dead ends: 1262 [2024-10-11 03:52:05,052 INFO L226 Difference]: Without dead ends: 1176 [2024-10-11 03:52:05,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:52:05,053 INFO L432 NwaCegarLoop]: 642 mSDtfsCounter, 5680 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 2134 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5680 SdHoareTripleChecker+Valid, 2824 SdHoareTripleChecker+Invalid, 2333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 2134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:05,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5680 Valid, 2824 Invalid, 2333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 2134 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:52:05,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2024-10-11 03:52:05,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 638. [2024-10-11 03:52:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3262987012987013) internal successors, (817), 637 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:05,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 817 transitions. [2024-10-11 03:52:05,059 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 817 transitions. Word has length 96 [2024-10-11 03:52:05,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:05,059 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 817 transitions. [2024-10-11 03:52:05,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:05,059 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 817 transitions. [2024-10-11 03:52:05,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:52:05,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:05,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:05,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-11 03:52:05,061 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:52:05,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:05,062 INFO L85 PathProgramCache]: Analyzing trace with hash -375995292, now seen corresponding path program 1 times [2024-10-11 03:52:05,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:05,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262033424] [2024-10-11 03:52:05,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:05,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:05,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:05,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:05,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262033424] [2024-10-11 03:52:05,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262033424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:05,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:05,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:05,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77109247] [2024-10-11 03:52:05,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:05,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:05,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:05,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:05,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:05,308 INFO L87 Difference]: Start difference. First operand 638 states and 817 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:06,220 INFO L93 Difference]: Finished difference Result 931 states and 1179 transitions. [2024-10-11 03:52:06,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:52:06,221 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-11 03:52:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:06,223 INFO L225 Difference]: With dead ends: 931 [2024-10-11 03:52:06,223 INFO L226 Difference]: Without dead ends: 926 [2024-10-11 03:52:06,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:52:06,224 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 2612 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 1966 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2612 SdHoareTripleChecker+Valid, 2661 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:06,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2612 Valid, 2661 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1966 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:52:06,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-11 03:52:06,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 638. [2024-10-11 03:52:06,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3246753246753247) internal successors, (816), 637 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 816 transitions. [2024-10-11 03:52:06,232 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 816 transitions. Word has length 96 [2024-10-11 03:52:06,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:06,232 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 816 transitions. [2024-10-11 03:52:06,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:06,233 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 816 transitions. [2024-10-11 03:52:06,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:52:06,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:06,234 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:06,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-11 03:52:06,234 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:52:06,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:06,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1536201810, now seen corresponding path program 1 times [2024-10-11 03:52:06,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:06,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201136805] [2024-10-11 03:52:06,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:06,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:06,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:06,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:06,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201136805] [2024-10-11 03:52:06,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201136805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:06,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:06,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:06,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250335145] [2024-10-11 03:52:06,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:06,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:06,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:06,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:06,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:06,437 INFO L87 Difference]: Start difference. First operand 638 states and 816 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:07,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:07,247 INFO L93 Difference]: Finished difference Result 971 states and 1240 transitions. [2024-10-11 03:52:07,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:52:07,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-11 03:52:07,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:07,249 INFO L225 Difference]: With dead ends: 971 [2024-10-11 03:52:07,249 INFO L226 Difference]: Without dead ends: 954 [2024-10-11 03:52:07,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:52:07,250 INFO L432 NwaCegarLoop]: 729 mSDtfsCounter, 2469 mSDsluCounter, 2062 mSDsCounter, 0 mSdLazyCounter, 1847 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2469 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 1851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:07,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2469 Valid, 2791 Invalid, 1851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1847 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:52:07,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-11 03:52:07,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 638. [2024-10-11 03:52:07,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.323051948051948) internal successors, (815), 637 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 815 transitions. [2024-10-11 03:52:07,256 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 815 transitions. Word has length 96 [2024-10-11 03:52:07,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:07,257 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 815 transitions. [2024-10-11 03:52:07,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:52:07,257 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 815 transitions. [2024-10-11 03:52:07,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:52:07,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:07,258 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:07,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-11 03:52:07,258 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:52:07,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:07,259 INFO L85 PathProgramCache]: Analyzing trace with hash 134588212, now seen corresponding path program 1 times [2024-10-11 03:52:07,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:07,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127601395] [2024-10-11 03:52:07,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:07,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:07,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:52:07,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:07,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127601395] [2024-10-11 03:52:07,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127601395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:07,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:07,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:52:07,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242296102] [2024-10-11 03:52:07,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:07,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:52:07,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:07,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:52:07,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:52:07,503 INFO L87 Difference]: Start difference. First operand 638 states and 815 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)