./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c698c3a474f0bb431ef6e81ac39d288198716f9950dc2b1ea90a04cccf08b06 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:32:03,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:32:03,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:32:03,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:32:03,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:32:03,703 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:32:03,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:32:03,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:32:03,704 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:32:03,705 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:32:03,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:32:03,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:32:03,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:32:03,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:32:03,706 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:32:03,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:32:03,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:32:03,707 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:32:03,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:32:03,707 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:32:03,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:32:03,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:32:03,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:32:03,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:32:03,709 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:32:03,709 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:32:03,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:32:03,710 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:32:03,710 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:32:03,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:32:03,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:32:03,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:32:03,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:32:03,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:32:03,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:32:03,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:32:03,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:32:03,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:32:03,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:32:03,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:32:03,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:32:03,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:32:03,713 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6c698c3a474f0bb431ef6e81ac39d288198716f9950dc2b1ea90a04cccf08b06 [2024-10-12 20:32:04,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:32:04,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:32:04,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:32:04,054 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:32:04,057 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:32:04,059 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2024-10-12 20:32:05,503 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:32:05,910 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:32:05,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2024-10-12 20:32:05,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b57598067/b23fa4e8c2a443b3b5628b203b255996/FLAG306d90f71 [2024-10-12 20:32:05,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b57598067/b23fa4e8c2a443b3b5628b203b255996 [2024-10-12 20:32:05,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:32:05,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:32:05,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:32:05,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:32:05,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:32:05,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:32:05" (1/1) ... [2024-10-12 20:32:05,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1179cc2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:05, skipping insertion in model container [2024-10-12 20:32:05,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:32:05" (1/1) ... [2024-10-12 20:32:06,103 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:32:06,533 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[17604,17617] [2024-10-12 20:32:06,568 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[22921,22934] [2024-10-12 20:32:06,601 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[24278,24291] [2024-10-12 20:32:06,616 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[25086,25099] [2024-10-12 20:32:06,624 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[26814,26827] [2024-10-12 20:32:06,629 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[27622,27635] [2024-10-12 20:32:06,636 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[28801,28814] [2024-10-12 20:32:06,648 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[31541,31554] [2024-10-12 20:32:06,653 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[32352,32365] [2024-10-12 20:32:06,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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[33534,33547] [2024-10-12 20:32:06,669 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[35725,35738] [2024-10-12 20:32:06,685 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[39985,39998] [2024-10-12 20:32:06,690 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[40796,40809] [2024-10-12 20:32:06,694 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[41978,41991] [2024-10-12 20:32:06,702 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[44169,44182] [2024-10-12 20:32:06,724 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[47880,47893] [2024-10-12 20:32:06,743 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[54627,54640] [2024-10-12 20:32:06,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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[55438,55451] [2024-10-12 20:32:06,752 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[56581,56594] [2024-10-12 20:32:06,759 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[58733,58746] [2024-10-12 20:32:06,771 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[62650,62663] [2024-10-12 20:32:06,790 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[69599,69612] [2024-10-12 20:32:06,821 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[82335,82348] [2024-10-12 20:32:06,825 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[83146,83159] [2024-10-12 20:32:06,830 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[84328,84341] [2024-10-12 20:32:06,837 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[86519,86532] [2024-10-12 20:32:06,855 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[90230,90243] [2024-10-12 20:32:06,880 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[96428,96441] [2024-10-12 20:32:06,906 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[107019,107032] [2024-10-12 20:32:07,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:32:07,378 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:32:07,443 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[17604,17617] [2024-10-12 20:32:07,463 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[22921,22934] [2024-10-12 20:32:07,468 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[24278,24291] [2024-10-12 20:32:07,471 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[25086,25099] [2024-10-12 20:32:07,478 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[26814,26827] [2024-10-12 20:32:07,481 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[27622,27635] [2024-10-12 20:32:07,486 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[28801,28814] [2024-10-12 20:32:07,495 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[31541,31554] [2024-10-12 20:32:07,498 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[32352,32365] [2024-10-12 20:32:07,502 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[33534,33547] [2024-10-12 20:32:07,508 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[35725,35738] [2024-10-12 20:32:07,519 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[39985,39998] [2024-10-12 20:32:07,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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[40796,40809] [2024-10-12 20:32:07,527 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[41978,41991] [2024-10-12 20:32:07,535 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[44169,44182] [2024-10-12 20:32:07,544 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[47880,47893] [2024-10-12 20:32:07,562 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[54627,54640] [2024-10-12 20:32:07,565 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[55438,55451] [2024-10-12 20:32:07,568 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[56581,56594] [2024-10-12 20:32:07,575 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[58733,58746] [2024-10-12 20:32:07,584 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[62650,62663] [2024-10-12 20:32:07,599 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[69599,69612] [2024-10-12 20:32:07,625 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[82335,82348] [2024-10-12 20:32:07,628 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[83146,83159] [2024-10-12 20:32:07,632 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[84328,84341] [2024-10-12 20:32:07,638 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[86519,86532] [2024-10-12 20:32:07,646 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[90230,90243] [2024-10-12 20:32:07,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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[96428,96441] [2024-10-12 20:32:07,678 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[107019,107032] [2024-10-12 20:32:08,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:32:08,103 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:32:08,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:08 WrapperNode [2024-10-12 20:32:08,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:32:08,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:32:08,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:32:08,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:32:08,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:08" (1/1) ... [2024-10-12 20:32:08,169 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:08" (1/1) ... [2024-10-12 20:32:08,311 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13514 [2024-10-12 20:32:08,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:32:08,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:32:08,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:32:08,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:32:08,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:08" (1/1) ... [2024-10-12 20:32:08,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:08" (1/1) ... [2024-10-12 20:32:08,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:08" (1/1) ... [2024-10-12 20:32:08,539 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:32:08,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:08" (1/1) ... [2024-10-12 20:32:08,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:08" (1/1) ... [2024-10-12 20:32:08,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:08" (1/1) ... [2024-10-12 20:32:08,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:08" (1/1) ... [2024-10-12 20:32:08,663 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:08" (1/1) ... [2024-10-12 20:32:08,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:08" (1/1) ... [2024-10-12 20:32:08,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:32:08,723 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:32:08,723 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:32:08,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:32:08,724 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:08" (1/1) ... [2024-10-12 20:32:08,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:32:08,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:32:08,759 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:32:08,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:32:08,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:32:08,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:32:08,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:32:08,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:32:09,213 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:32:09,216 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:32:13,625 INFO L? ?]: Removed 2124 outVars from TransFormulas that were not future-live. [2024-10-12 20:32:13,626 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:32:13,711 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:32:13,711 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:32:13,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:32:13 BoogieIcfgContainer [2024-10-12 20:32:13,712 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:32:13,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:32:13,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:32:13,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:32:13,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:32:05" (1/3) ... [2024-10-12 20:32:13,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c13d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:32:13, skipping insertion in model container [2024-10-12 20:32:13,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:32:08" (2/3) ... [2024-10-12 20:32:13,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c13d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:32:13, skipping insertion in model container [2024-10-12 20:32:13,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:32:13" (3/3) ... [2024-10-12 20:32:13,719 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2024-10-12 20:32:13,731 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:32:13,731 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-10-12 20:32:13,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:32:13,836 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;@7eb80550, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:32:13,836 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-10-12 20:32:13,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 2080 states, 2050 states have (on average 1.8614634146341464) internal successors, (3816), 2079 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:13,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 20:32:13,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:13,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:13,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:13,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:13,879 INFO L85 PathProgramCache]: Analyzing trace with hash -393314146, now seen corresponding path program 1 times [2024-10-12 20:32:13,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:13,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101959270] [2024-10-12 20:32:13,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:13,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:14,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:14,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:14,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101959270] [2024-10-12 20:32:14,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101959270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:14,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:14,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:14,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283716483] [2024-10-12 20:32:14,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:14,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:14,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:14,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:14,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:14,452 INFO L87 Difference]: Start difference. First operand has 2080 states, 2050 states have (on average 1.8614634146341464) internal successors, (3816), 2079 states have internal predecessors, (3816), 0 states have call successors, (0), 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 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:15,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:15,503 INFO L93 Difference]: Finished difference Result 3090 states and 5487 transitions. [2024-10-12 20:32:15,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:15,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-12 20:32:15,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:15,523 INFO L225 Difference]: With dead ends: 3090 [2024-10-12 20:32:15,523 INFO L226 Difference]: Without dead ends: 1578 [2024-10-12 20:32:15,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:32:15,533 INFO L432 NwaCegarLoop]: 1850 mSDtfsCounter, 8239 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8239 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:15,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8239 Valid, 1890 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 20:32:15,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2024-10-12 20:32:15,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578. [2024-10-12 20:32:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1549 states have (on average 1.3247256294383474) internal successors, (2052), 1577 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2052 transitions. [2024-10-12 20:32:15,615 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2052 transitions. Word has length 100 [2024-10-12 20:32:15,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:15,615 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2052 transitions. [2024-10-12 20:32:15,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:15,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2052 transitions. [2024-10-12 20:32:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:32:15,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:15,621 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:15,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:32:15,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:15,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:15,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1603541041, now seen corresponding path program 1 times [2024-10-12 20:32:15,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:15,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357112675] [2024-10-12 20:32:15,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:15,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:15,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:15,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357112675] [2024-10-12 20:32:15,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357112675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:15,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:15,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:15,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397832942] [2024-10-12 20:32:15,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:15,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:15,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:15,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:15,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:15,914 INFO L87 Difference]: Start difference. First operand 1578 states and 2052 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:16,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:16,819 INFO L93 Difference]: Finished difference Result 2582 states and 3467 transitions. [2024-10-12 20:32:16,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:16,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-12 20:32:16,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:16,824 INFO L225 Difference]: With dead ends: 2582 [2024-10-12 20:32:16,824 INFO L226 Difference]: Without dead ends: 1370 [2024-10-12 20:32:16,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:32:16,827 INFO L432 NwaCegarLoop]: 934 mSDtfsCounter, 5289 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5289 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:16,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5289 Valid, 978 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:32:16,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2024-10-12 20:32:16,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1370. [2024-10-12 20:32:16,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1341 states have (on average 1.3504847129008204) internal successors, (1811), 1369 states have internal predecessors, (1811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1811 transitions. [2024-10-12 20:32:16,851 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1811 transitions. Word has length 101 [2024-10-12 20:32:16,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:16,852 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1811 transitions. [2024-10-12 20:32:16,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:16,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1811 transitions. [2024-10-12 20:32:16,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 20:32:16,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:16,857 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:16,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:32:16,857 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:16,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:16,858 INFO L85 PathProgramCache]: Analyzing trace with hash -589929397, now seen corresponding path program 1 times [2024-10-12 20:32:16,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:16,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821636367] [2024-10-12 20:32:16,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:16,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:17,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:17,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821636367] [2024-10-12 20:32:17,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821636367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:17,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:17,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:17,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447522089] [2024-10-12 20:32:17,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:17,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:17,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:17,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:17,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:17,194 INFO L87 Difference]: Start difference. First operand 1370 states and 1811 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:17,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:17,922 INFO L93 Difference]: Finished difference Result 2374 states and 3225 transitions. [2024-10-12 20:32:17,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:17,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-10-12 20:32:17,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:17,926 INFO L225 Difference]: With dead ends: 2374 [2024-10-12 20:32:17,926 INFO L226 Difference]: Without dead ends: 1230 [2024-10-12 20:32:17,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:32:17,928 INFO L432 NwaCegarLoop]: 907 mSDtfsCounter, 4862 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4862 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:17,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4862 Valid, 935 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:32:17,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2024-10-12 20:32:17,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2024-10-12 20:32:17,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1201 states have (on average 1.3771856786011656) internal successors, (1654), 1229 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1654 transitions. [2024-10-12 20:32:17,942 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1654 transitions. Word has length 102 [2024-10-12 20:32:17,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:17,943 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1654 transitions. [2024-10-12 20:32:17,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:17,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1654 transitions. [2024-10-12 20:32:17,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 20:32:17,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:17,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:17,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:32:17,946 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:17,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:17,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1121130778, now seen corresponding path program 1 times [2024-10-12 20:32:17,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:17,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643375420] [2024-10-12 20:32:17,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:17,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:18,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:18,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643375420] [2024-10-12 20:32:18,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643375420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:18,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:18,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:18,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696377020] [2024-10-12 20:32:18,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:18,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:18,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:18,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:18,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:18,087 INFO L87 Difference]: Start difference. First operand 1230 states and 1654 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:18,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:18,865 INFO L93 Difference]: Finished difference Result 2234 states and 3067 transitions. [2024-10-12 20:32:18,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:18,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-10-12 20:32:18,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:18,868 INFO L225 Difference]: With dead ends: 2234 [2024-10-12 20:32:18,869 INFO L226 Difference]: Without dead ends: 1190 [2024-10-12 20:32:18,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:32:18,870 INFO L432 NwaCegarLoop]: 671 mSDtfsCounter, 4628 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4628 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:18,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4628 Valid, 723 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:32:18,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2024-10-12 20:32:18,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1190. [2024-10-12 20:32:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1161 states have (on average 1.3824289405684755) internal successors, (1605), 1189 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1605 transitions. [2024-10-12 20:32:18,883 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1605 transitions. Word has length 103 [2024-10-12 20:32:18,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:18,883 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1605 transitions. [2024-10-12 20:32:18,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:18,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1605 transitions. [2024-10-12 20:32:18,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-12 20:32:18,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:18,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:32:18,886 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:18,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:18,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1195809120, now seen corresponding path program 1 times [2024-10-12 20:32:18,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:18,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595370066] [2024-10-12 20:32:18,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:18,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:19,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:19,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595370066] [2024-10-12 20:32:19,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595370066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:19,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:19,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:19,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144597844] [2024-10-12 20:32:19,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:19,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:19,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:19,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:19,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:19,105 INFO L87 Difference]: Start difference. First operand 1190 states and 1605 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:19,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:19,649 INFO L93 Difference]: Finished difference Result 2194 states and 3017 transitions. [2024-10-12 20:32:19,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:19,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-10-12 20:32:19,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:19,654 INFO L225 Difference]: With dead ends: 2194 [2024-10-12 20:32:19,654 INFO L226 Difference]: Without dead ends: 1128 [2024-10-12 20:32:19,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:32:19,657 INFO L432 NwaCegarLoop]: 851 mSDtfsCounter, 4541 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4541 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:19,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4541 Valid, 863 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:32:19,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2024-10-12 20:32:19,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1128. [2024-10-12 20:32:19,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1099 states have (on average 1.3994540491355778) internal successors, (1538), 1127 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1538 transitions. [2024-10-12 20:32:19,677 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1538 transitions. Word has length 104 [2024-10-12 20:32:19,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:19,677 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1538 transitions. [2024-10-12 20:32:19,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:19,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1538 transitions. [2024-10-12 20:32:19,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-12 20:32:19,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:19,680 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:19,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:32:19,680 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:19,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:19,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1648824411, now seen corresponding path program 1 times [2024-10-12 20:32:19,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:19,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116472017] [2024-10-12 20:32:19,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:19,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:19,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:19,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:19,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116472017] [2024-10-12 20:32:19,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116472017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:19,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:19,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:19,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82158987] [2024-10-12 20:32:19,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:19,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:19,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:19,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:19,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:19,843 INFO L87 Difference]: Start difference. First operand 1128 states and 1538 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:20,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:20,683 INFO L93 Difference]: Finished difference Result 2718 states and 3755 transitions. [2024-10-12 20:32:20,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:20,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-10-12 20:32:20,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:20,687 INFO L225 Difference]: With dead ends: 2718 [2024-10-12 20:32:20,687 INFO L226 Difference]: Without dead ends: 1680 [2024-10-12 20:32:20,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:32:20,690 INFO L432 NwaCegarLoop]: 836 mSDtfsCounter, 6051 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6051 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:20,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6051 Valid, 1290 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:32:20,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2024-10-12 20:32:20,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1578. [2024-10-12 20:32:20,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1549 states have (on average 1.435765009683667) internal successors, (2224), 1577 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:20,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2224 transitions. [2024-10-12 20:32:20,713 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2224 transitions. Word has length 105 [2024-10-12 20:32:20,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:20,713 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2224 transitions. [2024-10-12 20:32:20,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:20,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2224 transitions. [2024-10-12 20:32:20,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-12 20:32:20,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:20,717 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:20,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:32:20,717 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:20,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:20,718 INFO L85 PathProgramCache]: Analyzing trace with hash -396664639, now seen corresponding path program 1 times [2024-10-12 20:32:20,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:20,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772737396] [2024-10-12 20:32:20,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:20,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:20,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:20,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:20,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772737396] [2024-10-12 20:32:20,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772737396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:20,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:20,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:32:20,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344158224] [2024-10-12 20:32:20,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:20,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:32:20,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:20,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:32:20,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:32:20,856 INFO L87 Difference]: Start difference. First operand 1578 states and 2224 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:21,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:21,438 INFO L93 Difference]: Finished difference Result 3066 states and 4357 transitions. [2024-10-12 20:32:21,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:32:21,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2024-10-12 20:32:21,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:21,442 INFO L225 Difference]: With dead ends: 3066 [2024-10-12 20:32:21,443 INFO L226 Difference]: Without dead ends: 1567 [2024-10-12 20:32:21,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:32:21,445 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 4346 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4346 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:21,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4346 Valid, 820 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:32:21,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2024-10-12 20:32:21,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1567. [2024-10-12 20:32:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.436931079323797) internal successors, (2210), 1566 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2210 transitions. [2024-10-12 20:32:21,464 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2210 transitions. Word has length 106 [2024-10-12 20:32:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:21,464 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2210 transitions. [2024-10-12 20:32:21,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2210 transitions. [2024-10-12 20:32:21,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 20:32:21,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:21,467 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:21,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:32:21,468 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:21,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:21,468 INFO L85 PathProgramCache]: Analyzing trace with hash 10049727, now seen corresponding path program 1 times [2024-10-12 20:32:21,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:21,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861470854] [2024-10-12 20:32:21,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:21,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:21,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:21,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:21,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861470854] [2024-10-12 20:32:21,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861470854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:21,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:21,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:32:21,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784697494] [2024-10-12 20:32:21,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:21,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:32:21,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:21,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:32:21,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:32:21,852 INFO L87 Difference]: Start difference. First operand 1567 states and 2210 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:23,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:23,210 INFO L93 Difference]: Finished difference Result 2719 states and 3699 transitions. [2024-10-12 20:32:23,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:32:23,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-10-12 20:32:23,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:23,218 INFO L225 Difference]: With dead ends: 2719 [2024-10-12 20:32:23,218 INFO L226 Difference]: Without dead ends: 2050 [2024-10-12 20:32:23,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:32:23,220 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 4909 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 2789 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4909 SdHoareTripleChecker+Valid, 2282 SdHoareTripleChecker+Invalid, 2790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:23,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4909 Valid, 2282 Invalid, 2790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2789 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 20:32:23,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2024-10-12 20:32:23,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 1567. [2024-10-12 20:32:23,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4362808842652797) internal successors, (2209), 1566 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:23,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2209 transitions. [2024-10-12 20:32:23,241 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2209 transitions. Word has length 107 [2024-10-12 20:32:23,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:23,241 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2209 transitions. [2024-10-12 20:32:23,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:23,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2209 transitions. [2024-10-12 20:32:23,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 20:32:23,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:23,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:23,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:32:23,243 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:23,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:23,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1673844547, now seen corresponding path program 1 times [2024-10-12 20:32:23,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:23,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245898019] [2024-10-12 20:32:23,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:23,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:23,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:23,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:23,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245898019] [2024-10-12 20:32:23,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245898019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:23,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:23,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:23,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738909045] [2024-10-12 20:32:23,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:23,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:23,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:23,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:23,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:23,606 INFO L87 Difference]: Start difference. First operand 1567 states and 2209 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:25,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:25,041 INFO L93 Difference]: Finished difference Result 2591 states and 3649 transitions. [2024-10-12 20:32:25,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:25,042 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-10-12 20:32:25,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:25,048 INFO L225 Difference]: With dead ends: 2591 [2024-10-12 20:32:25,048 INFO L226 Difference]: Without dead ends: 2396 [2024-10-12 20:32:25,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:32:25,049 INFO L432 NwaCegarLoop]: 812 mSDtfsCounter, 6083 mSDsluCounter, 2750 mSDsCounter, 0 mSdLazyCounter, 2950 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6083 SdHoareTripleChecker+Valid, 3562 SdHoareTripleChecker+Invalid, 2954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:25,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6083 Valid, 3562 Invalid, 2954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2950 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 20:32:25,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2024-10-12 20:32:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1567. [2024-10-12 20:32:25,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.435630689206762) internal successors, (2208), 1566 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:25,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2208 transitions. [2024-10-12 20:32:25,071 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2208 transitions. Word has length 107 [2024-10-12 20:32:25,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:25,071 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2208 transitions. [2024-10-12 20:32:25,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:25,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2208 transitions. [2024-10-12 20:32:25,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 20:32:25,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:25,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:25,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:32:25,074 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:25,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:25,074 INFO L85 PathProgramCache]: Analyzing trace with hash 124559761, now seen corresponding path program 1 times [2024-10-12 20:32:25,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:25,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076059778] [2024-10-12 20:32:25,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:25,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:25,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:25,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076059778] [2024-10-12 20:32:25,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076059778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:25,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:25,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:32:25,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616755723] [2024-10-12 20:32:25,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:25,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:32:25,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:25,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:32:25,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:32:25,558 INFO L87 Difference]: Start difference. First operand 1567 states and 2208 transitions. Second operand has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:27,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:27,525 INFO L93 Difference]: Finished difference Result 2601 states and 3640 transitions. [2024-10-12 20:32:27,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:32:27,526 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-10-12 20:32:27,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:27,532 INFO L225 Difference]: With dead ends: 2601 [2024-10-12 20:32:27,535 INFO L226 Difference]: Without dead ends: 2419 [2024-10-12 20:32:27,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2024-10-12 20:32:27,537 INFO L432 NwaCegarLoop]: 810 mSDtfsCounter, 5435 mSDsluCounter, 3533 mSDsCounter, 0 mSdLazyCounter, 3921 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5435 SdHoareTripleChecker+Valid, 4343 SdHoareTripleChecker+Invalid, 3931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 3921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:27,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5435 Valid, 4343 Invalid, 3931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 3921 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 20:32:27,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2024-10-12 20:32:27,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1586. [2024-10-12 20:32:27,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1586 states, 1557 states have (on average 1.4360950545921645) internal successors, (2236), 1585 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2236 transitions. [2024-10-12 20:32:27,605 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2236 transitions. Word has length 107 [2024-10-12 20:32:27,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:27,608 INFO L471 AbstractCegarLoop]: Abstraction has 1586 states and 2236 transitions. [2024-10-12 20:32:27,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:27,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2236 transitions. [2024-10-12 20:32:27,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 20:32:27,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:27,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:27,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:32:27,616 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:27,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:27,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1877771599, now seen corresponding path program 1 times [2024-10-12 20:32:27,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:27,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228405722] [2024-10-12 20:32:27,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:27,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:28,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:28,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228405722] [2024-10-12 20:32:28,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228405722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:28,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:28,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:28,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922489833] [2024-10-12 20:32:28,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:28,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:28,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:28,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:28,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:28,145 INFO L87 Difference]: Start difference. First operand 1586 states and 2236 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:29,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:29,526 INFO L93 Difference]: Finished difference Result 2049 states and 2903 transitions. [2024-10-12 20:32:29,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:32:29,527 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-10-12 20:32:29,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:29,531 INFO L225 Difference]: With dead ends: 2049 [2024-10-12 20:32:29,531 INFO L226 Difference]: Without dead ends: 1657 [2024-10-12 20:32:29,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:32:29,532 INFO L432 NwaCegarLoop]: 825 mSDtfsCounter, 4074 mSDsluCounter, 2830 mSDsCounter, 0 mSdLazyCounter, 2968 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4074 SdHoareTripleChecker+Valid, 3655 SdHoareTripleChecker+Invalid, 2972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:29,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4074 Valid, 3655 Invalid, 2972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2968 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:32:29,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2024-10-12 20:32:29,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1567. [2024-10-12 20:32:29,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4349804941482445) internal successors, (2207), 1566 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2207 transitions. [2024-10-12 20:32:29,551 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2207 transitions. Word has length 107 [2024-10-12 20:32:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:29,551 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2207 transitions. [2024-10-12 20:32:29,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2207 transitions. [2024-10-12 20:32:29,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-12 20:32:29,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:29,554 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:29,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:32:29,554 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:29,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:29,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1528536076, now seen corresponding path program 1 times [2024-10-12 20:32:29,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:29,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233756985] [2024-10-12 20:32:29,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:29,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:29,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:29,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:29,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233756985] [2024-10-12 20:32:29,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233756985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:29,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:29,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:29,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032218711] [2024-10-12 20:32:29,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:29,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:29,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:29,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:29,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:29,929 INFO L87 Difference]: Start difference. First operand 1567 states and 2207 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:31,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:31,829 INFO L93 Difference]: Finished difference Result 2640 states and 3726 transitions. [2024-10-12 20:32:31,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:31,829 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-10-12 20:32:31,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:31,835 INFO L225 Difference]: With dead ends: 2640 [2024-10-12 20:32:31,835 INFO L226 Difference]: Without dead ends: 2420 [2024-10-12 20:32:31,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:32:31,836 INFO L432 NwaCegarLoop]: 820 mSDtfsCounter, 4513 mSDsluCounter, 3689 mSDsCounter, 0 mSdLazyCounter, 3645 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4513 SdHoareTripleChecker+Valid, 4509 SdHoareTripleChecker+Invalid, 3649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:31,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4513 Valid, 4509 Invalid, 3649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3645 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 20:32:31,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2024-10-12 20:32:31,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1567. [2024-10-12 20:32:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4343302990897269) internal successors, (2206), 1566 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:31,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2206 transitions. [2024-10-12 20:32:31,857 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2206 transitions. Word has length 109 [2024-10-12 20:32:31,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:31,858 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2206 transitions. [2024-10-12 20:32:31,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:31,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2206 transitions. [2024-10-12 20:32:31,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-12 20:32:31,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:31,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:31,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:32:31,861 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:31,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:31,861 INFO L85 PathProgramCache]: Analyzing trace with hash -473795284, now seen corresponding path program 1 times [2024-10-12 20:32:31,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:31,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596566655] [2024-10-12 20:32:31,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:31,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:32,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:32,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:32,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596566655] [2024-10-12 20:32:32,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596566655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:32,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:32,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:32,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479532849] [2024-10-12 20:32:32,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:32,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:32,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:32,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:32,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:32,107 INFO L87 Difference]: Start difference. First operand 1567 states and 2206 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:33,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:33,570 INFO L93 Difference]: Finished difference Result 2600 states and 3654 transitions. [2024-10-12 20:32:33,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:33,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-10-12 20:32:33,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:33,576 INFO L225 Difference]: With dead ends: 2600 [2024-10-12 20:32:33,576 INFO L226 Difference]: Without dead ends: 2396 [2024-10-12 20:32:33,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:32:33,577 INFO L432 NwaCegarLoop]: 851 mSDtfsCounter, 5926 mSDsluCounter, 2867 mSDsCounter, 0 mSdLazyCounter, 3066 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5926 SdHoareTripleChecker+Valid, 3718 SdHoareTripleChecker+Invalid, 3070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:33,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5926 Valid, 3718 Invalid, 3070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3066 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 20:32:33,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2024-10-12 20:32:33,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1567. [2024-10-12 20:32:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4336801040312093) internal successors, (2205), 1566 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:33,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2205 transitions. [2024-10-12 20:32:33,601 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2205 transitions. Word has length 109 [2024-10-12 20:32:33,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:33,602 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2205 transitions. [2024-10-12 20:32:33,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:33,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2205 transitions. [2024-10-12 20:32:33,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-12 20:32:33,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:33,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:33,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:32:33,606 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:33,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:33,606 INFO L85 PathProgramCache]: Analyzing trace with hash -882640512, now seen corresponding path program 1 times [2024-10-12 20:32:33,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:33,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15318191] [2024-10-12 20:32:33,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:33,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:33,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:33,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:33,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15318191] [2024-10-12 20:32:33,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15318191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:33,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:33,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:33,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902961284] [2024-10-12 20:32:33,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:33,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:33,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:33,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:33,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:33,862 INFO L87 Difference]: Start difference. First operand 1567 states and 2205 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:35,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:35,242 INFO L93 Difference]: Finished difference Result 2741 states and 3867 transitions. [2024-10-12 20:32:35,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:32:35,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-10-12 20:32:35,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:35,249 INFO L225 Difference]: With dead ends: 2741 [2024-10-12 20:32:35,249 INFO L226 Difference]: Without dead ends: 2452 [2024-10-12 20:32:35,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:32:35,254 INFO L432 NwaCegarLoop]: 1129 mSDtfsCounter, 4437 mSDsluCounter, 3351 mSDsCounter, 0 mSdLazyCounter, 3364 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4437 SdHoareTripleChecker+Valid, 4480 SdHoareTripleChecker+Invalid, 3368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:35,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4437 Valid, 4480 Invalid, 3368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3364 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 20:32:35,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2024-10-12 20:32:35,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 1567. [2024-10-12 20:32:35,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.433029908972692) internal successors, (2204), 1566 states have internal predecessors, (2204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:35,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2204 transitions. [2024-10-12 20:32:35,318 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2204 transitions. Word has length 109 [2024-10-12 20:32:35,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:35,318 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2204 transitions. [2024-10-12 20:32:35,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:35,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2204 transitions. [2024-10-12 20:32:35,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-12 20:32:35,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:35,320 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:35,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:32:35,321 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:35,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:35,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1668784820, now seen corresponding path program 1 times [2024-10-12 20:32:35,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:35,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51745832] [2024-10-12 20:32:35,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:35,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:35,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:35,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51745832] [2024-10-12 20:32:35,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51745832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:35,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:35,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:35,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152129745] [2024-10-12 20:32:35,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:35,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:35,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:35,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:35,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:35,642 INFO L87 Difference]: Start difference. First operand 1567 states and 2204 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:36,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:36,990 INFO L93 Difference]: Finished difference Result 2633 states and 3715 transitions. [2024-10-12 20:32:36,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:36,991 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-10-12 20:32:36,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:36,998 INFO L225 Difference]: With dead ends: 2633 [2024-10-12 20:32:36,999 INFO L226 Difference]: Without dead ends: 2420 [2024-10-12 20:32:36,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:32:37,000 INFO L432 NwaCegarLoop]: 981 mSDtfsCounter, 4452 mSDsluCounter, 3085 mSDsCounter, 0 mSdLazyCounter, 3147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4452 SdHoareTripleChecker+Valid, 4066 SdHoareTripleChecker+Invalid, 3151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:37,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4452 Valid, 4066 Invalid, 3151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3147 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:32:37,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2024-10-12 20:32:37,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1567. [2024-10-12 20:32:37,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4323797139141743) internal successors, (2203), 1566 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:37,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2203 transitions. [2024-10-12 20:32:37,018 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2203 transitions. Word has length 109 [2024-10-12 20:32:37,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:37,018 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2203 transitions. [2024-10-12 20:32:37,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:37,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2203 transitions. [2024-10-12 20:32:37,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-12 20:32:37,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:37,020 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:37,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:32:37,021 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:37,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:37,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2118080297, now seen corresponding path program 1 times [2024-10-12 20:32:37,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:37,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915079461] [2024-10-12 20:32:37,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:37,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:37,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:37,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915079461] [2024-10-12 20:32:37,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915079461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:37,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:37,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:37,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236910106] [2024-10-12 20:32:37,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:37,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:37,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:37,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:37,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:37,280 INFO L87 Difference]: Start difference. First operand 1567 states and 2203 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:38,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:38,936 INFO L93 Difference]: Finished difference Result 2720 states and 3843 transitions. [2024-10-12 20:32:38,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:38,937 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-10-12 20:32:38,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:38,940 INFO L225 Difference]: With dead ends: 2720 [2024-10-12 20:32:38,940 INFO L226 Difference]: Without dead ends: 2452 [2024-10-12 20:32:38,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:32:38,942 INFO L432 NwaCegarLoop]: 1138 mSDtfsCounter, 3012 mSDsluCounter, 3833 mSDsCounter, 0 mSdLazyCounter, 3687 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3012 SdHoareTripleChecker+Valid, 4971 SdHoareTripleChecker+Invalid, 3691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:38,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3012 Valid, 4971 Invalid, 3691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3687 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 20:32:38,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2024-10-12 20:32:38,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 1567. [2024-10-12 20:32:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4317295188556567) internal successors, (2202), 1566 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2202 transitions. [2024-10-12 20:32:38,960 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2202 transitions. Word has length 109 [2024-10-12 20:32:38,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:38,960 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2202 transitions. [2024-10-12 20:32:38,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2202 transitions. [2024-10-12 20:32:38,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-12 20:32:38,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:38,963 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:38,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:32:38,963 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:38,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:38,963 INFO L85 PathProgramCache]: Analyzing trace with hash 395359209, now seen corresponding path program 1 times [2024-10-12 20:32:38,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:38,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882710616] [2024-10-12 20:32:38,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:38,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:39,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:39,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882710616] [2024-10-12 20:32:39,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882710616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:39,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:39,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:39,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115586597] [2024-10-12 20:32:39,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:39,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:39,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:39,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:39,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:39,197 INFO L87 Difference]: Start difference. First operand 1567 states and 2202 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:40,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:40,754 INFO L93 Difference]: Finished difference Result 2824 states and 3985 transitions. [2024-10-12 20:32:40,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:32:40,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-10-12 20:32:40,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:40,758 INFO L225 Difference]: With dead ends: 2824 [2024-10-12 20:32:40,758 INFO L226 Difference]: Without dead ends: 2452 [2024-10-12 20:32:40,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:32:40,759 INFO L432 NwaCegarLoop]: 1002 mSDtfsCounter, 3495 mSDsluCounter, 3370 mSDsCounter, 0 mSdLazyCounter, 3479 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3495 SdHoareTripleChecker+Valid, 4372 SdHoareTripleChecker+Invalid, 3483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:40,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3495 Valid, 4372 Invalid, 3483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3479 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 20:32:40,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2024-10-12 20:32:40,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 1567. [2024-10-12 20:32:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4304291287386215) internal successors, (2200), 1566 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2200 transitions. [2024-10-12 20:32:40,778 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2200 transitions. Word has length 109 [2024-10-12 20:32:40,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:40,778 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2200 transitions. [2024-10-12 20:32:40,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:40,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2200 transitions. [2024-10-12 20:32:40,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-12 20:32:40,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:40,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:40,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:32:40,781 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:40,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:40,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1897276727, now seen corresponding path program 1 times [2024-10-12 20:32:40,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:40,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819339493] [2024-10-12 20:32:40,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:40,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:41,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-12 20:32:41,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:41,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819339493] [2024-10-12 20:32:41,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819339493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:41,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:41,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:41,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714766017] [2024-10-12 20:32:41,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:41,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:41,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:41,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:41,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:41,015 INFO L87 Difference]: Start difference. First operand 1567 states and 2200 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:42,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:42,443 INFO L93 Difference]: Finished difference Result 2610 states and 3666 transitions. [2024-10-12 20:32:42,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:42,444 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-10-12 20:32:42,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:42,447 INFO L225 Difference]: With dead ends: 2610 [2024-10-12 20:32:42,447 INFO L226 Difference]: Without dead ends: 2396 [2024-10-12 20:32:42,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:32:42,448 INFO L432 NwaCegarLoop]: 885 mSDtfsCounter, 3702 mSDsluCounter, 2969 mSDsCounter, 0 mSdLazyCounter, 3168 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3702 SdHoareTripleChecker+Valid, 3854 SdHoareTripleChecker+Invalid, 3172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:42,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3702 Valid, 3854 Invalid, 3172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3168 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 20:32:42,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2024-10-12 20:32:42,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1567. [2024-10-12 20:32:42,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4291287386215865) internal successors, (2198), 1566 states have internal predecessors, (2198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2198 transitions. [2024-10-12 20:32:42,464 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2198 transitions. Word has length 109 [2024-10-12 20:32:42,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:42,465 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2198 transitions. [2024-10-12 20:32:42,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:42,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2198 transitions. [2024-10-12 20:32:42,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-12 20:32:42,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:42,467 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:42,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:32:42,467 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:42,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash -211267848, now seen corresponding path program 1 times [2024-10-12 20:32:42,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:42,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865082267] [2024-10-12 20:32:42,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:42,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:42,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:42,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:42,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865082267] [2024-10-12 20:32:42,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865082267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:42,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:42,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:42,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986625627] [2024-10-12 20:32:42,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:42,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:42,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:42,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:42,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:42,685 INFO L87 Difference]: Start difference. First operand 1567 states and 2198 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:43,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:43,914 INFO L93 Difference]: Finished difference Result 2313 states and 3257 transitions. [2024-10-12 20:32:43,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:43,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-10-12 20:32:43,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:43,917 INFO L225 Difference]: With dead ends: 2313 [2024-10-12 20:32:43,918 INFO L226 Difference]: Without dead ends: 1657 [2024-10-12 20:32:43,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-10-12 20:32:43,919 INFO L432 NwaCegarLoop]: 1120 mSDtfsCounter, 1644 mSDsluCounter, 3279 mSDsCounter, 0 mSdLazyCounter, 2995 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1644 SdHoareTripleChecker+Valid, 4399 SdHoareTripleChecker+Invalid, 2999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:43,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1644 Valid, 4399 Invalid, 2999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2995 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 20:32:43,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2024-10-12 20:32:43,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1567. [2024-10-12 20:32:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4278283485045513) internal successors, (2196), 1566 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:43,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2196 transitions. [2024-10-12 20:32:43,934 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2196 transitions. Word has length 109 [2024-10-12 20:32:43,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:43,934 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2196 transitions. [2024-10-12 20:32:43,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:43,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2196 transitions. [2024-10-12 20:32:43,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:32:43,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:43,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:43,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:32:43,937 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:43,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:43,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1828844768, now seen corresponding path program 1 times [2024-10-12 20:32:43,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:43,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987628014] [2024-10-12 20:32:43,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:43,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:44,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:44,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:44,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987628014] [2024-10-12 20:32:44,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987628014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:44,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:44,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:44,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222934121] [2024-10-12 20:32:44,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:44,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:44,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:44,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:44,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:44,212 INFO L87 Difference]: Start difference. First operand 1567 states and 2196 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:45,856 INFO L93 Difference]: Finished difference Result 2654 states and 3726 transitions. [2024-10-12 20:32:45,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:45,857 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:32:45,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:45,861 INFO L225 Difference]: With dead ends: 2654 [2024-10-12 20:32:45,861 INFO L226 Difference]: Without dead ends: 2420 [2024-10-12 20:32:45,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:32:45,863 INFO L432 NwaCegarLoop]: 1115 mSDtfsCounter, 3246 mSDsluCounter, 3684 mSDsCounter, 0 mSdLazyCounter, 3962 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3246 SdHoareTripleChecker+Valid, 4799 SdHoareTripleChecker+Invalid, 3965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:45,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3246 Valid, 4799 Invalid, 3965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3962 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 20:32:45,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2024-10-12 20:32:45,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1567. [2024-10-12 20:32:45,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4271781534460337) internal successors, (2195), 1566 states have internal predecessors, (2195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2195 transitions. [2024-10-12 20:32:45,901 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2195 transitions. Word has length 111 [2024-10-12 20:32:45,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:45,901 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2195 transitions. [2024-10-12 20:32:45,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2195 transitions. [2024-10-12 20:32:45,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:32:45,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:45,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:45,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:32:45,905 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:45,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:45,905 INFO L85 PathProgramCache]: Analyzing trace with hash -177768362, now seen corresponding path program 1 times [2024-10-12 20:32:45,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:45,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405602652] [2024-10-12 20:32:45,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:45,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:46,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:46,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:46,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405602652] [2024-10-12 20:32:46,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405602652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:46,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:46,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:46,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958380044] [2024-10-12 20:32:46,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:46,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:46,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:46,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:46,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:46,329 INFO L87 Difference]: Start difference. First operand 1567 states and 2195 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:47,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:47,731 INFO L93 Difference]: Finished difference Result 2530 states and 3533 transitions. [2024-10-12 20:32:47,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:47,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:32:47,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:47,735 INFO L225 Difference]: With dead ends: 2530 [2024-10-12 20:32:47,735 INFO L226 Difference]: Without dead ends: 2348 [2024-10-12 20:32:47,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:32:47,737 INFO L432 NwaCegarLoop]: 856 mSDtfsCounter, 3787 mSDsluCounter, 2819 mSDsCounter, 0 mSdLazyCounter, 3076 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3787 SdHoareTripleChecker+Valid, 3675 SdHoareTripleChecker+Invalid, 3080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:47,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3787 Valid, 3675 Invalid, 3080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3076 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 20:32:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2024-10-12 20:32:47,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 1567. [2024-10-12 20:32:47,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4265279583875163) internal successors, (2194), 1566 states have internal predecessors, (2194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:47,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2194 transitions. [2024-10-12 20:32:47,755 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2194 transitions. Word has length 111 [2024-10-12 20:32:47,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:47,756 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2194 transitions. [2024-10-12 20:32:47,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2194 transitions. [2024-10-12 20:32:47,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:32:47,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:47,758 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:47,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:32:47,759 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:47,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:47,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1855263288, now seen corresponding path program 1 times [2024-10-12 20:32:47,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:47,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013827322] [2024-10-12 20:32:47,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:47,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:48,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:48,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013827322] [2024-10-12 20:32:48,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013827322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:48,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:48,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:32:48,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966734307] [2024-10-12 20:32:48,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:48,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:32:48,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:48,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:32:48,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:32:48,317 INFO L87 Difference]: Start difference. First operand 1567 states and 2194 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:50,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:50,714 INFO L93 Difference]: Finished difference Result 3175 states and 4483 transitions. [2024-10-12 20:32:50,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 20:32:50,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:32:50,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:50,724 INFO L225 Difference]: With dead ends: 3175 [2024-10-12 20:32:50,724 INFO L226 Difference]: Without dead ends: 2980 [2024-10-12 20:32:50,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-12 20:32:50,728 INFO L432 NwaCegarLoop]: 928 mSDtfsCounter, 10470 mSDsluCounter, 4332 mSDsCounter, 0 mSdLazyCounter, 4356 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10470 SdHoareTripleChecker+Valid, 5260 SdHoareTripleChecker+Invalid, 4727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 4356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:50,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10470 Valid, 5260 Invalid, 4727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 4356 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 20:32:50,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2024-10-12 20:32:50,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 1571. [2024-10-12 20:32:50,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1542 states have (on average 1.4254215304798963) internal successors, (2198), 1570 states have internal predecessors, (2198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:50,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2198 transitions. [2024-10-12 20:32:50,761 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2198 transitions. Word has length 111 [2024-10-12 20:32:50,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:50,761 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2198 transitions. [2024-10-12 20:32:50,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:50,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2198 transitions. [2024-10-12 20:32:50,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:32:50,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:50,764 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:50,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:32:50,764 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:50,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:50,764 INFO L85 PathProgramCache]: Analyzing trace with hash -295038365, now seen corresponding path program 1 times [2024-10-12 20:32:50,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:50,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350681012] [2024-10-12 20:32:50,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:50,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:51,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:51,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350681012] [2024-10-12 20:32:51,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350681012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:51,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:51,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:51,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044117963] [2024-10-12 20:32:51,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:51,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:51,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:51,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:51,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:51,099 INFO L87 Difference]: Start difference. First operand 1571 states and 2198 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:52,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:52,668 INFO L93 Difference]: Finished difference Result 2586 states and 3625 transitions. [2024-10-12 20:32:52,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:52,668 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:32:52,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:52,676 INFO L225 Difference]: With dead ends: 2586 [2024-10-12 20:32:52,677 INFO L226 Difference]: Without dead ends: 2396 [2024-10-12 20:32:52,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:32:52,681 INFO L432 NwaCegarLoop]: 989 mSDtfsCounter, 4522 mSDsluCounter, 3923 mSDsCounter, 0 mSdLazyCounter, 3808 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4522 SdHoareTripleChecker+Valid, 4912 SdHoareTripleChecker+Invalid, 3812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:52,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4522 Valid, 4912 Invalid, 3812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3808 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 20:32:52,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2024-10-12 20:32:52,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1571. [2024-10-12 20:32:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1542 states have (on average 1.4247730220492867) internal successors, (2197), 1570 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:52,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2197 transitions. [2024-10-12 20:32:52,719 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2197 transitions. Word has length 111 [2024-10-12 20:32:52,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:52,720 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2197 transitions. [2024-10-12 20:32:52,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2197 transitions. [2024-10-12 20:32:52,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:32:52,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:52,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:52,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 20:32:52,725 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:52,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:52,726 INFO L85 PathProgramCache]: Analyzing trace with hash -639843564, now seen corresponding path program 1 times [2024-10-12 20:32:52,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:52,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260980662] [2024-10-12 20:32:52,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:52,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:53,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:53,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:53,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260980662] [2024-10-12 20:32:53,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260980662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:53,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:53,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:53,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658611387] [2024-10-12 20:32:53,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:53,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:53,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:53,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:53,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:53,116 INFO L87 Difference]: Start difference. First operand 1571 states and 2197 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:54,483 INFO L93 Difference]: Finished difference Result 2530 states and 3530 transitions. [2024-10-12 20:32:54,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:32:54,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:32:54,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:54,487 INFO L225 Difference]: With dead ends: 2530 [2024-10-12 20:32:54,488 INFO L226 Difference]: Without dead ends: 2352 [2024-10-12 20:32:54,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:32:54,489 INFO L432 NwaCegarLoop]: 872 mSDtfsCounter, 3752 mSDsluCounter, 2870 mSDsCounter, 0 mSdLazyCounter, 3117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3752 SdHoareTripleChecker+Valid, 3742 SdHoareTripleChecker+Invalid, 3121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:54,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3752 Valid, 3742 Invalid, 3121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3117 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:32:54,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2024-10-12 20:32:54,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 1571. [2024-10-12 20:32:54,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1542 states have (on average 1.424124513618677) internal successors, (2196), 1570 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:54,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2196 transitions. [2024-10-12 20:32:54,525 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2196 transitions. Word has length 111 [2024-10-12 20:32:54,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:54,527 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2196 transitions. [2024-10-12 20:32:54,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:54,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2196 transitions. [2024-10-12 20:32:54,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:32:54,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:54,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 20:32:54,531 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:54,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:54,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1274610143, now seen corresponding path program 1 times [2024-10-12 20:32:54,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:54,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267513033] [2024-10-12 20:32:54,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:54,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:54,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:54,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267513033] [2024-10-12 20:32:54,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267513033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:54,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:54,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:54,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001542947] [2024-10-12 20:32:54,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:54,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:54,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:54,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:54,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:54,839 INFO L87 Difference]: Start difference. First operand 1571 states and 2196 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:56,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:56,565 INFO L93 Difference]: Finished difference Result 2644 states and 3708 transitions. [2024-10-12 20:32:56,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:32:56,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:32:56,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:56,568 INFO L225 Difference]: With dead ends: 2644 [2024-10-12 20:32:56,568 INFO L226 Difference]: Without dead ends: 2424 [2024-10-12 20:32:56,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:32:56,572 INFO L432 NwaCegarLoop]: 1119 mSDtfsCounter, 4915 mSDsluCounter, 3696 mSDsCounter, 0 mSdLazyCounter, 3931 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4915 SdHoareTripleChecker+Valid, 4815 SdHoareTripleChecker+Invalid, 3934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:56,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4915 Valid, 4815 Invalid, 3934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3931 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 20:32:56,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2024-10-12 20:32:56,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 1571. [2024-10-12 20:32:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1542 states have (on average 1.4234760051880675) internal successors, (2195), 1570 states have internal predecessors, (2195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:56,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2195 transitions. [2024-10-12 20:32:56,597 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2195 transitions. Word has length 111 [2024-10-12 20:32:56,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:56,597 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2195 transitions. [2024-10-12 20:32:56,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:56,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2195 transitions. [2024-10-12 20:32:56,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:32:56,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:56,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:56,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 20:32:56,599 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:56,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:56,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1108394253, now seen corresponding path program 1 times [2024-10-12 20:32:56,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:56,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665999477] [2024-10-12 20:32:56,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:56,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:56,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:56,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:56,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665999477] [2024-10-12 20:32:56,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665999477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:56,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:56,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:32:56,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429760869] [2024-10-12 20:32:56,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:56,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:32:56,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:56,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:32:56,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:32:56,836 INFO L87 Difference]: Start difference. First operand 1571 states and 2195 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:58,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:58,397 INFO L93 Difference]: Finished difference Result 2586 states and 3621 transitions. [2024-10-12 20:32:58,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:32:58,397 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:32:58,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:58,405 INFO L225 Difference]: With dead ends: 2586 [2024-10-12 20:32:58,405 INFO L226 Difference]: Without dead ends: 2396 [2024-10-12 20:32:58,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:32:58,407 INFO L432 NwaCegarLoop]: 1152 mSDtfsCounter, 4510 mSDsluCounter, 4194 mSDsCounter, 0 mSdLazyCounter, 4024 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4510 SdHoareTripleChecker+Valid, 5346 SdHoareTripleChecker+Invalid, 4027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:58,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4510 Valid, 5346 Invalid, 4027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4024 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 20:32:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2024-10-12 20:32:58,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1571. [2024-10-12 20:32:58,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1542 states have (on average 1.422827496757458) internal successors, (2194), 1570 states have internal predecessors, (2194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2194 transitions. [2024-10-12 20:32:58,427 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2194 transitions. Word has length 111 [2024-10-12 20:32:58,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:58,428 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2194 transitions. [2024-10-12 20:32:58,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2194 transitions. [2024-10-12 20:32:58,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:32:58,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:58,430 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:58,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 20:32:58,430 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:32:58,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:58,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1161342119, now seen corresponding path program 1 times [2024-10-12 20:32:58,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:58,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139186686] [2024-10-12 20:32:58,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:58,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:32:58,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:58,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139186686] [2024-10-12 20:32:58,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139186686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:58,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:58,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:32:58,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995859918] [2024-10-12 20:32:58,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:58,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:32:58,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:58,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:32:58,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:32:58,884 INFO L87 Difference]: Start difference. First operand 1571 states and 2194 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:00,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:00,918 INFO L93 Difference]: Finished difference Result 3170 states and 4472 transitions. [2024-10-12 20:33:00,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 20:33:00,918 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:00,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:00,921 INFO L225 Difference]: With dead ends: 3170 [2024-10-12 20:33:00,921 INFO L226 Difference]: Without dead ends: 2980 [2024-10-12 20:33:00,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-12 20:33:00,922 INFO L432 NwaCegarLoop]: 949 mSDtfsCounter, 10429 mSDsluCounter, 3505 mSDsCounter, 0 mSdLazyCounter, 3643 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10429 SdHoareTripleChecker+Valid, 4454 SdHoareTripleChecker+Invalid, 4009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 3643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:00,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10429 Valid, 4454 Invalid, 4009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 3643 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 20:33:00,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2024-10-12 20:33:00,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 1575. [2024-10-12 20:33:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1546 states have (on average 1.4217335058214748) internal successors, (2198), 1574 states have internal predecessors, (2198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:00,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2198 transitions. [2024-10-12 20:33:00,939 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2198 transitions. Word has length 111 [2024-10-12 20:33:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:00,939 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2198 transitions. [2024-10-12 20:33:00,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2198 transitions. [2024-10-12 20:33:00,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:00,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:00,941 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:00,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 20:33:00,941 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:00,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:00,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1589926345, now seen corresponding path program 1 times [2024-10-12 20:33:00,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:00,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702613258] [2024-10-12 20:33:00,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:00,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:01,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:01,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702613258] [2024-10-12 20:33:01,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702613258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:01,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:01,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:01,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667302559] [2024-10-12 20:33:01,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:01,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:01,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:01,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:01,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:01,141 INFO L87 Difference]: Start difference. First operand 1575 states and 2198 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:02,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:02,479 INFO L93 Difference]: Finished difference Result 2438 states and 3363 transitions. [2024-10-12 20:33:02,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:33:02,479 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:02,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:02,482 INFO L225 Difference]: With dead ends: 2438 [2024-10-12 20:33:02,482 INFO L226 Difference]: Without dead ends: 2268 [2024-10-12 20:33:02,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:33:02,483 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 4031 mSDsluCounter, 2445 mSDsCounter, 0 mSdLazyCounter, 2869 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4031 SdHoareTripleChecker+Valid, 3222 SdHoareTripleChecker+Invalid, 2873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:02,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4031 Valid, 3222 Invalid, 2873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2869 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:33:02,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2024-10-12 20:33:02,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1575. [2024-10-12 20:33:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1546 states have (on average 1.4210866752910738) internal successors, (2197), 1574 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2197 transitions. [2024-10-12 20:33:02,496 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2197 transitions. Word has length 111 [2024-10-12 20:33:02,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:02,496 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2197 transitions. [2024-10-12 20:33:02,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:02,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2197 transitions. [2024-10-12 20:33:02,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:02,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:02,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:02,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 20:33:02,498 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:02,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:02,498 INFO L85 PathProgramCache]: Analyzing trace with hash -23493687, now seen corresponding path program 1 times [2024-10-12 20:33:02,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:02,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918962290] [2024-10-12 20:33:02,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:02,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:02,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-12 20:33:02,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:02,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918962290] [2024-10-12 20:33:02,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918962290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:02,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:02,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:02,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575781394] [2024-10-12 20:33:02,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:02,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:02,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:02,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:02,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:02,687 INFO L87 Difference]: Start difference. First operand 1575 states and 2197 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:04,144 INFO L93 Difference]: Finished difference Result 2610 states and 3645 transitions. [2024-10-12 20:33:04,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:33:04,145 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:04,147 INFO L225 Difference]: With dead ends: 2610 [2024-10-12 20:33:04,147 INFO L226 Difference]: Without dead ends: 2396 [2024-10-12 20:33:04,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:33:04,149 INFO L432 NwaCegarLoop]: 936 mSDtfsCounter, 5562 mSDsluCounter, 3122 mSDsCounter, 0 mSdLazyCounter, 3269 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5562 SdHoareTripleChecker+Valid, 4058 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:04,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5562 Valid, 4058 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3269 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 20:33:04,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2024-10-12 20:33:04,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1575. [2024-10-12 20:33:04,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1546 states have (on average 1.4197930142302717) internal successors, (2195), 1574 states have internal predecessors, (2195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:04,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2195 transitions. [2024-10-12 20:33:04,164 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2195 transitions. Word has length 111 [2024-10-12 20:33:04,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:04,164 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2195 transitions. [2024-10-12 20:33:04,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2195 transitions. [2024-10-12 20:33:04,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:04,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:04,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:04,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-12 20:33:04,166 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:04,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:04,166 INFO L85 PathProgramCache]: Analyzing trace with hash -432338915, now seen corresponding path program 1 times [2024-10-12 20:33:04,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:04,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055871088] [2024-10-12 20:33:04,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:04,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:04,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:04,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055871088] [2024-10-12 20:33:04,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055871088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:04,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:04,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:04,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829196094] [2024-10-12 20:33:04,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:04,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:04,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:04,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:04,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:04,362 INFO L87 Difference]: Start difference. First operand 1575 states and 2195 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:05,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:05,943 INFO L93 Difference]: Finished difference Result 2696 states and 3766 transitions. [2024-10-12 20:33:05,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:33:05,943 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:05,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:05,946 INFO L225 Difference]: With dead ends: 2696 [2024-10-12 20:33:05,946 INFO L226 Difference]: Without dead ends: 2428 [2024-10-12 20:33:05,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:33:05,947 INFO L432 NwaCegarLoop]: 1080 mSDtfsCounter, 3312 mSDsluCounter, 3581 mSDsCounter, 0 mSdLazyCounter, 3711 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3312 SdHoareTripleChecker+Valid, 4661 SdHoareTripleChecker+Invalid, 3715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:05,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3312 Valid, 4661 Invalid, 3715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3711 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 20:33:05,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2024-10-12 20:33:05,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 1575. [2024-10-12 20:33:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1546 states have (on average 1.4184993531694696) internal successors, (2193), 1574 states have internal predecessors, (2193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2193 transitions. [2024-10-12 20:33:06,001 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2193 transitions. Word has length 111 [2024-10-12 20:33:06,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:06,002 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2193 transitions. [2024-10-12 20:33:06,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:06,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2193 transitions. [2024-10-12 20:33:06,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:06,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:06,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:06,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-12 20:33:06,008 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:06,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:06,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1856015251, now seen corresponding path program 1 times [2024-10-12 20:33:06,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:06,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166295596] [2024-10-12 20:33:06,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:06,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:06,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:06,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:06,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166295596] [2024-10-12 20:33:06,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166295596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:06,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:06,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:06,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217907401] [2024-10-12 20:33:06,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:06,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:06,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:06,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:06,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:06,259 INFO L87 Difference]: Start difference. First operand 1575 states and 2193 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:07,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:07,948 INFO L93 Difference]: Finished difference Result 2610 states and 3644 transitions. [2024-10-12 20:33:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:33:07,948 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:07,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:07,951 INFO L225 Difference]: With dead ends: 2610 [2024-10-12 20:33:07,951 INFO L226 Difference]: Without dead ends: 2396 [2024-10-12 20:33:07,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:33:07,952 INFO L432 NwaCegarLoop]: 1103 mSDtfsCounter, 4496 mSDsluCounter, 4121 mSDsCounter, 0 mSdLazyCounter, 3931 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4496 SdHoareTripleChecker+Valid, 5224 SdHoareTripleChecker+Invalid, 3935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:07,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4496 Valid, 5224 Invalid, 3935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3931 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 20:33:07,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2024-10-12 20:33:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1575. [2024-10-12 20:33:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1546 states have (on average 1.4172056921086675) internal successors, (2191), 1574 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2191 transitions. [2024-10-12 20:33:07,967 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2191 transitions. Word has length 111 [2024-10-12 20:33:07,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:07,968 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2191 transitions. [2024-10-12 20:33:07,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:07,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2191 transitions. [2024-10-12 20:33:07,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:07,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:07,970 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:07,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-12 20:33:07,970 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:07,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:07,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2086779645, now seen corresponding path program 1 times [2024-10-12 20:33:07,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:07,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044995998] [2024-10-12 20:33:07,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:07,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:08,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:08,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:08,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044995998] [2024-10-12 20:33:08,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044995998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:08,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:08,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:08,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881713690] [2024-10-12 20:33:08,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:08,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:08,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:08,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:08,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:08,163 INFO L87 Difference]: Start difference. First operand 1575 states and 2191 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:09,724 INFO L93 Difference]: Finished difference Result 2692 states and 3760 transitions. [2024-10-12 20:33:09,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:33:09,724 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:09,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:09,727 INFO L225 Difference]: With dead ends: 2692 [2024-10-12 20:33:09,727 INFO L226 Difference]: Without dead ends: 2428 [2024-10-12 20:33:09,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:33:09,728 INFO L432 NwaCegarLoop]: 1083 mSDtfsCounter, 5068 mSDsluCounter, 3593 mSDsCounter, 0 mSdLazyCounter, 3686 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5068 SdHoareTripleChecker+Valid, 4676 SdHoareTripleChecker+Invalid, 3690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:09,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5068 Valid, 4676 Invalid, 3690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3686 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 20:33:09,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2024-10-12 20:33:09,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 1575. [2024-10-12 20:33:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1546 states have (on average 1.4159120310478654) internal successors, (2189), 1574 states have internal predecessors, (2189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2189 transitions. [2024-10-12 20:33:09,741 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2189 transitions. Word has length 111 [2024-10-12 20:33:09,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:09,741 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2189 transitions. [2024-10-12 20:33:09,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:09,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2189 transitions. [2024-10-12 20:33:09,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:09,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:09,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:09,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-12 20:33:09,743 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:09,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:09,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1739636962, now seen corresponding path program 1 times [2024-10-12 20:33:09,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:09,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104660607] [2024-10-12 20:33:09,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:09,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:09,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:09,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:09,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104660607] [2024-10-12 20:33:09,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104660607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:09,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:09,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:09,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804182232] [2024-10-12 20:33:09,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:09,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:09,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:09,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:09,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:09,924 INFO L87 Difference]: Start difference. First operand 1575 states and 2189 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:11,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:11,440 INFO L93 Difference]: Finished difference Result 2542 states and 3532 transitions. [2024-10-12 20:33:11,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:33:11,440 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:11,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:11,442 INFO L225 Difference]: With dead ends: 2542 [2024-10-12 20:33:11,442 INFO L226 Difference]: Without dead ends: 2356 [2024-10-12 20:33:11,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:33:11,443 INFO L432 NwaCegarLoop]: 928 mSDtfsCounter, 3624 mSDsluCounter, 3035 mSDsCounter, 0 mSdLazyCounter, 3273 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3624 SdHoareTripleChecker+Valid, 3963 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:11,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3624 Valid, 3963 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3273 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 20:33:11,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2024-10-12 20:33:11,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 1575. [2024-10-12 20:33:11,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1546 states have (on average 1.4146183699870634) internal successors, (2187), 1574 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2187 transitions. [2024-10-12 20:33:11,457 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2187 transitions. Word has length 111 [2024-10-12 20:33:11,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:11,458 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2187 transitions. [2024-10-12 20:33:11,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2187 transitions. [2024-10-12 20:33:11,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:11,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:11,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:11,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-12 20:33:11,460 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:11,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:11,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2129832071, now seen corresponding path program 1 times [2024-10-12 20:33:11,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:11,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223138828] [2024-10-12 20:33:11,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:11,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:11,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:11,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223138828] [2024-10-12 20:33:11,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223138828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:11,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:11,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:11,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511151270] [2024-10-12 20:33:11,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:11,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:11,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:11,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:11,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:11,662 INFO L87 Difference]: Start difference. First operand 1575 states and 2187 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:13,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:13,405 INFO L93 Difference]: Finished difference Result 2888 states and 4033 transitions. [2024-10-12 20:33:13,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:33:13,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:13,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:13,408 INFO L225 Difference]: With dead ends: 2888 [2024-10-12 20:33:13,408 INFO L226 Difference]: Without dead ends: 2464 [2024-10-12 20:33:13,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:33:13,409 INFO L432 NwaCegarLoop]: 1252 mSDtfsCounter, 3011 mSDsluCounter, 4115 mSDsCounter, 0 mSdLazyCounter, 4204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3011 SdHoareTripleChecker+Valid, 5367 SdHoareTripleChecker+Invalid, 4207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:13,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3011 Valid, 5367 Invalid, 4207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4204 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 20:33:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2024-10-12 20:33:13,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 1575. [2024-10-12 20:33:13,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1546 states have (on average 1.4133247089262613) internal successors, (2185), 1574 states have internal predecessors, (2185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:13,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2185 transitions. [2024-10-12 20:33:13,425 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2185 transitions. Word has length 111 [2024-10-12 20:33:13,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:13,425 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2185 transitions. [2024-10-12 20:33:13,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:13,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2185 transitions. [2024-10-12 20:33:13,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:13,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:13,427 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:13,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-12 20:33:13,427 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:13,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:13,428 INFO L85 PathProgramCache]: Analyzing trace with hash -523083210, now seen corresponding path program 1 times [2024-10-12 20:33:13,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:13,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851824446] [2024-10-12 20:33:13,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:13,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:13,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:13,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851824446] [2024-10-12 20:33:13,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851824446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:13,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:13,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:13,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212355960] [2024-10-12 20:33:13,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:13,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:13,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:13,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:13,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:13,659 INFO L87 Difference]: Start difference. First operand 1575 states and 2185 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:15,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:15,395 INFO L93 Difference]: Finished difference Result 2614 states and 3642 transitions. [2024-10-12 20:33:15,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:33:15,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:15,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:15,398 INFO L225 Difference]: With dead ends: 2614 [2024-10-12 20:33:15,398 INFO L226 Difference]: Without dead ends: 2396 [2024-10-12 20:33:15,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:33:15,399 INFO L432 NwaCegarLoop]: 1170 mSDtfsCounter, 4481 mSDsluCounter, 4229 mSDsCounter, 0 mSdLazyCounter, 4017 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4481 SdHoareTripleChecker+Valid, 5399 SdHoareTripleChecker+Invalid, 4021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:15,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4481 Valid, 5399 Invalid, 4021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4017 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 20:33:15,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2024-10-12 20:33:15,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1575. [2024-10-12 20:33:15,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1546 states have (on average 1.4120310478654592) internal successors, (2183), 1574 states have internal predecessors, (2183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:15,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2183 transitions. [2024-10-12 20:33:15,413 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2183 transitions. Word has length 111 [2024-10-12 20:33:15,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:15,413 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2183 transitions. [2024-10-12 20:33:15,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:15,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2183 transitions. [2024-10-12 20:33:15,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:15,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:15,415 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:15,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-12 20:33:15,415 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:15,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:15,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1483529920, now seen corresponding path program 1 times [2024-10-12 20:33:15,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:15,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122378742] [2024-10-12 20:33:15,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:15,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:15,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:15,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:15,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122378742] [2024-10-12 20:33:15,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122378742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:15,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:15,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:15,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336115978] [2024-10-12 20:33:15,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:15,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:15,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:15,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:15,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:15,598 INFO L87 Difference]: Start difference. First operand 1575 states and 2183 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:17,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:17,046 INFO L93 Difference]: Finished difference Result 2548 states and 3531 transitions. [2024-10-12 20:33:17,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:33:17,046 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:17,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:17,049 INFO L225 Difference]: With dead ends: 2548 [2024-10-12 20:33:17,049 INFO L226 Difference]: Without dead ends: 2356 [2024-10-12 20:33:17,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:33:17,049 INFO L432 NwaCegarLoop]: 947 mSDtfsCounter, 5430 mSDsluCounter, 3095 mSDsCounter, 0 mSdLazyCounter, 3319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5430 SdHoareTripleChecker+Valid, 4042 SdHoareTripleChecker+Invalid, 3323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:17,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5430 Valid, 4042 Invalid, 3323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3319 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 20:33:17,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2024-10-12 20:33:17,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 1575. [2024-10-12 20:33:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1546 states have (on average 1.410737386804657) internal successors, (2181), 1574 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:17,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2181 transitions. [2024-10-12 20:33:17,064 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2181 transitions. Word has length 111 [2024-10-12 20:33:17,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:17,064 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2181 transitions. [2024-10-12 20:33:17,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:17,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2181 transitions. [2024-10-12 20:33:17,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:17,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:17,065 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:17,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-12 20:33:17,066 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:17,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:17,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1892375148, now seen corresponding path program 1 times [2024-10-12 20:33:17,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:17,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091906732] [2024-10-12 20:33:17,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:17,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:17,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:17,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:17,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091906732] [2024-10-12 20:33:17,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091906732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:17,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:17,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:17,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228211213] [2024-10-12 20:33:17,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:17,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:17,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:17,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:17,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:17,250 INFO L87 Difference]: Start difference. First operand 1575 states and 2181 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:18,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:18,884 INFO L93 Difference]: Finished difference Result 2712 states and 3773 transitions. [2024-10-12 20:33:18,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:33:18,884 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:18,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:18,887 INFO L225 Difference]: With dead ends: 2712 [2024-10-12 20:33:18,887 INFO L226 Difference]: Without dead ends: 2428 [2024-10-12 20:33:18,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:33:18,888 INFO L432 NwaCegarLoop]: 1197 mSDtfsCounter, 3106 mSDsluCounter, 3935 mSDsCounter, 0 mSdLazyCounter, 3970 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3106 SdHoareTripleChecker+Valid, 5132 SdHoareTripleChecker+Invalid, 3974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:18,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3106 Valid, 5132 Invalid, 3974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3970 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 20:33:18,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2024-10-12 20:33:18,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 1575. [2024-10-12 20:33:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1546 states have (on average 1.409443725743855) internal successors, (2179), 1574 states have internal predecessors, (2179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2179 transitions. [2024-10-12 20:33:18,901 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2179 transitions. Word has length 111 [2024-10-12 20:33:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:18,901 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2179 transitions. [2024-10-12 20:33:18,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2179 transitions. [2024-10-12 20:33:18,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 20:33:18,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:18,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:18,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-12 20:33:18,903 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:18,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:18,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1900817178, now seen corresponding path program 1 times [2024-10-12 20:33:18,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:18,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427572856] [2024-10-12 20:33:18,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:18,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:19,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:19,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:19,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427572856] [2024-10-12 20:33:19,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427572856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:19,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:19,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:19,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560834804] [2024-10-12 20:33:19,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:19,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:19,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:19,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:19,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:19,146 INFO L87 Difference]: Start difference. First operand 1575 states and 2179 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:20,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:20,941 INFO L93 Difference]: Finished difference Result 2591 states and 3601 transitions. [2024-10-12 20:33:20,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:33:20,941 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-12 20:33:20,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:20,944 INFO L225 Difference]: With dead ends: 2591 [2024-10-12 20:33:20,944 INFO L226 Difference]: Without dead ends: 2396 [2024-10-12 20:33:20,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:33:20,945 INFO L432 NwaCegarLoop]: 1280 mSDtfsCounter, 4469 mSDsluCounter, 4415 mSDsCounter, 0 mSdLazyCounter, 4171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4469 SdHoareTripleChecker+Valid, 5695 SdHoareTripleChecker+Invalid, 4175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:20,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4469 Valid, 5695 Invalid, 4175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4171 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 20:33:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2024-10-12 20:33:20,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1571. [2024-10-12 20:33:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1542 states have (on average 1.409857328145266) internal successors, (2174), 1570 states have internal predecessors, (2174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:20,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2174 transitions. [2024-10-12 20:33:20,957 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2174 transitions. Word has length 112 [2024-10-12 20:33:20,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:20,958 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2174 transitions. [2024-10-12 20:33:20,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:20,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2174 transitions. [2024-10-12 20:33:20,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 20:33:20,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:20,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:20,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-12 20:33:20,960 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:20,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:20,960 INFO L85 PathProgramCache]: Analyzing trace with hash 827343797, now seen corresponding path program 1 times [2024-10-12 20:33:20,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:20,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841995643] [2024-10-12 20:33:20,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:20,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:21,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:21,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841995643] [2024-10-12 20:33:21,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841995643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:21,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:21,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:21,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256911429] [2024-10-12 20:33:21,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:21,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:21,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:21,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:21,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:21,153 INFO L87 Difference]: Start difference. First operand 1571 states and 2174 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:22,899 INFO L93 Difference]: Finished difference Result 2586 states and 3595 transitions. [2024-10-12 20:33:22,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:33:22,899 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-12 20:33:22,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:22,902 INFO L225 Difference]: With dead ends: 2586 [2024-10-12 20:33:22,902 INFO L226 Difference]: Without dead ends: 2396 [2024-10-12 20:33:22,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:33:22,903 INFO L432 NwaCegarLoop]: 1144 mSDtfsCounter, 4744 mSDsluCounter, 3744 mSDsCounter, 0 mSdLazyCounter, 3951 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4744 SdHoareTripleChecker+Valid, 4888 SdHoareTripleChecker+Invalid, 3954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:22,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4744 Valid, 4888 Invalid, 3954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3951 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 20:33:22,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2024-10-12 20:33:22,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1567. [2024-10-12 20:33:22,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4102730819245775) internal successors, (2169), 1566 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2169 transitions. [2024-10-12 20:33:22,918 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2169 transitions. Word has length 112 [2024-10-12 20:33:22,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:22,919 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2169 transitions. [2024-10-12 20:33:22,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2169 transitions. [2024-10-12 20:33:22,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 20:33:22,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:22,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-12 20:33:22,921 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:22,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:22,921 INFO L85 PathProgramCache]: Analyzing trace with hash 89167614, now seen corresponding path program 1 times [2024-10-12 20:33:22,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:22,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165292329] [2024-10-12 20:33:22,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:22,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:23,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:23,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:23,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165292329] [2024-10-12 20:33:23,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165292329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:23,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:23,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:23,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669788429] [2024-10-12 20:33:23,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:23,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:23,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:23,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:23,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:23,159 INFO L87 Difference]: Start difference. First operand 1567 states and 2169 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:24,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:24,432 INFO L93 Difference]: Finished difference Result 2530 states and 3503 transitions. [2024-10-12 20:33:24,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:33:24,433 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-10-12 20:33:24,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:24,435 INFO L225 Difference]: With dead ends: 2530 [2024-10-12 20:33:24,435 INFO L226 Difference]: Without dead ends: 2348 [2024-10-12 20:33:24,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:33:24,436 INFO L432 NwaCegarLoop]: 981 mSDtfsCounter, 5287 mSDsluCounter, 3197 mSDsCounter, 0 mSdLazyCounter, 3420 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5287 SdHoareTripleChecker+Valid, 4178 SdHoareTripleChecker+Invalid, 3424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:24,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5287 Valid, 4178 Invalid, 3424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3420 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:33:24,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2024-10-12 20:33:24,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 1567. [2024-10-12 20:33:24,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4096228868660599) internal successors, (2168), 1566 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:24,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2168 transitions. [2024-10-12 20:33:24,455 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2168 transitions. Word has length 113 [2024-10-12 20:33:24,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:24,455 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2168 transitions. [2024-10-12 20:33:24,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:24,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2168 transitions. [2024-10-12 20:33:24,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 20:33:24,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:24,457 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:24,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-12 20:33:24,457 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:24,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:24,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1092664937, now seen corresponding path program 1 times [2024-10-12 20:33:24,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:24,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480084360] [2024-10-12 20:33:24,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:24,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:24,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:24,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480084360] [2024-10-12 20:33:24,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480084360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:24,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:24,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:24,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941450130] [2024-10-12 20:33:24,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:24,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:24,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:24,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:24,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:24,668 INFO L87 Difference]: Start difference. First operand 1567 states and 2168 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:25,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:25,928 INFO L93 Difference]: Finished difference Result 2526 states and 3498 transitions. [2024-10-12 20:33:25,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:33:25,929 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-10-12 20:33:25,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:25,931 INFO L225 Difference]: With dead ends: 2526 [2024-10-12 20:33:25,931 INFO L226 Difference]: Without dead ends: 2348 [2024-10-12 20:33:25,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:33:25,932 INFO L432 NwaCegarLoop]: 981 mSDtfsCounter, 5285 mSDsluCounter, 3197 mSDsCounter, 0 mSdLazyCounter, 3416 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5285 SdHoareTripleChecker+Valid, 4178 SdHoareTripleChecker+Invalid, 3420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:25,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5285 Valid, 4178 Invalid, 3420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3416 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 20:33:25,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2024-10-12 20:33:25,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 1567. [2024-10-12 20:33:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4089726918075423) internal successors, (2167), 1566 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2167 transitions. [2024-10-12 20:33:25,948 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2167 transitions. Word has length 113 [2024-10-12 20:33:25,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:25,948 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2167 transitions. [2024-10-12 20:33:25,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:25,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2167 transitions. [2024-10-12 20:33:25,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 20:33:25,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:25,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:25,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-12 20:33:25,951 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:25,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:25,952 INFO L85 PathProgramCache]: Analyzing trace with hash -56393821, now seen corresponding path program 1 times [2024-10-12 20:33:25,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:25,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541379324] [2024-10-12 20:33:25,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:25,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:25,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:26,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:26,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:26,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541379324] [2024-10-12 20:33:26,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541379324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:26,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:26,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:26,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148162847] [2024-10-12 20:33:26,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:26,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:26,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:26,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:26,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:26,219 INFO L87 Difference]: Start difference. First operand 1567 states and 2167 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:27,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:27,838 INFO L93 Difference]: Finished difference Result 2591 states and 3595 transitions. [2024-10-12 20:33:27,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:33:27,838 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-10-12 20:33:27,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:27,840 INFO L225 Difference]: With dead ends: 2591 [2024-10-12 20:33:27,840 INFO L226 Difference]: Without dead ends: 2396 [2024-10-12 20:33:27,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:33:27,841 INFO L432 NwaCegarLoop]: 1410 mSDtfsCounter, 4457 mSDsluCounter, 4641 mSDsCounter, 0 mSdLazyCounter, 4304 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4457 SdHoareTripleChecker+Valid, 6051 SdHoareTripleChecker+Invalid, 4307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:27,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4457 Valid, 6051 Invalid, 4307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4304 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 20:33:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2024-10-12 20:33:27,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1567. [2024-10-12 20:33:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4083224967490247) internal successors, (2166), 1566 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2166 transitions. [2024-10-12 20:33:27,855 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2166 transitions. Word has length 113 [2024-10-12 20:33:27,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:27,855 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2166 transitions. [2024-10-12 20:33:27,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2166 transitions. [2024-10-12 20:33:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 20:33:27,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:27,857 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:27,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-12 20:33:27,857 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:27,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:27,857 INFO L85 PathProgramCache]: Analyzing trace with hash -367433408, now seen corresponding path program 1 times [2024-10-12 20:33:27,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:27,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836780882] [2024-10-12 20:33:27,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:27,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:28,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:28,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836780882] [2024-10-12 20:33:28,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836780882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:28,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:28,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:33:28,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041036149] [2024-10-12 20:33:28,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:28,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:33:28,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:28,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:33:28,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:33:28,042 INFO L87 Difference]: Start difference. First operand 1567 states and 2166 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:29,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:29,389 INFO L93 Difference]: Finished difference Result 2432 states and 3332 transitions. [2024-10-12 20:33:29,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:33:29,389 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-10-12 20:33:29,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:29,391 INFO L225 Difference]: With dead ends: 2432 [2024-10-12 20:33:29,391 INFO L226 Difference]: Without dead ends: 2260 [2024-10-12 20:33:29,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:33:29,392 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 5843 mSDsluCounter, 2532 mSDsCounter, 0 mSdLazyCounter, 2910 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5843 SdHoareTripleChecker+Valid, 3338 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:29,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5843 Valid, 3338 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2910 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:33:29,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2024-10-12 20:33:29,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 1567. [2024-10-12 20:33:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.407672301690507) internal successors, (2165), 1566 states have internal predecessors, (2165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2165 transitions. [2024-10-12 20:33:29,407 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2165 transitions. Word has length 113 [2024-10-12 20:33:29,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:29,407 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2165 transitions. [2024-10-12 20:33:29,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:29,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2165 transitions. [2024-10-12 20:33:29,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 20:33:29,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:29,409 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:29,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-12 20:33:29,409 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-12 20:33:29,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:29,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1002611089, now seen corresponding path program 1 times [2024-10-12 20:33:29,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:29,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194446826] [2024-10-12 20:33:29,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:29,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:29,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:29,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194446826] [2024-10-12 20:33:29,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194446826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:29,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:29,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:33:29,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262397803] [2024-10-12 20:33:29,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:29,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:33:29,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:29,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:33:29,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:33:29,761 INFO L87 Difference]: Start difference. First operand 1567 states and 2165 transitions. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)