./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.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 876148c876cf7c1b78d2f058097c1ea19d5931075241b9f9a3c243e2bacc58fd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:55:10,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:55:10,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:55:10,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:55:10,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:55:10,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:55:10,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:55:10,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:55:10,431 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:55:10,431 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:55:10,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:55:10,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:55:10,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:55:10,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:55:10,433 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:55:10,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:55:10,434 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:55:10,434 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:55:10,435 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:55:10,435 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:55:10,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:55:10,440 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:55:10,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:55:10,441 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:55:10,441 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:55:10,441 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:55:10,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:55:10,442 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:55:10,442 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:55:10,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:55:10,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:55:10,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:55:10,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:55:10,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:55:10,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:55:10,446 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:55:10,447 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:55:10,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:55:10,447 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:55:10,448 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:55:10,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:55:10,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:55:10,449 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 -> 876148c876cf7c1b78d2f058097c1ea19d5931075241b9f9a3c243e2bacc58fd [2024-11-19 22:55:10,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:55:10,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:55:10,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:55:10,741 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:55:10,742 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:55:10,744 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-19 22:55:12,219 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:55:12,580 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:55:12,581 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-19 22:55:12,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3932f0c9c/8cf05794e7f44c3d85bc2bbba535c2da/FLAGd83aee5d4 [2024-11-19 22:55:12,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3932f0c9c/8cf05794e7f44c3d85bc2bbba535c2da [2024-11-19 22:55:12,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:55:12,626 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:55:12,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:55:12,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:55:12,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:55:12,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:55:12" (1/1) ... [2024-11-19 22:55:12,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57cb3231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:12, skipping insertion in model container [2024-11-19 22:55:12,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:55:12" (1/1) ... [2024-11-19 22:55:12,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:55:13,051 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10927,10940] [2024-11-19 22:55:13,078 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14764,14777] [2024-11-19 22:55:13,092 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15985,15998] [2024-11-19 22:55:13,098 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16691,16704] [2024-11-19 22:55:13,116 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18235,18248] [2024-11-19 22:55:13,123 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18941,18954] [2024-11-19 22:55:13,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19970,19983] [2024-11-19 22:55:13,149 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22376,22389] [2024-11-19 22:55:13,155 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23085,23098] [2024-11-19 22:55:13,167 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24122,24135] [2024-11-19 22:55:13,187 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26018,26031] [2024-11-19 22:55:13,210 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29926,29939] [2024-11-19 22:55:13,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30635,30648] [2024-11-19 22:55:13,233 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31667,31680] [2024-11-19 22:55:13,252 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33558,33571] [2024-11-19 22:55:13,278 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36771,36784] [2024-11-19 22:55:13,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:55:13,592 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:55:13,647 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10927,10940] [2024-11-19 22:55:13,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14764,14777] [2024-11-19 22:55:13,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15985,15998] [2024-11-19 22:55:13,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16691,16704] [2024-11-19 22:55:13,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18235,18248] [2024-11-19 22:55:13,674 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18941,18954] [2024-11-19 22:55:13,680 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19970,19983] [2024-11-19 22:55:13,688 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22376,22389] [2024-11-19 22:55:13,691 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23085,23098] [2024-11-19 22:55:13,697 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24122,24135] [2024-11-19 22:55:13,703 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26018,26031] [2024-11-19 22:55:13,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29926,29939] [2024-11-19 22:55:13,728 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30635,30648] [2024-11-19 22:55:13,734 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31667,31680] [2024-11-19 22:55:13,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33558,33571] [2024-11-19 22:55:13,749 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36771,36784] [2024-11-19 22:55:13,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:55:13,860 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:55:13,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:13 WrapperNode [2024-11-19 22:55:13,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:55:13,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:55:13,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:55:13,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:55:13,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:13" (1/1) ... [2024-11-19 22:55:13,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:13" (1/1) ... [2024-11-19 22:55:14,028 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3577 [2024-11-19 22:55:14,029 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:55:14,030 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:55:14,030 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:55:14,030 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:55:14,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:13" (1/1) ... [2024-11-19 22:55:14,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:13" (1/1) ... [2024-11-19 22:55:14,055 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:13" (1/1) ... [2024-11-19 22:55:14,113 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 22:55:14,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:13" (1/1) ... [2024-11-19 22:55:14,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:13" (1/1) ... [2024-11-19 22:55:14,163 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:13" (1/1) ... [2024-11-19 22:55:14,186 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:13" (1/1) ... [2024-11-19 22:55:14,205 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:13" (1/1) ... [2024-11-19 22:55:14,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:13" (1/1) ... [2024-11-19 22:55:14,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:55:14,233 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:55:14,233 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:55:14,233 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:55:14,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:13" (1/1) ... [2024-11-19 22:55:14,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:55:14,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:55:14,272 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 22:55:14,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 22:55:14,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:55:14,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:55:14,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:55:14,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:55:14,530 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:55:14,531 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:55:16,565 INFO L? ?]: Removed 539 outVars from TransFormulas that were not future-live. [2024-11-19 22:55:16,566 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:55:16,607 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:55:16,611 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 22:55:16,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:55:16 BoogieIcfgContainer [2024-11-19 22:55:16,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:55:16,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:55:16,615 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:55:16,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:55:16,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:55:12" (1/3) ... [2024-11-19 22:55:16,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e027b84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:55:16, skipping insertion in model container [2024-11-19 22:55:16,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:13" (2/3) ... [2024-11-19 22:55:16,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e027b84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:55:16, skipping insertion in model container [2024-11-19 22:55:16,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:55:16" (3/3) ... [2024-11-19 22:55:16,622 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-19 22:55:16,669 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:55:16,670 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-19 22:55:16,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:55:16,770 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;@11d52651, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:55:16,770 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-19 22:55:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 626 states, 609 states have (on average 1.8505747126436782) internal successors, (1127), 625 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:16,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-19 22:55:16,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:16,809 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] [2024-11-19 22:55:16,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:16,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:16,816 INFO L85 PathProgramCache]: Analyzing trace with hash -50607350, now seen corresponding path program 1 times [2024-11-19 22:55:16,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:16,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20223276] [2024-11-19 22:55:16,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:16,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:17,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:17,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20223276] [2024-11-19 22:55:17,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20223276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:17,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:17,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:55:17,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862762517] [2024-11-19 22:55:17,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:17,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:55:17,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:17,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:55:17,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:55:17,552 INFO L87 Difference]: Start difference. First operand has 626 states, 609 states have (on average 1.8505747126436782) internal successors, (1127), 625 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:18,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:18,034 INFO L93 Difference]: Finished difference Result 971 states and 1686 transitions. [2024-11-19 22:55:18,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:55:18,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-19 22:55:18,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:18,054 INFO L225 Difference]: With dead ends: 971 [2024-11-19 22:55:18,055 INFO L226 Difference]: Without dead ends: 498 [2024-11-19 22:55:18,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:55:18,067 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 2526 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2526 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:18,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2526 Valid, 603 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:55:18,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-19 22:55:18,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2024-11-19 22:55:18,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 482 states have (on average 1.3112033195020747) internal successors, (632), 497 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 632 transitions. [2024-11-19 22:55:18,136 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 632 transitions. Word has length 71 [2024-11-19 22:55:18,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:18,137 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 632 transitions. [2024-11-19 22:55:18,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:18,138 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 632 transitions. [2024-11-19 22:55:18,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-19 22:55:18,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:18,142 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] [2024-11-19 22:55:18,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:55:18,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:18,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:18,146 INFO L85 PathProgramCache]: Analyzing trace with hash -329897172, now seen corresponding path program 1 times [2024-11-19 22:55:18,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:18,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669725205] [2024-11-19 22:55:18,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:18,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:18,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:18,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669725205] [2024-11-19 22:55:18,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669725205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:18,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:18,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:55:18,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970637952] [2024-11-19 22:55:18,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:18,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:55:18,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:18,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:55:18,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:55:18,411 INFO L87 Difference]: Start difference. First operand 498 states and 632 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:18,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:18,793 INFO L93 Difference]: Finished difference Result 834 states and 1087 transitions. [2024-11-19 22:55:18,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:55:18,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-19 22:55:18,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:18,796 INFO L225 Difference]: With dead ends: 834 [2024-11-19 22:55:18,796 INFO L226 Difference]: Without dead ends: 458 [2024-11-19 22:55:18,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:55:18,802 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 1648 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1648 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:18,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1648 Valid, 328 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:55:18,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-19 22:55:18,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2024-11-19 22:55:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 442 states have (on average 1.3190045248868778) internal successors, (583), 457 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 583 transitions. [2024-11-19 22:55:18,825 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 583 transitions. Word has length 72 [2024-11-19 22:55:18,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:18,826 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 583 transitions. [2024-11-19 22:55:18,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 583 transitions. [2024-11-19 22:55:18,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-19 22:55:18,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:18,828 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] [2024-11-19 22:55:18,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:55:18,829 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:18,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:18,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1203518485, now seen corresponding path program 1 times [2024-11-19 22:55:18,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:18,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527917616] [2024-11-19 22:55:18,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:18,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:19,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:19,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:19,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527917616] [2024-11-19 22:55:19,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527917616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:19,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:19,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:55:19,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009879891] [2024-11-19 22:55:19,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:19,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:55:19,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:19,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:55:19,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:55:19,030 INFO L87 Difference]: Start difference. First operand 458 states and 583 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:19,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:19,368 INFO L93 Difference]: Finished difference Result 794 states and 1037 transitions. [2024-11-19 22:55:19,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:55:19,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-19 22:55:19,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:19,373 INFO L225 Difference]: With dead ends: 794 [2024-11-19 22:55:19,374 INFO L226 Difference]: Without dead ends: 426 [2024-11-19 22:55:19,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:55:19,377 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 1555 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:19,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 322 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:55:19,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-19 22:55:19,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2024-11-19 22:55:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 410 states have (on average 1.3317073170731708) internal successors, (546), 425 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 546 transitions. [2024-11-19 22:55:19,402 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 546 transitions. Word has length 73 [2024-11-19 22:55:19,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:19,402 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 546 transitions. [2024-11-19 22:55:19,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:19,403 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 546 transitions. [2024-11-19 22:55:19,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 22:55:19,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:19,405 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] [2024-11-19 22:55:19,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:55:19,406 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:19,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:19,407 INFO L85 PathProgramCache]: Analyzing trace with hash -2052061875, now seen corresponding path program 1 times [2024-11-19 22:55:19,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:19,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170600698] [2024-11-19 22:55:19,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:19,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:19,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:19,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170600698] [2024-11-19 22:55:19,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170600698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:19,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:19,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:55:19,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243178689] [2024-11-19 22:55:19,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:19,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:55:19,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:19,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:55:19,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:55:19,650 INFO L87 Difference]: Start difference. First operand 426 states and 546 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:19,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:19,937 INFO L93 Difference]: Finished difference Result 762 states and 999 transitions. [2024-11-19 22:55:19,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:55:19,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-19 22:55:19,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:19,940 INFO L225 Difference]: With dead ends: 762 [2024-11-19 22:55:19,940 INFO L226 Difference]: Without dead ends: 401 [2024-11-19 22:55:19,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:55:19,943 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 1497 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:19,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 309 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:55:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-19 22:55:19,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2024-11-19 22:55:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.3454545454545455) internal successors, (518), 400 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 518 transitions. [2024-11-19 22:55:19,956 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 518 transitions. Word has length 74 [2024-11-19 22:55:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:19,957 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 518 transitions. [2024-11-19 22:55:19,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 518 transitions. [2024-11-19 22:55:19,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 22:55:19,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:19,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] [2024-11-19 22:55:19,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:55:19,959 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:19,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:19,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1326375668, now seen corresponding path program 1 times [2024-11-19 22:55:19,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:19,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152278096] [2024-11-19 22:55:19,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:19,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:20,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:20,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152278096] [2024-11-19 22:55:20,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152278096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:20,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:20,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:55:20,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503161495] [2024-11-19 22:55:20,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:20,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:55:20,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:20,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:55:20,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:55:20,126 INFO L87 Difference]: Start difference. First operand 401 states and 518 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:20,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:20,403 INFO L93 Difference]: Finished difference Result 737 states and 970 transitions. [2024-11-19 22:55:20,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:55:20,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-19 22:55:20,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:20,408 INFO L225 Difference]: With dead ends: 737 [2024-11-19 22:55:20,408 INFO L226 Difference]: Without dead ends: 390 [2024-11-19 22:55:20,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:55:20,412 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 1445 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:20,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1445 Valid, 304 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:55:20,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-19 22:55:20,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-11-19 22:55:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3502673796791445) internal successors, (505), 389 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:20,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 505 transitions. [2024-11-19 22:55:20,425 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 505 transitions. Word has length 75 [2024-11-19 22:55:20,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:20,426 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 505 transitions. [2024-11-19 22:55:20,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 505 transitions. [2024-11-19 22:55:20,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-19 22:55:20,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:20,428 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] [2024-11-19 22:55:20,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:55:20,430 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:20,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:20,431 INFO L85 PathProgramCache]: Analyzing trace with hash -976633234, now seen corresponding path program 1 times [2024-11-19 22:55:20,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:20,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534640842] [2024-11-19 22:55:20,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:20,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:20,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:20,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534640842] [2024-11-19 22:55:20,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534640842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:20,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:20,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 22:55:20,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815775316] [2024-11-19 22:55:20,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:20,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 22:55:20,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:20,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 22:55:20,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:55:20,923 INFO L87 Difference]: Start difference. First operand 390 states and 505 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:21,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:21,765 INFO L93 Difference]: Finished difference Result 672 states and 880 transitions. [2024-11-19 22:55:21,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 22:55:21,766 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-19 22:55:21,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:21,768 INFO L225 Difference]: With dead ends: 672 [2024-11-19 22:55:21,768 INFO L226 Difference]: Without dead ends: 591 [2024-11-19 22:55:21,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:21,772 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 2269 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2269 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:21,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2269 Valid, 1457 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 22:55:21,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-11-19 22:55:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 390. [2024-11-19 22:55:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3475935828877006) internal successors, (504), 389 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 504 transitions. [2024-11-19 22:55:21,786 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 504 transitions. Word has length 76 [2024-11-19 22:55:21,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:21,786 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 504 transitions. [2024-11-19 22:55:21,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 504 transitions. [2024-11-19 22:55:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-19 22:55:21,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:21,788 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] [2024-11-19 22:55:21,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 22:55:21,790 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:21,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:21,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1406136960, now seen corresponding path program 1 times [2024-11-19 22:55:21,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:21,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323829789] [2024-11-19 22:55:21,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:21,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:22,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:22,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323829789] [2024-11-19 22:55:22,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323829789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:22,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:22,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:55:22,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233719880] [2024-11-19 22:55:22,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:22,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 22:55:22,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:22,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 22:55:22,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:55:22,192 INFO L87 Difference]: Start difference. First operand 390 states and 504 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:22,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:22,869 INFO L93 Difference]: Finished difference Result 754 states and 960 transitions. [2024-11-19 22:55:22,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 22:55:22,870 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-19 22:55:22,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:22,872 INFO L225 Difference]: With dead ends: 754 [2024-11-19 22:55:22,872 INFO L226 Difference]: Without dead ends: 542 [2024-11-19 22:55:22,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-19 22:55:22,874 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 2066 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2066 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:22,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2066 Valid, 1140 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 22:55:22,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-19 22:55:22,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 390. [2024-11-19 22:55:22,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3449197860962567) internal successors, (503), 389 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 503 transitions. [2024-11-19 22:55:22,887 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 503 transitions. Word has length 76 [2024-11-19 22:55:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:22,887 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 503 transitions. [2024-11-19 22:55:22,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 503 transitions. [2024-11-19 22:55:22,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-19 22:55:22,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:22,889 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] [2024-11-19 22:55:22,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 22:55:22,890 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:22,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:22,891 INFO L85 PathProgramCache]: Analyzing trace with hash 649885335, now seen corresponding path program 1 times [2024-11-19 22:55:22,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:22,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453959217] [2024-11-19 22:55:22,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:22,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:23,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:23,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:23,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453959217] [2024-11-19 22:55:23,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453959217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:23,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:23,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:23,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609058774] [2024-11-19 22:55:23,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:23,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:23,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:23,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:23,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:23,274 INFO L87 Difference]: Start difference. First operand 390 states and 503 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:24,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:24,191 INFO L93 Difference]: Finished difference Result 733 states and 965 transitions. [2024-11-19 22:55:24,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:24,191 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-19 22:55:24,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:24,194 INFO L225 Difference]: With dead ends: 733 [2024-11-19 22:55:24,194 INFO L226 Difference]: Without dead ends: 605 [2024-11-19 22:55:24,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:55:24,195 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 2124 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2124 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:24,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2124 Valid, 2034 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 22:55:24,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-19 22:55:24,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 390. [2024-11-19 22:55:24,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3422459893048129) internal successors, (502), 389 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 502 transitions. [2024-11-19 22:55:24,205 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 502 transitions. Word has length 76 [2024-11-19 22:55:24,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:24,205 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 502 transitions. [2024-11-19 22:55:24,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 502 transitions. [2024-11-19 22:55:24,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-19 22:55:24,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:24,207 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] [2024-11-19 22:55:24,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 22:55:24,207 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:24,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:24,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1538930145, now seen corresponding path program 1 times [2024-11-19 22:55:24,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:24,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666704898] [2024-11-19 22:55:24,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:24,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:24,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:24,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:24,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666704898] [2024-11-19 22:55:24,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666704898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:24,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:24,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:24,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765279873] [2024-11-19 22:55:24,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:24,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:24,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:24,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:24,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:24,469 INFO L87 Difference]: Start difference. First operand 390 states and 502 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:25,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:25,191 INFO L93 Difference]: Finished difference Result 582 states and 741 transitions. [2024-11-19 22:55:25,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:25,191 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-19 22:55:25,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:25,194 INFO L225 Difference]: With dead ends: 582 [2024-11-19 22:55:25,194 INFO L226 Difference]: Without dead ends: 577 [2024-11-19 22:55:25,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:25,195 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 2260 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2260 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:25,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2260 Valid, 1216 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 22:55:25,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-19 22:55:25,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 390. [2024-11-19 22:55:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.339572192513369) internal successors, (501), 389 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 501 transitions. [2024-11-19 22:55:25,203 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 501 transitions. Word has length 76 [2024-11-19 22:55:25,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:25,203 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 501 transitions. [2024-11-19 22:55:25,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 501 transitions. [2024-11-19 22:55:25,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 22:55:25,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:25,204 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] [2024-11-19 22:55:25,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 22:55:25,205 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:25,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:25,205 INFO L85 PathProgramCache]: Analyzing trace with hash 684383254, now seen corresponding path program 1 times [2024-11-19 22:55:25,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:25,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199715415] [2024-11-19 22:55:25,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:25,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:25,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:25,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199715415] [2024-11-19 22:55:25,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199715415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:25,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:25,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:25,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705084625] [2024-11-19 22:55:25,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:25,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:25,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:25,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:25,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:25,515 INFO L87 Difference]: Start difference. First operand 390 states and 501 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:26,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:26,293 INFO L93 Difference]: Finished difference Result 699 states and 917 transitions. [2024-11-19 22:55:26,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:26,294 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-19 22:55:26,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:26,296 INFO L225 Difference]: With dead ends: 699 [2024-11-19 22:55:26,296 INFO L226 Difference]: Without dead ends: 601 [2024-11-19 22:55:26,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:26,297 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 1146 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:26,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 1590 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 22:55:26,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-19 22:55:26,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 390. [2024-11-19 22:55:26,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3368983957219251) internal successors, (500), 389 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:26,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 500 transitions. [2024-11-19 22:55:26,304 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 500 transitions. Word has length 78 [2024-11-19 22:55:26,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:26,304 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 500 transitions. [2024-11-19 22:55:26,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:26,305 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 500 transitions. [2024-11-19 22:55:26,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 22:55:26,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:26,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:26,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 22:55:26,306 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:26,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:26,307 INFO L85 PathProgramCache]: Analyzing trace with hash 275538026, now seen corresponding path program 1 times [2024-11-19 22:55:26,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:26,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994869169] [2024-11-19 22:55:26,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:26,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:26,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:26,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:26,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994869169] [2024-11-19 22:55:26,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994869169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:26,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:26,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:26,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38932124] [2024-11-19 22:55:26,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:26,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:26,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:26,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:26,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:26,614 INFO L87 Difference]: Start difference. First operand 390 states and 500 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:27,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:27,269 INFO L93 Difference]: Finished difference Result 669 states and 872 transitions. [2024-11-19 22:55:27,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:27,269 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-19 22:55:27,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:27,272 INFO L225 Difference]: With dead ends: 669 [2024-11-19 22:55:27,272 INFO L226 Difference]: Without dead ends: 593 [2024-11-19 22:55:27,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:55:27,274 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 1941 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1941 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:27,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1941 Valid, 1330 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:27,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-11-19 22:55:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 390. [2024-11-19 22:55:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3342245989304813) internal successors, (499), 389 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 499 transitions. [2024-11-19 22:55:27,283 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 499 transitions. Word has length 78 [2024-11-19 22:55:27,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:27,283 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 499 transitions. [2024-11-19 22:55:27,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:27,283 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 499 transitions. [2024-11-19 22:55:27,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 22:55:27,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:27,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:27,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 22:55:27,287 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:27,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:27,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1207054515, now seen corresponding path program 1 times [2024-11-19 22:55:27,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:27,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590322891] [2024-11-19 22:55:27,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:27,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:27,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:27,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590322891] [2024-11-19 22:55:27,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590322891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:27,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:27,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:27,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839404853] [2024-11-19 22:55:27,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:27,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:27,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:27,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:27,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:27,591 INFO L87 Difference]: Start difference. First operand 390 states and 499 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:28,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:28,250 INFO L93 Difference]: Finished difference Result 665 states and 867 transitions. [2024-11-19 22:55:28,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:28,251 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-19 22:55:28,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:28,253 INFO L225 Difference]: With dead ends: 665 [2024-11-19 22:55:28,253 INFO L226 Difference]: Without dead ends: 593 [2024-11-19 22:55:28,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:55:28,254 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 1761 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:28,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1761 Valid, 1493 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:28,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-11-19 22:55:28,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 390. [2024-11-19 22:55:28,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3315508021390374) internal successors, (498), 389 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 498 transitions. [2024-11-19 22:55:28,262 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 498 transitions. Word has length 78 [2024-11-19 22:55:28,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:28,263 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 498 transitions. [2024-11-19 22:55:28,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 498 transitions. [2024-11-19 22:55:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 22:55:28,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:28,264 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] [2024-11-19 22:55:28,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 22:55:28,264 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:28,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:28,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1663299084, now seen corresponding path program 1 times [2024-11-19 22:55:28,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:28,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757729155] [2024-11-19 22:55:28,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:28,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:28,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:28,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:28,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757729155] [2024-11-19 22:55:28,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757729155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:28,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:28,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:28,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951185114] [2024-11-19 22:55:28,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:28,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:28,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:28,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:28,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:28,598 INFO L87 Difference]: Start difference. First operand 390 states and 498 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:29,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:29,247 INFO L93 Difference]: Finished difference Result 690 states and 902 transitions. [2024-11-19 22:55:29,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:29,248 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-19 22:55:29,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:29,250 INFO L225 Difference]: With dead ends: 690 [2024-11-19 22:55:29,250 INFO L226 Difference]: Without dead ends: 601 [2024-11-19 22:55:29,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:29,251 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 2576 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2576 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:29,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2576 Valid, 1467 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:29,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-19 22:55:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 390. [2024-11-19 22:55:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3288770053475936) internal successors, (497), 389 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 497 transitions. [2024-11-19 22:55:29,259 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 497 transitions. Word has length 78 [2024-11-19 22:55:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:29,259 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 497 transitions. [2024-11-19 22:55:29,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 497 transitions. [2024-11-19 22:55:29,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 22:55:29,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:29,260 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] [2024-11-19 22:55:29,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 22:55:29,261 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:29,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:29,261 INFO L85 PathProgramCache]: Analyzing trace with hash 574449411, now seen corresponding path program 1 times [2024-11-19 22:55:29,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:29,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872616365] [2024-11-19 22:55:29,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:29,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:29,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:29,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872616365] [2024-11-19 22:55:29,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872616365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:29,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:29,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:29,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012717583] [2024-11-19 22:55:29,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:29,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:29,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:29,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:29,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:29,553 INFO L87 Difference]: Start difference. First operand 390 states and 497 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:30,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:30,252 INFO L93 Difference]: Finished difference Result 748 states and 971 transitions. [2024-11-19 22:55:30,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:30,252 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-19 22:55:30,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:30,254 INFO L225 Difference]: With dead ends: 748 [2024-11-19 22:55:30,254 INFO L226 Difference]: Without dead ends: 605 [2024-11-19 22:55:30,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:30,257 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 1983 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1983 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:30,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1983 Valid, 1684 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:30,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-19 22:55:30,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 390. [2024-11-19 22:55:30,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3262032085561497) internal successors, (496), 389 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 496 transitions. [2024-11-19 22:55:30,266 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 496 transitions. Word has length 78 [2024-11-19 22:55:30,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:30,266 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 496 transitions. [2024-11-19 22:55:30,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:30,266 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 496 transitions. [2024-11-19 22:55:30,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 22:55:30,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:30,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:30,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 22:55:30,268 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:30,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:30,268 INFO L85 PathProgramCache]: Analyzing trace with hash 688086315, now seen corresponding path program 1 times [2024-11-19 22:55:30,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:30,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215193652] [2024-11-19 22:55:30,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:30,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:30,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:30,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:30,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215193652] [2024-11-19 22:55:30,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215193652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:30,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:30,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:30,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548211323] [2024-11-19 22:55:30,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:30,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:30,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:30,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:30,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:30,562 INFO L87 Difference]: Start difference. First operand 390 states and 496 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:31,293 INFO L93 Difference]: Finished difference Result 669 states and 867 transitions. [2024-11-19 22:55:31,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:31,294 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-19 22:55:31,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:31,296 INFO L225 Difference]: With dead ends: 669 [2024-11-19 22:55:31,297 INFO L226 Difference]: Without dead ends: 593 [2024-11-19 22:55:31,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:31,298 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 2569 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2569 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:31,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2569 Valid, 1398 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 22:55:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-11-19 22:55:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 390. [2024-11-19 22:55:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3235294117647058) internal successors, (495), 389 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:31,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 495 transitions. [2024-11-19 22:55:31,310 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 495 transitions. Word has length 78 [2024-11-19 22:55:31,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:31,310 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 495 transitions. [2024-11-19 22:55:31,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:31,310 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 495 transitions. [2024-11-19 22:55:31,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 22:55:31,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:31,311 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] [2024-11-19 22:55:31,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 22:55:31,312 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:31,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:31,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1096931543, now seen corresponding path program 1 times [2024-11-19 22:55:31,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:31,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183105818] [2024-11-19 22:55:31,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:31,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:31,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:31,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:31,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183105818] [2024-11-19 22:55:31,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183105818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:31,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:31,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:31,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035796717] [2024-11-19 22:55:31,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:31,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:31,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:31,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:31,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:31,610 INFO L87 Difference]: Start difference. First operand 390 states and 495 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:32,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:32,274 INFO L93 Difference]: Finished difference Result 699 states and 907 transitions. [2024-11-19 22:55:32,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:32,274 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-19 22:55:32,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:32,276 INFO L225 Difference]: With dead ends: 699 [2024-11-19 22:55:32,276 INFO L226 Difference]: Without dead ends: 601 [2024-11-19 22:55:32,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:32,278 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 2038 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2038 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:32,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2038 Valid, 1865 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-19 22:55:32,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 390. [2024-11-19 22:55:32,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.320855614973262) internal successors, (494), 389 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 494 transitions. [2024-11-19 22:55:32,285 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 494 transitions. Word has length 78 [2024-11-19 22:55:32,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:32,286 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 494 transitions. [2024-11-19 22:55:32,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:32,286 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 494 transitions. [2024-11-19 22:55:32,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 22:55:32,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:32,287 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] [2024-11-19 22:55:32,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 22:55:32,288 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:32,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:32,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1780834374, now seen corresponding path program 1 times [2024-11-19 22:55:32,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:32,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187127168] [2024-11-19 22:55:32,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:32,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:32,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:32,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187127168] [2024-11-19 22:55:32,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187127168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:32,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:32,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:32,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980967584] [2024-11-19 22:55:32,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:32,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:32,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:32,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:32,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:32,594 INFO L87 Difference]: Start difference. First operand 390 states and 494 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:33,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:33,317 INFO L93 Difference]: Finished difference Result 643 states and 825 transitions. [2024-11-19 22:55:33,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:33,317 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-19 22:55:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:33,319 INFO L225 Difference]: With dead ends: 643 [2024-11-19 22:55:33,319 INFO L226 Difference]: Without dead ends: 577 [2024-11-19 22:55:33,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:55:33,320 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 2133 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2133 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:33,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2133 Valid, 1766 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 22:55:33,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-19 22:55:33,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 390. [2024-11-19 22:55:33,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3181818181818181) internal successors, (493), 389 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:33,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 493 transitions. [2024-11-19 22:55:33,327 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 493 transitions. Word has length 80 [2024-11-19 22:55:33,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:33,328 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 493 transitions. [2024-11-19 22:55:33,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:33,328 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 493 transitions. [2024-11-19 22:55:33,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 22:55:33,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:33,329 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] [2024-11-19 22:55:33,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 22:55:33,329 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:33,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:33,330 INFO L85 PathProgramCache]: Analyzing trace with hash 515089470, now seen corresponding path program 1 times [2024-11-19 22:55:33,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:33,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895220535] [2024-11-19 22:55:33,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:33,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:33,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:33,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895220535] [2024-11-19 22:55:33,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895220535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:33,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:33,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 22:55:33,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388185526] [2024-11-19 22:55:33,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:33,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:55:33,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:33,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:55:33,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:55:33,893 INFO L87 Difference]: Start difference. First operand 390 states and 493 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:35,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:35,032 INFO L93 Difference]: Finished difference Result 808 states and 1063 transitions. [2024-11-19 22:55:35,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 22:55:35,033 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-19 22:55:35,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:35,035 INFO L225 Difference]: With dead ends: 808 [2024-11-19 22:55:35,035 INFO L226 Difference]: Without dead ends: 739 [2024-11-19 22:55:35,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-19 22:55:35,036 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 4053 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4053 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:35,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4053 Valid, 1645 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 22:55:35,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-11-19 22:55:35,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 394. [2024-11-19 22:55:35,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.3148148148148149) internal successors, (497), 393 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:35,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 497 transitions. [2024-11-19 22:55:35,045 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 497 transitions. Word has length 80 [2024-11-19 22:55:35,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:35,045 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 497 transitions. [2024-11-19 22:55:35,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:35,046 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 497 transitions. [2024-11-19 22:55:35,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 22:55:35,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:35,047 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] [2024-11-19 22:55:35,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 22:55:35,047 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:35,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:35,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1270226045, now seen corresponding path program 1 times [2024-11-19 22:55:35,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:35,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746290636] [2024-11-19 22:55:35,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:35,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:35,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:35,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:35,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746290636] [2024-11-19 22:55:35,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746290636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:35,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:35,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:35,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35064376] [2024-11-19 22:55:35,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:35,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:35,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:35,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:35,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:35,352 INFO L87 Difference]: Start difference. First operand 394 states and 497 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:36,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:36,095 INFO L93 Difference]: Finished difference Result 646 states and 826 transitions. [2024-11-19 22:55:36,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:36,095 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-19 22:55:36,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:36,097 INFO L225 Difference]: With dead ends: 646 [2024-11-19 22:55:36,097 INFO L226 Difference]: Without dead ends: 577 [2024-11-19 22:55:36,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:55:36,098 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 2212 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2212 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:36,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2212 Valid, 1584 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 22:55:36,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-19 22:55:36,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 394. [2024-11-19 22:55:36,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.312169312169312) internal successors, (496), 393 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:36,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 496 transitions. [2024-11-19 22:55:36,105 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 496 transitions. Word has length 80 [2024-11-19 22:55:36,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:36,105 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 496 transitions. [2024-11-19 22:55:36,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:36,105 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 496 transitions. [2024-11-19 22:55:36,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 22:55:36,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:36,106 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] [2024-11-19 22:55:36,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 22:55:36,107 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:36,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:36,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1112544149, now seen corresponding path program 1 times [2024-11-19 22:55:36,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:36,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840147832] [2024-11-19 22:55:36,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:36,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:36,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:36,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:36,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840147832] [2024-11-19 22:55:36,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840147832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:36,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:36,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:36,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75596230] [2024-11-19 22:55:36,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:36,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:36,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:36,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:36,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:36,348 INFO L87 Difference]: Start difference. First operand 394 states and 496 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:37,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:37,025 INFO L93 Difference]: Finished difference Result 678 states and 871 transitions. [2024-11-19 22:55:37,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:37,025 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-19 22:55:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:37,027 INFO L225 Difference]: With dead ends: 678 [2024-11-19 22:55:37,027 INFO L226 Difference]: Without dead ends: 597 [2024-11-19 22:55:37,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:37,028 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 1602 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:37,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1602 Valid, 1649 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:37,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-19 22:55:37,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 394. [2024-11-19 22:55:37,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.3095238095238095) internal successors, (495), 393 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:37,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 495 transitions. [2024-11-19 22:55:37,040 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 495 transitions. Word has length 80 [2024-11-19 22:55:37,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:37,040 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 495 transitions. [2024-11-19 22:55:37,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:37,040 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 495 transitions. [2024-11-19 22:55:37,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 22:55:37,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:37,041 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] [2024-11-19 22:55:37,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 22:55:37,042 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:37,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:37,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1251491228, now seen corresponding path program 1 times [2024-11-19 22:55:37,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:37,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649217830] [2024-11-19 22:55:37,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:37,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:37,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:37,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649217830] [2024-11-19 22:55:37,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649217830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:37,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:37,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:37,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288552153] [2024-11-19 22:55:37,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:37,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:37,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:37,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:37,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:37,270 INFO L87 Difference]: Start difference. First operand 394 states and 495 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:37,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:37,979 INFO L93 Difference]: Finished difference Result 673 states and 863 transitions. [2024-11-19 22:55:37,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:37,980 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-19 22:55:37,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:37,982 INFO L225 Difference]: With dead ends: 673 [2024-11-19 22:55:37,982 INFO L226 Difference]: Without dead ends: 597 [2024-11-19 22:55:37,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:37,984 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 1890 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1890 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:37,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1890 Valid, 1649 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 22:55:37,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-19 22:55:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 394. [2024-11-19 22:55:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.306878306878307) internal successors, (494), 393 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 494 transitions. [2024-11-19 22:55:37,991 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 494 transitions. Word has length 80 [2024-11-19 22:55:37,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:37,991 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 494 transitions. [2024-11-19 22:55:37,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:37,992 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 494 transitions. [2024-11-19 22:55:37,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 22:55:37,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:37,993 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] [2024-11-19 22:55:37,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 22:55:37,993 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:37,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:37,994 INFO L85 PathProgramCache]: Analyzing trace with hash -955374417, now seen corresponding path program 1 times [2024-11-19 22:55:37,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:37,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502322892] [2024-11-19 22:55:37,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:37,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:38,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:38,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:38,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502322892] [2024-11-19 22:55:38,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502322892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:38,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:38,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:38,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372180402] [2024-11-19 22:55:38,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:38,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:38,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:38,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:38,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:38,231 INFO L87 Difference]: Start difference. First operand 394 states and 494 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:38,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:38,854 INFO L93 Difference]: Finished difference Result 643 states and 820 transitions. [2024-11-19 22:55:38,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:38,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-19 22:55:38,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:38,856 INFO L225 Difference]: With dead ends: 643 [2024-11-19 22:55:38,856 INFO L226 Difference]: Without dead ends: 577 [2024-11-19 22:55:38,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:55:38,857 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 2166 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:38,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2166 Valid, 1545 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:38,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-19 22:55:38,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 394. [2024-11-19 22:55:38,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.3042328042328042) internal successors, (493), 393 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 493 transitions. [2024-11-19 22:55:38,867 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 493 transitions. Word has length 80 [2024-11-19 22:55:38,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:38,867 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 493 transitions. [2024-11-19 22:55:38,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:38,868 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 493 transitions. [2024-11-19 22:55:38,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 22:55:38,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:38,869 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] [2024-11-19 22:55:38,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 22:55:38,870 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:38,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:38,870 INFO L85 PathProgramCache]: Analyzing trace with hash -306680341, now seen corresponding path program 1 times [2024-11-19 22:55:38,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:38,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995920290] [2024-11-19 22:55:38,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:38,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:39,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:39,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:39,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995920290] [2024-11-19 22:55:39,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995920290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:39,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:39,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:39,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058801680] [2024-11-19 22:55:39,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:39,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:39,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:39,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:39,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:39,124 INFO L87 Difference]: Start difference. First operand 394 states and 493 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:39,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:39,740 INFO L93 Difference]: Finished difference Result 643 states and 819 transitions. [2024-11-19 22:55:39,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:39,740 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-19 22:55:39,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:39,741 INFO L225 Difference]: With dead ends: 643 [2024-11-19 22:55:39,742 INFO L226 Difference]: Without dead ends: 577 [2024-11-19 22:55:39,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:39,742 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 2409 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2409 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:39,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2409 Valid, 1360 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:39,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-19 22:55:39,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 394. [2024-11-19 22:55:39,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.3015873015873016) internal successors, (492), 393 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 492 transitions. [2024-11-19 22:55:39,749 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 492 transitions. Word has length 80 [2024-11-19 22:55:39,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:39,750 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 492 transitions. [2024-11-19 22:55:39,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:39,750 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 492 transitions. [2024-11-19 22:55:39,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 22:55:39,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:39,751 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:39,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 22:55:39,751 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:39,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:39,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1961273491, now seen corresponding path program 1 times [2024-11-19 22:55:39,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:39,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096103038] [2024-11-19 22:55:39,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:39,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:40,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:40,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:40,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096103038] [2024-11-19 22:55:40,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096103038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:40,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:40,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:40,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608357411] [2024-11-19 22:55:40,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:40,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:40,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:40,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:40,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:40,031 INFO L87 Difference]: Start difference. First operand 394 states and 492 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:40,651 INFO L93 Difference]: Finished difference Result 641 states and 815 transitions. [2024-11-19 22:55:40,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:40,652 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-19 22:55:40,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:40,653 INFO L225 Difference]: With dead ends: 641 [2024-11-19 22:55:40,653 INFO L226 Difference]: Without dead ends: 577 [2024-11-19 22:55:40,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:55:40,654 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 2158 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2158 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:40,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2158 Valid, 1664 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:40,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-19 22:55:40,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 394. [2024-11-19 22:55:40,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.2989417989417988) internal successors, (491), 393 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:40,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 491 transitions. [2024-11-19 22:55:40,661 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 491 transitions. Word has length 80 [2024-11-19 22:55:40,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:40,661 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 491 transitions. [2024-11-19 22:55:40,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:40,662 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 491 transitions. [2024-11-19 22:55:40,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 22:55:40,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:40,663 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] [2024-11-19 22:55:40,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 22:55:40,663 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:40,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:40,663 INFO L85 PathProgramCache]: Analyzing trace with hash 601853245, now seen corresponding path program 1 times [2024-11-19 22:55:40,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:40,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442019245] [2024-11-19 22:55:40,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:40,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:40,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:40,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442019245] [2024-11-19 22:55:40,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442019245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:40,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:40,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:40,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888247536] [2024-11-19 22:55:40,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:40,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:40,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:40,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:40,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:40,955 INFO L87 Difference]: Start difference. First operand 394 states and 491 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:41,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:41,599 INFO L93 Difference]: Finished difference Result 646 states and 819 transitions. [2024-11-19 22:55:41,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:41,600 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-19 22:55:41,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:41,602 INFO L225 Difference]: With dead ends: 646 [2024-11-19 22:55:41,602 INFO L226 Difference]: Without dead ends: 577 [2024-11-19 22:55:41,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:55:41,602 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 2152 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:41,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2152 Valid, 1668 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:41,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-19 22:55:41,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 394. [2024-11-19 22:55:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.2962962962962963) internal successors, (490), 393 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 490 transitions. [2024-11-19 22:55:41,609 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 490 transitions. Word has length 80 [2024-11-19 22:55:41,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:41,615 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 490 transitions. [2024-11-19 22:55:41,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:41,615 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 490 transitions. [2024-11-19 22:55:41,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 22:55:41,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:41,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:41,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 22:55:41,617 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:41,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:41,617 INFO L85 PathProgramCache]: Analyzing trace with hash -953833721, now seen corresponding path program 1 times [2024-11-19 22:55:41,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:41,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083497182] [2024-11-19 22:55:41,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:41,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:42,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:42,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083497182] [2024-11-19 22:55:42,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083497182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:42,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:42,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 22:55:42,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760914933] [2024-11-19 22:55:42,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:42,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:55:42,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:42,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:55:42,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:55:42,076 INFO L87 Difference]: Start difference. First operand 394 states and 490 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:43,180 INFO L93 Difference]: Finished difference Result 955 states and 1265 transitions. [2024-11-19 22:55:43,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 22:55:43,180 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-19 22:55:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:43,183 INFO L225 Difference]: With dead ends: 955 [2024-11-19 22:55:43,184 INFO L226 Difference]: Without dead ends: 851 [2024-11-19 22:55:43,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-19 22:55:43,185 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 4154 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4154 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:43,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4154 Valid, 2006 Invalid, 1664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 22:55:43,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2024-11-19 22:55:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 398. [2024-11-19 22:55:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 382 states have (on average 1.293193717277487) internal successors, (494), 397 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:43,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 494 transitions. [2024-11-19 22:55:43,196 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 494 transitions. Word has length 80 [2024-11-19 22:55:43,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:43,196 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 494 transitions. [2024-11-19 22:55:43,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 494 transitions. [2024-11-19 22:55:43,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 22:55:43,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:43,197 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] [2024-11-19 22:55:43,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 22:55:43,198 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:43,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:43,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1702835234, now seen corresponding path program 1 times [2024-11-19 22:55:43,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:43,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085665393] [2024-11-19 22:55:43,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:43,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:43,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:43,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085665393] [2024-11-19 22:55:43,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085665393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:43,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:43,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:43,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87407310] [2024-11-19 22:55:43,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:43,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:43,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:43,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:43,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:43,498 INFO L87 Difference]: Start difference. First operand 398 states and 494 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:44,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:44,128 INFO L93 Difference]: Finished difference Result 586 states and 726 transitions. [2024-11-19 22:55:44,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:44,128 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-19 22:55:44,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:44,130 INFO L225 Difference]: With dead ends: 586 [2024-11-19 22:55:44,130 INFO L226 Difference]: Without dead ends: 581 [2024-11-19 22:55:44,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:55:44,131 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 2148 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2148 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:44,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2148 Valid, 1668 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-19 22:55:44,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 398. [2024-11-19 22:55:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 382 states have (on average 1.2905759162303665) internal successors, (493), 397 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 493 transitions. [2024-11-19 22:55:44,137 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 493 transitions. Word has length 80 [2024-11-19 22:55:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:44,137 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 493 transitions. [2024-11-19 22:55:44,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 493 transitions. [2024-11-19 22:55:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 22:55:44,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:44,138 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] [2024-11-19 22:55:44,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 22:55:44,138 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:44,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash 209361868, now seen corresponding path program 1 times [2024-11-19 22:55:44,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:44,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125657652] [2024-11-19 22:55:44,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:44,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:44,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:44,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125657652] [2024-11-19 22:55:44,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125657652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:44,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:44,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 22:55:44,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019753645] [2024-11-19 22:55:44,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:44,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:55:44,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:44,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:55:44,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:55:44,574 INFO L87 Difference]: Start difference. First operand 398 states and 493 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:45,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:45,493 INFO L93 Difference]: Finished difference Result 820 states and 1064 transitions. [2024-11-19 22:55:45,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 22:55:45,494 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-19 22:55:45,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:45,496 INFO L225 Difference]: With dead ends: 820 [2024-11-19 22:55:45,496 INFO L226 Difference]: Without dead ends: 803 [2024-11-19 22:55:45,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-19 22:55:45,496 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 3948 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3948 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:45,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3948 Valid, 1623 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 22:55:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2024-11-19 22:55:45,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 402. [2024-11-19 22:55:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 386 states have (on average 1.2875647668393781) internal successors, (497), 401 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:45,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 497 transitions. [2024-11-19 22:55:45,502 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 497 transitions. Word has length 80 [2024-11-19 22:55:45,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:45,503 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 497 transitions. [2024-11-19 22:55:45,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:45,503 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 497 transitions. [2024-11-19 22:55:45,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 22:55:45,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:45,504 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] [2024-11-19 22:55:45,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 22:55:45,504 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:45,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:45,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1191963760, now seen corresponding path program 1 times [2024-11-19 22:55:45,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:45,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832317951] [2024-11-19 22:55:45,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:45,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:45,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:45,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:45,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832317951] [2024-11-19 22:55:45,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832317951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:45,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:45,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:45,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703817039] [2024-11-19 22:55:45,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:45,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:45,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:45,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:45,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:45,788 INFO L87 Difference]: Start difference. First operand 402 states and 497 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:46,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:46,389 INFO L93 Difference]: Finished difference Result 651 states and 822 transitions. [2024-11-19 22:55:46,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:46,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-19 22:55:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:46,391 INFO L225 Difference]: With dead ends: 651 [2024-11-19 22:55:46,391 INFO L226 Difference]: Without dead ends: 585 [2024-11-19 22:55:46,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:55:46,392 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 2145 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2145 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:46,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2145 Valid, 1668 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:46,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-19 22:55:46,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 402. [2024-11-19 22:55:46,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 386 states have (on average 1.2849740932642486) internal successors, (496), 401 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:46,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 496 transitions. [2024-11-19 22:55:46,398 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 496 transitions. Word has length 80 [2024-11-19 22:55:46,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:46,399 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 496 transitions. [2024-11-19 22:55:46,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:46,399 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 496 transitions. [2024-11-19 22:55:46,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 22:55:46,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:46,400 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] [2024-11-19 22:55:46,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 22:55:46,401 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:46,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:46,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1836995487, now seen corresponding path program 1 times [2024-11-19 22:55:46,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:46,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874047489] [2024-11-19 22:55:46,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:46,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:46,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:46,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874047489] [2024-11-19 22:55:46,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874047489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:46,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:46,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:46,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351656973] [2024-11-19 22:55:46,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:46,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:46,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:46,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:46,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:46,635 INFO L87 Difference]: Start difference. First operand 402 states and 496 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:47,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:47,196 INFO L93 Difference]: Finished difference Result 590 states and 728 transitions. [2024-11-19 22:55:47,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:47,196 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-19 22:55:47,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:47,198 INFO L225 Difference]: With dead ends: 590 [2024-11-19 22:55:47,198 INFO L226 Difference]: Without dead ends: 585 [2024-11-19 22:55:47,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:47,199 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 2388 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2388 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:47,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2388 Valid, 1360 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:55:47,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-19 22:55:47,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 402. [2024-11-19 22:55:47,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 386 states have (on average 1.282383419689119) internal successors, (495), 401 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:47,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 495 transitions. [2024-11-19 22:55:47,206 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 495 transitions. Word has length 80 [2024-11-19 22:55:47,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:47,206 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 495 transitions. [2024-11-19 22:55:47,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:47,206 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 495 transitions. [2024-11-19 22:55:47,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 22:55:47,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:47,207 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] [2024-11-19 22:55:47,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 22:55:47,208 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:47,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:47,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1478263256, now seen corresponding path program 1 times [2024-11-19 22:55:47,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:47,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910567874] [2024-11-19 22:55:47,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:47,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:47,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:47,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:47,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910567874] [2024-11-19 22:55:47,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910567874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:47,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:47,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:47,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754818745] [2024-11-19 22:55:47,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:47,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:47,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:47,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:47,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:47,452 INFO L87 Difference]: Start difference. First operand 402 states and 495 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:48,080 INFO L93 Difference]: Finished difference Result 654 states and 822 transitions. [2024-11-19 22:55:48,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:48,080 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-19 22:55:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:48,082 INFO L225 Difference]: With dead ends: 654 [2024-11-19 22:55:48,082 INFO L226 Difference]: Without dead ends: 585 [2024-11-19 22:55:48,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:48,083 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 1770 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1770 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:48,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1770 Valid, 1376 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:48,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-19 22:55:48,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 398. [2024-11-19 22:55:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 382 states have (on average 1.2827225130890052) internal successors, (490), 397 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 490 transitions. [2024-11-19 22:55:48,089 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 490 transitions. Word has length 81 [2024-11-19 22:55:48,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:48,089 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 490 transitions. [2024-11-19 22:55:48,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 490 transitions. [2024-11-19 22:55:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 22:55:48,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:48,090 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] [2024-11-19 22:55:48,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 22:55:48,090 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:48,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:48,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1829127868, now seen corresponding path program 1 times [2024-11-19 22:55:48,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:48,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993807181] [2024-11-19 22:55:48,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:48,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:48,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:48,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993807181] [2024-11-19 22:55:48,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993807181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:48,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:48,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:48,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571781695] [2024-11-19 22:55:48,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:48,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:48,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:48,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:48,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:48,376 INFO L87 Difference]: Start difference. First operand 398 states and 490 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:49,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:49,053 INFO L93 Difference]: Finished difference Result 709 states and 899 transitions. [2024-11-19 22:55:49,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:49,053 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-19 22:55:49,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:49,055 INFO L225 Difference]: With dead ends: 709 [2024-11-19 22:55:49,055 INFO L226 Difference]: Without dead ends: 605 [2024-11-19 22:55:49,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2024-11-19 22:55:49,056 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 1984 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1984 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:49,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1984 Valid, 1850 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:49,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-19 22:55:49,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 394. [2024-11-19 22:55:49,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.283068783068783) internal successors, (485), 393 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 485 transitions. [2024-11-19 22:55:49,064 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 485 transitions. Word has length 81 [2024-11-19 22:55:49,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:49,064 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 485 transitions. [2024-11-19 22:55:49,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:49,065 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 485 transitions. [2024-11-19 22:55:49,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 22:55:49,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:49,066 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] [2024-11-19 22:55:49,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 22:55:49,066 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:49,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:49,067 INFO L85 PathProgramCache]: Analyzing trace with hash -53380691, now seen corresponding path program 1 times [2024-11-19 22:55:49,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:49,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312657055] [2024-11-19 22:55:49,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:49,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:49,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:49,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312657055] [2024-11-19 22:55:49,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312657055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:49,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:49,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:49,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296473647] [2024-11-19 22:55:49,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:49,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:49,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:49,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:49,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:49,304 INFO L87 Difference]: Start difference. First operand 394 states and 485 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:49,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:49,869 INFO L93 Difference]: Finished difference Result 610 states and 755 transitions. [2024-11-19 22:55:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:49,869 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-19 22:55:49,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:49,871 INFO L225 Difference]: With dead ends: 610 [2024-11-19 22:55:49,871 INFO L226 Difference]: Without dead ends: 593 [2024-11-19 22:55:49,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2024-11-19 22:55:49,872 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 2204 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2204 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:49,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2204 Valid, 1651 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:55:49,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-11-19 22:55:49,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 390. [2024-11-19 22:55:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.2834224598930482) internal successors, (480), 389 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 480 transitions. [2024-11-19 22:55:49,878 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 480 transitions. Word has length 81 [2024-11-19 22:55:49,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:49,878 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 480 transitions. [2024-11-19 22:55:49,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 480 transitions. [2024-11-19 22:55:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 22:55:49,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:49,879 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] [2024-11-19 22:55:49,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 22:55:49,880 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:49,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:49,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1125287833, now seen corresponding path program 1 times [2024-11-19 22:55:49,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:49,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789048431] [2024-11-19 22:55:49,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:49,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:50,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:50,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:50,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789048431] [2024-11-19 22:55:50,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789048431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:50,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:50,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 22:55:50,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491851475] [2024-11-19 22:55:50,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:50,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 22:55:50,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:50,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 22:55:50,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-19 22:55:50,445 INFO L87 Difference]: Start difference. First operand 390 states and 480 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:51,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:51,328 INFO L93 Difference]: Finished difference Result 972 states and 1227 transitions. [2024-11-19 22:55:51,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:55:51,328 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-19 22:55:51,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:51,330 INFO L225 Difference]: With dead ends: 972 [2024-11-19 22:55:51,330 INFO L226 Difference]: Without dead ends: 901 [2024-11-19 22:55:51,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-11-19 22:55:51,331 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 2266 mSDsluCounter, 5785 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2266 SdHoareTripleChecker+Valid, 6666 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:51,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2266 Valid, 6666 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:51,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2024-11-19 22:55:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 383. [2024-11-19 22:55:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 367 states have (on average 1.2806539509536785) internal successors, (470), 382 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 470 transitions. [2024-11-19 22:55:51,336 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 470 transitions. Word has length 82 [2024-11-19 22:55:51,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:51,337 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 470 transitions. [2024-11-19 22:55:51,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 470 transitions. [2024-11-19 22:55:51,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 22:55:51,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:51,337 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] [2024-11-19 22:55:51,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 22:55:51,338 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:51,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:51,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1735705855, now seen corresponding path program 1 times [2024-11-19 22:55:51,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:51,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684104156] [2024-11-19 22:55:51,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:51,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:51,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:51,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:51,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684104156] [2024-11-19 22:55:51,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684104156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:51,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:51,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 22:55:51,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416457636] [2024-11-19 22:55:51,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:51,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:55:51,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:51,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:55:51,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:55:51,855 INFO L87 Difference]: Start difference. First operand 383 states and 470 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:52,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:52,486 INFO L93 Difference]: Finished difference Result 632 states and 804 transitions. [2024-11-19 22:55:52,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:55:52,487 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-19 22:55:52,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:52,488 INFO L225 Difference]: With dead ends: 632 [2024-11-19 22:55:52,488 INFO L226 Difference]: Without dead ends: 551 [2024-11-19 22:55:52,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-19 22:55:52,489 INFO L432 NwaCegarLoop]: 604 mSDtfsCounter, 2190 mSDsluCounter, 2750 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2190 SdHoareTripleChecker+Valid, 3354 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:52,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2190 Valid, 3354 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:55:52,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-19 22:55:52,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 366. [2024-11-19 22:55:52,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 351 states have (on average 1.2792022792022792) internal successors, (449), 365 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:52,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 449 transitions. [2024-11-19 22:55:52,494 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 449 transitions. Word has length 82 [2024-11-19 22:55:52,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:52,494 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 449 transitions. [2024-11-19 22:55:52,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:52,494 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 449 transitions. [2024-11-19 22:55:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 22:55:52,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:52,495 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] [2024-11-19 22:55:52,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-19 22:55:52,499 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:52,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:52,501 INFO L85 PathProgramCache]: Analyzing trace with hash -941970822, now seen corresponding path program 1 times [2024-11-19 22:55:52,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:52,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204401703] [2024-11-19 22:55:52,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:52,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:53,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:53,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:53,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204401703] [2024-11-19 22:55:53,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204401703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:53,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:53,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 22:55:53,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903963972] [2024-11-19 22:55:53,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:53,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 22:55:53,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:53,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 22:55:53,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-19 22:55:53,092 INFO L87 Difference]: Start difference. First operand 366 states and 449 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:54,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:54,341 INFO L93 Difference]: Finished difference Result 851 states and 1057 transitions. [2024-11-19 22:55:54,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 22:55:54,342 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-19 22:55:54,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:54,344 INFO L225 Difference]: With dead ends: 851 [2024-11-19 22:55:54,344 INFO L226 Difference]: Without dead ends: 783 [2024-11-19 22:55:54,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-11-19 22:55:54,344 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 2823 mSDsluCounter, 3148 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2823 SdHoareTripleChecker+Valid, 3656 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:54,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2823 Valid, 3656 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 22:55:54,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-11-19 22:55:54,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 362. [2024-11-19 22:55:54,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 348 states have (on average 1.2758620689655173) internal successors, (444), 361 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:54,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 444 transitions. [2024-11-19 22:55:54,349 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 444 transitions. Word has length 82 [2024-11-19 22:55:54,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:54,350 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 444 transitions. [2024-11-19 22:55:54,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:54,350 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 444 transitions. [2024-11-19 22:55:54,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 22:55:54,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:54,351 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:54,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 22:55:54,351 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:54,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:54,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1572479326, now seen corresponding path program 1 times [2024-11-19 22:55:54,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:54,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901101899] [2024-11-19 22:55:54,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:54,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:54,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:54,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901101899] [2024-11-19 22:55:54,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901101899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:54,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:54,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 22:55:54,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410048265] [2024-11-19 22:55:54,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:54,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 22:55:54,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:54,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 22:55:54,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:55:54,906 INFO L87 Difference]: Start difference. First operand 362 states and 444 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:55,583 INFO L93 Difference]: Finished difference Result 871 states and 1095 transitions. [2024-11-19 22:55:55,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:55,583 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-19 22:55:55,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:55,585 INFO L225 Difference]: With dead ends: 871 [2024-11-19 22:55:55,585 INFO L226 Difference]: Without dead ends: 718 [2024-11-19 22:55:55,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-19 22:55:55,586 INFO L432 NwaCegarLoop]: 545 mSDtfsCounter, 1580 mSDsluCounter, 2392 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 2937 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:55,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 2937 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:55:55,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-11-19 22:55:55,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 273. [2024-11-19 22:55:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 262 states have (on average 1.2709923664122138) internal successors, (333), 272 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:55,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 333 transitions. [2024-11-19 22:55:55,590 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 333 transitions. Word has length 82 [2024-11-19 22:55:55,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:55,590 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 333 transitions. [2024-11-19 22:55:55,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:55,591 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 333 transitions. [2024-11-19 22:55:55,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 22:55:55,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:55,591 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] [2024-11-19 22:55:55,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-19 22:55:55,592 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:55,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:55,592 INFO L85 PathProgramCache]: Analyzing trace with hash 996849594, now seen corresponding path program 1 times [2024-11-19 22:55:55,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:55,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608091112] [2024-11-19 22:55:55,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:55,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:56,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:56,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608091112] [2024-11-19 22:55:56,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608091112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:56,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:56,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 22:55:56,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732365764] [2024-11-19 22:55:56,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:56,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:55:56,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:56,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:55:56,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:55:56,146 INFO L87 Difference]: Start difference. First operand 273 states and 333 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:56,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:56,712 INFO L93 Difference]: Finished difference Result 448 states and 579 transitions. [2024-11-19 22:55:56,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:55:56,712 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-19 22:55:56,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:56,714 INFO L225 Difference]: With dead ends: 448 [2024-11-19 22:55:56,714 INFO L226 Difference]: Without dead ends: 351 [2024-11-19 22:55:56,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-19 22:55:56,715 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 1394 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 2056 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:56,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1394 Valid, 2056 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:55:56,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-19 22:55:56,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 240. [2024-11-19 22:55:56,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 232 states have (on average 1.2629310344827587) internal successors, (293), 239 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 293 transitions. [2024-11-19 22:55:56,719 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 293 transitions. Word has length 82 [2024-11-19 22:55:56,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:56,720 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 293 transitions. [2024-11-19 22:55:56,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:56,720 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 293 transitions. [2024-11-19 22:55:56,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 22:55:56,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:56,721 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] [2024-11-19 22:55:56,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-19 22:55:56,721 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:56,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:56,722 INFO L85 PathProgramCache]: Analyzing trace with hash 504555190, now seen corresponding path program 1 times [2024-11-19 22:55:56,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:56,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789731180] [2024-11-19 22:55:56,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:56,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:58,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:58,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:58,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789731180] [2024-11-19 22:55:58,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789731180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:58,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:58,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2024-11-19 22:55:58,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883228533] [2024-11-19 22:55:58,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:58,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 22:55:58,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:58,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 22:55:58,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2024-11-19 22:55:58,411 INFO L87 Difference]: Start difference. First operand 240 states and 293 transitions. Second operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:56:02,320 INFO L93 Difference]: Finished difference Result 886 states and 1143 transitions. [2024-11-19 22:56:02,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-19 22:56:02,320 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-19 22:56:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:56:02,322 INFO L225 Difference]: With dead ends: 886 [2024-11-19 22:56:02,322 INFO L226 Difference]: Without dead ends: 818 [2024-11-19 22:56:02,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=434, Invalid=2322, Unknown=0, NotChecked=0, Total=2756 [2024-11-19 22:56:02,324 INFO L432 NwaCegarLoop]: 694 mSDtfsCounter, 2371 mSDsluCounter, 9994 mSDsCounter, 0 mSdLazyCounter, 5656 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2371 SdHoareTripleChecker+Valid, 10688 SdHoareTripleChecker+Invalid, 5672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 22:56:02,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2371 Valid, 10688 Invalid, 5672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 5656 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-19 22:56:02,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-11-19 22:56:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 260. [2024-11-19 22:56:02,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 252 states have (on average 1.2698412698412698) internal successors, (320), 259 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 320 transitions. [2024-11-19 22:56:02,330 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 320 transitions. Word has length 82 [2024-11-19 22:56:02,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:56:02,331 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 320 transitions. [2024-11-19 22:56:02,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:02,331 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 320 transitions. [2024-11-19 22:56:02,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 22:56:02,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:02,331 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] [2024-11-19 22:56:02,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-19 22:56:02,332 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:56:02,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:02,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1900616581, now seen corresponding path program 1 times [2024-11-19 22:56:02,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:02,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950931927] [2024-11-19 22:56:02,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:02,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:56:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:56:02,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:56:02,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:56:02,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950931927] [2024-11-19 22:56:02,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950931927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:56:02,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:56:02,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 22:56:02,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170076773] [2024-11-19 22:56:02,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:56:02,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:56:02,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:56:02,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:56:02,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:56:02,819 INFO L87 Difference]: Start difference. First operand 260 states and 320 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:03,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:56:03,287 INFO L93 Difference]: Finished difference Result 436 states and 567 transitions. [2024-11-19 22:56:03,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:56:03,288 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-19 22:56:03,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:56:03,289 INFO L225 Difference]: With dead ends: 436 [2024-11-19 22:56:03,289 INFO L226 Difference]: Without dead ends: 309 [2024-11-19 22:56:03,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-11-19 22:56:03,290 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 1048 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:56:03,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1653 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:56:03,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-19 22:56:03,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 197. [2024-11-19 22:56:03,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 193 states have (on average 1.2694300518134716) internal successors, (245), 196 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:03,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 245 transitions. [2024-11-19 22:56:03,294 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 245 transitions. Word has length 82 [2024-11-19 22:56:03,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:56:03,294 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 245 transitions. [2024-11-19 22:56:03,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:03,295 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 245 transitions. [2024-11-19 22:56:03,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-19 22:56:03,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:03,295 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] [2024-11-19 22:56:03,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-19 22:56:03,296 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:56:03,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:03,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1724267320, now seen corresponding path program 1 times [2024-11-19 22:56:03,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:03,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871734627] [2024-11-19 22:56:03,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:03,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:56:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:56:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:56:03,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:56:03,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871734627] [2024-11-19 22:56:03,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871734627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:56:03,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:56:03,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 22:56:03,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463645378] [2024-11-19 22:56:03,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:56:03,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:56:03,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:56:03,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:56:03,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:56:03,778 INFO L87 Difference]: Start difference. First operand 197 states and 245 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:04,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:56:04,250 INFO L93 Difference]: Finished difference Result 350 states and 465 transitions. [2024-11-19 22:56:04,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:56:04,251 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-19 22:56:04,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:56:04,251 INFO L225 Difference]: With dead ends: 350 [2024-11-19 22:56:04,251 INFO L226 Difference]: Without dead ends: 266 [2024-11-19 22:56:04,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-11-19 22:56:04,252 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 813 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:56:04,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1536 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:56:04,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-19 22:56:04,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 161. [2024-11-19 22:56:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 159 states have (on average 1.251572327044025) internal successors, (199), 160 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 199 transitions. [2024-11-19 22:56:04,255 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 199 transitions. Word has length 83 [2024-11-19 22:56:04,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:56:04,256 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 199 transitions. [2024-11-19 22:56:04,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2024-11-19 22:56:04,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-19 22:56:04,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:04,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:56:04,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-19 22:56:04,256 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:56:04,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:04,257 INFO L85 PathProgramCache]: Analyzing trace with hash -892730834, now seen corresponding path program 1 times [2024-11-19 22:56:04,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:04,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183806020] [2024-11-19 22:56:04,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:04,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:56:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:56:04,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:56:04,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:56:04,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183806020] [2024-11-19 22:56:04,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183806020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:56:04,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:56:04,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:56:04,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797204403] [2024-11-19 22:56:04,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:56:04,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:56:04,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:56:04,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:56:04,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:56:04,463 INFO L87 Difference]: Start difference. First operand 161 states and 199 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:04,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:56:04,790 INFO L93 Difference]: Finished difference Result 334 states and 440 transitions. [2024-11-19 22:56:04,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:56:04,791 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-19 22:56:04,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:56:04,792 INFO L225 Difference]: With dead ends: 334 [2024-11-19 22:56:04,792 INFO L226 Difference]: Without dead ends: 252 [2024-11-19 22:56:04,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:56:04,793 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 568 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:56:04,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 764 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:56:04,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-19 22:56:04,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 161. [2024-11-19 22:56:04,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 159 states have (on average 1.2452830188679245) internal successors, (198), 160 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:04,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 198 transitions. [2024-11-19 22:56:04,795 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 198 transitions. Word has length 83 [2024-11-19 22:56:04,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:56:04,796 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 198 transitions. [2024-11-19 22:56:04,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:04,796 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 198 transitions. [2024-11-19 22:56:04,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 22:56:04,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:04,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:56:04,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-19 22:56:04,797 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:56:04,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:04,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1767300528, now seen corresponding path program 1 times [2024-11-19 22:56:04,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:04,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661065926] [2024-11-19 22:56:04,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:04,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:56:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:56:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:56:06,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:56:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661065926] [2024-11-19 22:56:06,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661065926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:56:06,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:56:06,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-11-19 22:56:06,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165166615] [2024-11-19 22:56:06,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:56:06,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 22:56:06,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:56:06,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 22:56:06,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2024-11-19 22:56:06,226 INFO L87 Difference]: Start difference. First operand 161 states and 198 transitions. Second operand has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:56:09,329 INFO L93 Difference]: Finished difference Result 624 states and 834 transitions. [2024-11-19 22:56:09,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-19 22:56:09,330 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-19 22:56:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:56:09,331 INFO L225 Difference]: With dead ends: 624 [2024-11-19 22:56:09,331 INFO L226 Difference]: Without dead ends: 618 [2024-11-19 22:56:09,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=426, Invalid=2124, Unknown=0, NotChecked=0, Total=2550 [2024-11-19 22:56:09,333 INFO L432 NwaCegarLoop]: 545 mSDtfsCounter, 1417 mSDsluCounter, 8008 mSDsCounter, 0 mSdLazyCounter, 4319 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 8553 SdHoareTripleChecker+Invalid, 4331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 4319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:56:09,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1417 Valid, 8553 Invalid, 4331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 4319 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-19 22:56:09,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-19 22:56:09,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 182. [2024-11-19 22:56:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 180 states have (on average 1.2444444444444445) internal successors, (224), 181 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 224 transitions. [2024-11-19 22:56:09,336 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 224 transitions. Word has length 85 [2024-11-19 22:56:09,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:56:09,337 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 224 transitions. [2024-11-19 22:56:09,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 224 transitions. [2024-11-19 22:56:09,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 22:56:09,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:09,337 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:56:09,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-19 22:56:09,338 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:56:09,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:09,338 INFO L85 PathProgramCache]: Analyzing trace with hash -424299778, now seen corresponding path program 1 times [2024-11-19 22:56:09,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:09,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424687909] [2024-11-19 22:56:09,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:09,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:56:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:56:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:56:09,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:56:09,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424687909] [2024-11-19 22:56:09,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424687909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:56:09,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:56:09,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 22:56:09,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983406508] [2024-11-19 22:56:09,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:56:09,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:56:09,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:56:09,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:56:09,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:56:09,784 INFO L87 Difference]: Start difference. First operand 182 states and 224 transitions. Second operand has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:10,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:56:10,154 INFO L93 Difference]: Finished difference Result 259 states and 335 transitions. [2024-11-19 22:56:10,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:56:10,154 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-19 22:56:10,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:56:10,155 INFO L225 Difference]: With dead ends: 259 [2024-11-19 22:56:10,155 INFO L226 Difference]: Without dead ends: 253 [2024-11-19 22:56:10,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2024-11-19 22:56:10,156 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 392 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:56:10,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1660 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:56:10,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-19 22:56:10,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 155. [2024-11-19 22:56:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.2467532467532467) internal successors, (192), 154 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 192 transitions. [2024-11-19 22:56:10,159 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 192 transitions. Word has length 86 [2024-11-19 22:56:10,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:56:10,159 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 192 transitions. [2024-11-19 22:56:10,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:10,159 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 192 transitions. [2024-11-19 22:56:10,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 22:56:10,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:10,160 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-11-19 22:56:10,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-19 22:56:10,160 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:56:10,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:10,161 INFO L85 PathProgramCache]: Analyzing trace with hash 529887998, now seen corresponding path program 1 times [2024-11-19 22:56:10,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:10,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528931979] [2024-11-19 22:56:10,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:10,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:56:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:56:10,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:56:10,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:56:10,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528931979] [2024-11-19 22:56:10,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528931979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:56:10,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:56:10,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:56:10,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430581976] [2024-11-19 22:56:10,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:56:10,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:56:10,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:56:10,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:56:10,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:56:10,296 INFO L87 Difference]: Start difference. First operand 155 states and 192 transitions. Second operand has 7 states, 7 states have (on average 16.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-11-19 22:56:10,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:56:10,418 INFO L93 Difference]: Finished difference Result 795 states and 1142 transitions. [2024-11-19 22:56:10,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 22:56:10,418 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.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-11-19 22:56:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:56:10,420 INFO L225 Difference]: With dead ends: 795 [2024-11-19 22:56:10,420 INFO L226 Difference]: Without dead ends: 731 [2024-11-19 22:56:10,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-19 22:56:10,421 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1483 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:56:10,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 1527 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:56:10,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-11-19 22:56:10,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 217. [2024-11-19 22:56:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.3148148148148149) internal successors, (284), 216 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 284 transitions. [2024-11-19 22:56:10,426 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 284 transitions. Word has length 112 [2024-11-19 22:56:10,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:56:10,426 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 284 transitions. [2024-11-19 22:56:10,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.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-11-19 22:56:10,426 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 284 transitions. [2024-11-19 22:56:10,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 22:56:10,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:10,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, 1, 1, 1] [2024-11-19 22:56:10,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-19 22:56:10,427 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:56:10,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:10,427 INFO L85 PathProgramCache]: Analyzing trace with hash 257111127, now seen corresponding path program 1 times [2024-11-19 22:56:10,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:10,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100441498] [2024-11-19 22:56:10,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:10,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:56:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:56:10,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:56:10,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:56:10,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100441498] [2024-11-19 22:56:10,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100441498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:56:10,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:56:10,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:56:10,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469262548] [2024-11-19 22:56:10,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:56:10,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:56:10,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:56:10,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:56:10,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:56:10,564 INFO L87 Difference]: Start difference. First operand 217 states and 284 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:10,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:56:10,664 INFO L93 Difference]: Finished difference Result 911 states and 1312 transitions. [2024-11-19 22:56:10,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:56:10,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-11-19 22:56:10,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:56:10,667 INFO L225 Difference]: With dead ends: 911 [2024-11-19 22:56:10,668 INFO L226 Difference]: Without dead ends: 785 [2024-11-19 22:56:10,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:56:10,669 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 1186 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:56:10,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 940 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:56:10,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-19 22:56:10,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 341. [2024-11-19 22:56:10,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.3794117647058823) internal successors, (469), 340 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:10,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 469 transitions. [2024-11-19 22:56:10,675 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 469 transitions. Word has length 114 [2024-11-19 22:56:10,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:56:10,675 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 469 transitions. [2024-11-19 22:56:10,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:10,676 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 469 transitions. [2024-11-19 22:56:10,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 22:56:10,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:10,676 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, 1] [2024-11-19 22:56:10,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-19 22:56:10,677 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:56:10,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:10,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1982497248, now seen corresponding path program 1 times [2024-11-19 22:56:10,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:10,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260653023] [2024-11-19 22:56:10,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:10,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:56:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:56:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:56:10,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:56:10,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260653023] [2024-11-19 22:56:10,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260653023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:56:10,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:56:10,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:56:10,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372351646] [2024-11-19 22:56:10,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:56:10,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:56:10,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:56:10,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:56:10,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:56:10,901 INFO L87 Difference]: Start difference. First operand 341 states and 469 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:11,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:56:11,032 INFO L93 Difference]: Finished difference Result 593 states and 842 transitions. [2024-11-19 22:56:11,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:56:11,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-11-19 22:56:11,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:56:11,034 INFO L225 Difference]: With dead ends: 593 [2024-11-19 22:56:11,038 INFO L226 Difference]: Without dead ends: 343 [2024-11-19 22:56:11,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-19 22:56:11,039 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 399 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:56:11,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 546 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:56:11,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-19 22:56:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2024-11-19 22:56:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.3735294117647059) internal successors, (467), 340 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 467 transitions. [2024-11-19 22:56:11,044 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 467 transitions. Word has length 114 [2024-11-19 22:56:11,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:56:11,044 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 467 transitions. [2024-11-19 22:56:11,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:11,044 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 467 transitions. [2024-11-19 22:56:11,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 22:56:11,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:11,047 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, 1] [2024-11-19 22:56:11,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-19 22:56:11,048 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:56:11,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:11,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1242756927, now seen corresponding path program 1 times [2024-11-19 22:56:11,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:11,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793766170] [2024-11-19 22:56:11,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:11,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:56:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:56:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:56:11,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:56:11,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793766170] [2024-11-19 22:56:11,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793766170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:56:11,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:56:11,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:56:11,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256252470] [2024-11-19 22:56:11,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:56:11,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:56:11,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:56:11,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:56:11,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:56:11,112 INFO L87 Difference]: Start difference. First operand 341 states and 467 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:11,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:56:11,140 INFO L93 Difference]: Finished difference Result 815 states and 1163 transitions. [2024-11-19 22:56:11,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:56:11,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-11-19 22:56:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:56:11,142 INFO L225 Difference]: With dead ends: 815 [2024-11-19 22:56:11,146 INFO L226 Difference]: Without dead ends: 565 [2024-11-19 22:56:11,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:56:11,147 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 111 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:56:11,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 306 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:56:11,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-19 22:56:11,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 559. [2024-11-19 22:56:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3942652329749103) internal successors, (778), 558 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 778 transitions. [2024-11-19 22:56:11,156 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 778 transitions. Word has length 114 [2024-11-19 22:56:11,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:56:11,156 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 778 transitions. [2024-11-19 22:56:11,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 778 transitions. [2024-11-19 22:56:11,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 22:56:11,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:11,157 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, 1] [2024-11-19 22:56:11,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-19 22:56:11,157 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:56:11,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:11,158 INFO L85 PathProgramCache]: Analyzing trace with hash 335311913, now seen corresponding path program 1 times [2024-11-19 22:56:11,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:11,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258012109] [2024-11-19 22:56:11,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:11,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:56:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:56:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:56:11,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:56:11,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258012109] [2024-11-19 22:56:11,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258012109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:56:11,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:56:11,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:56:11,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131361320] [2024-11-19 22:56:11,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:56:11,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:56:11,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:56:11,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:56:11,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:56:11,302 INFO L87 Difference]: Start difference. First operand 559 states and 778 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:11,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:56:11,427 INFO L93 Difference]: Finished difference Result 1853 states and 2658 transitions. [2024-11-19 22:56:11,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:56:11,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-11-19 22:56:11,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:56:11,434 INFO L225 Difference]: With dead ends: 1853 [2024-11-19 22:56:11,435 INFO L226 Difference]: Without dead ends: 1618 [2024-11-19 22:56:11,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:56:11,436 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 1109 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:56:11,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 996 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:56:11,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2024-11-19 22:56:11,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 909. [2024-11-19 22:56:11,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 908 states have (on average 1.4162995594713657) internal successors, (1286), 908 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:11,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1286 transitions. [2024-11-19 22:56:11,450 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1286 transitions. Word has length 114 [2024-11-19 22:56:11,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:56:11,450 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1286 transitions. [2024-11-19 22:56:11,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:11,451 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1286 transitions. [2024-11-19 22:56:11,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 22:56:11,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:11,452 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, 1] [2024-11-19 22:56:11,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-19 22:56:11,452 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:56:11,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:11,453 INFO L85 PathProgramCache]: Analyzing trace with hash -784107677, now seen corresponding path program 1 times [2024-11-19 22:56:11,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:11,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563936036] [2024-11-19 22:56:11,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:11,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:56:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:56:11,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:56:11,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:56:11,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563936036] [2024-11-19 22:56:11,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563936036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:56:11,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:56:11,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:56:11,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506055325] [2024-11-19 22:56:11,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:56:11,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:56:11,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:56:11,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:56:11,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:56:11,621 INFO L87 Difference]: Start difference. First operand 909 states and 1286 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:11,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:56:11,715 INFO L93 Difference]: Finished difference Result 2086 states and 2997 transitions. [2024-11-19 22:56:11,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:56:11,715 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-11-19 22:56:11,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:56:11,718 INFO L225 Difference]: With dead ends: 2086 [2024-11-19 22:56:11,722 INFO L226 Difference]: Without dead ends: 1851 [2024-11-19 22:56:11,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:56:11,724 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 1004 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:56:11,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 1061 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:56:11,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2024-11-19 22:56:11,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1142. [2024-11-19 22:56:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1141 states have (on average 1.4241893076248904) internal successors, (1625), 1141 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:11,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1625 transitions. [2024-11-19 22:56:11,738 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1625 transitions. Word has length 114 [2024-11-19 22:56:11,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:56:11,738 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1625 transitions. [2024-11-19 22:56:11,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1625 transitions. [2024-11-19 22:56:11,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 22:56:11,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:11,740 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, 1] [2024-11-19 22:56:11,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-19 22:56:11,740 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:56:11,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:11,741 INFO L85 PathProgramCache]: Analyzing trace with hash -651533795, now seen corresponding path program 1 times [2024-11-19 22:56:11,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:11,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491059297] [2024-11-19 22:56:11,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:11,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:56:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:56:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:56:11,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:56:11,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491059297] [2024-11-19 22:56:11,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491059297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:56:11,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:56:11,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:56:11,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049021718] [2024-11-19 22:56:11,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:56:11,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:56:11,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:56:11,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:56:11,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:56:11,893 INFO L87 Difference]: Start difference. First operand 1142 states and 1625 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:56:11,985 INFO L93 Difference]: Finished difference Result 2319 states and 3336 transitions. [2024-11-19 22:56:11,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:56:11,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-11-19 22:56:11,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:56:11,988 INFO L225 Difference]: With dead ends: 2319 [2024-11-19 22:56:11,988 INFO L226 Difference]: Without dead ends: 2084 [2024-11-19 22:56:11,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:56:11,989 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 1039 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:56:11,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 1107 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:56:11,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2024-11-19 22:56:12,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 1375. [2024-11-19 22:56:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1374 states have (on average 1.4294032023289664) internal successors, (1964), 1374 states have internal predecessors, (1964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:12,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1964 transitions. [2024-11-19 22:56:12,007 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1964 transitions. Word has length 114 [2024-11-19 22:56:12,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:56:12,007 INFO L471 AbstractCegarLoop]: Abstraction has 1375 states and 1964 transitions. [2024-11-19 22:56:12,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:12,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1964 transitions. [2024-11-19 22:56:12,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 22:56:12,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:12,009 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, 1, 1] [2024-11-19 22:56:12,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-19 22:56:12,009 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:56:12,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:12,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1268705059, now seen corresponding path program 1 times [2024-11-19 22:56:12,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:12,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056973693] [2024-11-19 22:56:12,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:12,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:56:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:56:12,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:56:12,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:56:12,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056973693] [2024-11-19 22:56:12,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056973693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:56:12,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:56:12,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:56:12,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624035281] [2024-11-19 22:56:12,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:56:12,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:56:12,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:56:12,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:56:12,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:56:12,119 INFO L87 Difference]: Start difference. First operand 1375 states and 1964 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:12,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:56:12,137 INFO L93 Difference]: Finished difference Result 3855 states and 5544 transitions. [2024-11-19 22:56:12,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:56:12,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-11-19 22:56:12,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:56:12,141 INFO L225 Difference]: With dead ends: 3855 [2024-11-19 22:56:12,141 INFO L226 Difference]: Without dead ends: 2571 [2024-11-19 22:56:12,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:56:12,143 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 89 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:56:12,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 407 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:56:12,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2024-11-19 22:56:12,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2481. [2024-11-19 22:56:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2480 states have (on average 1.429032258064516) internal successors, (3544), 2480 states have internal predecessors, (3544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:12,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3544 transitions. [2024-11-19 22:56:12,173 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3544 transitions. Word has length 115 [2024-11-19 22:56:12,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:56:12,173 INFO L471 AbstractCegarLoop]: Abstraction has 2481 states and 3544 transitions. [2024-11-19 22:56:12,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:12,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3544 transitions. [2024-11-19 22:56:12,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 22:56:12,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:12,175 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, 1, 1, 1] [2024-11-19 22:56:12,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-19 22:56:12,175 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:56:12,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:12,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1444283991, now seen corresponding path program 1 times [2024-11-19 22:56:12,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:12,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12566948] [2024-11-19 22:56:12,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:12,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:56:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:56:12,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:56:12,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:56:12,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12566948] [2024-11-19 22:56:12,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12566948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:56:12,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:56:12,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:56:12,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502152173] [2024-11-19 22:56:12,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:56:12,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:56:12,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:56:12,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:56:12,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:56:12,275 INFO L87 Difference]: Start difference. First operand 2481 states and 3544 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:12,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:56:12,297 INFO L93 Difference]: Finished difference Result 7085 states and 10130 transitions. [2024-11-19 22:56:12,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:56:12,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-11-19 22:56:12,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:56:12,303 INFO L225 Difference]: With dead ends: 7085 [2024-11-19 22:56:12,303 INFO L226 Difference]: Without dead ends: 4695 [2024-11-19 22:56:12,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:56:12,308 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 82 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:56:12,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 407 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:56:12,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4695 states. [2024-11-19 22:56:12,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4695 to 4517. [2024-11-19 22:56:12,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4517 states, 4516 states have (on average 1.421169176262179) internal successors, (6418), 4516 states have internal predecessors, (6418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:12,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4517 states to 4517 states and 6418 transitions. [2024-11-19 22:56:12,373 INFO L78 Accepts]: Start accepts. Automaton has 4517 states and 6418 transitions. Word has length 116 [2024-11-19 22:56:12,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:56:12,373 INFO L471 AbstractCegarLoop]: Abstraction has 4517 states and 6418 transitions. [2024-11-19 22:56:12,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:12,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4517 states and 6418 transitions. [2024-11-19 22:56:12,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 22:56:12,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:12,374 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, 1, 1, 1, 1] [2024-11-19 22:56:12,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-19 22:56:12,374 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:56:12,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:12,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1913447474, now seen corresponding path program 1 times [2024-11-19 22:56:12,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:12,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677231965] [2024-11-19 22:56:12,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:12,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:56:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:56:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:56:12,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:56:12,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677231965] [2024-11-19 22:56:12,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677231965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:56:12,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:56:12,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:56:12,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320032507] [2024-11-19 22:56:12,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:56:12,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:56:12,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:56:12,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:56:12,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:56:12,498 INFO L87 Difference]: Start difference. First operand 4517 states and 6418 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:12,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:56:12,538 INFO L93 Difference]: Finished difference Result 13017 states and 18444 transitions. [2024-11-19 22:56:12,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:56:12,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2024-11-19 22:56:12,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:56:12,553 INFO L225 Difference]: With dead ends: 13017 [2024-11-19 22:56:12,553 INFO L226 Difference]: Without dead ends: 8591 [2024-11-19 22:56:12,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:56:12,562 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 75 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:56:12,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 407 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:56:12,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8591 states. [2024-11-19 22:56:12,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8591 to 8237. [2024-11-19 22:56:12,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8237 states, 8236 states have (on average 1.407722195240408) internal successors, (11594), 8236 states have internal predecessors, (11594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8237 states to 8237 states and 11594 transitions. [2024-11-19 22:56:12,661 INFO L78 Accepts]: Start accepts. Automaton has 8237 states and 11594 transitions. Word has length 117 [2024-11-19 22:56:12,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:56:12,661 INFO L471 AbstractCegarLoop]: Abstraction has 8237 states and 11594 transitions. [2024-11-19 22:56:12,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:12,662 INFO L276 IsEmpty]: Start isEmpty. Operand 8237 states and 11594 transitions. [2024-11-19 22:56:12,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 22:56:12,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:12,662 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, 1, 1, 1, 1, 1] [2024-11-19 22:56:12,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-19 22:56:12,663 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:56:12,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:12,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1786344024, now seen corresponding path program 1 times [2024-11-19 22:56:12,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:12,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297472723] [2024-11-19 22:56:12,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:12,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:56:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:56:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:56:12,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:56:12,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297472723] [2024-11-19 22:56:12,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297472723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:56:12,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:56:12,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:56:12,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241023617] [2024-11-19 22:56:12,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:56:12,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:56:12,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:56:12,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:56:12,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:56:12,770 INFO L87 Difference]: Start difference. First operand 8237 states and 11594 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:56:12,832 INFO L93 Difference]: Finished difference Result 23825 states and 33356 transitions. [2024-11-19 22:56:12,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:56:12,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2024-11-19 22:56:12,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:56:12,861 INFO L225 Difference]: With dead ends: 23825 [2024-11-19 22:56:12,861 INFO L226 Difference]: Without dead ends: 15679 [2024-11-19 22:56:12,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:56:12,877 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 65 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:56:12,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 407 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:56:12,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15679 states. [2024-11-19 22:56:13,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15679 to 14973. [2024-11-19 22:56:13,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14973 states, 14972 states have (on average 1.389393534597916) internal successors, (20802), 14972 states have internal predecessors, (20802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14973 states to 14973 states and 20802 transitions. [2024-11-19 22:56:13,186 INFO L78 Accepts]: Start accepts. Automaton has 14973 states and 20802 transitions. Word has length 118 [2024-11-19 22:56:13,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:56:13,186 INFO L471 AbstractCegarLoop]: Abstraction has 14973 states and 20802 transitions. [2024-11-19 22:56:13,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:13,186 INFO L276 IsEmpty]: Start isEmpty. Operand 14973 states and 20802 transitions. [2024-11-19 22:56:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 22:56:13,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:13,187 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, 1, 1, 1, 1, 1, 1] [2024-11-19 22:56:13,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-19 22:56:13,188 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:56:13,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:13,188 INFO L85 PathProgramCache]: Analyzing trace with hash 880608737, now seen corresponding path program 1 times [2024-11-19 22:56:13,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:13,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502487635] [2024-11-19 22:56:13,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:13,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:56:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:56:13,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:56:13,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:56:13,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502487635] [2024-11-19 22:56:13,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502487635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:56:13,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:56:13,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:56:13,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085313928] [2024-11-19 22:56:13,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:56:13,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:56:13,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:56:13,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:56:13,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:56:13,418 INFO L87 Difference]: Start difference. First operand 14973 states and 20802 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:56:13,477 INFO L93 Difference]: Finished difference Result 15455 states and 21443 transitions. [2024-11-19 22:56:13,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:56:13,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-11-19 22:56:13,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:56:13,506 INFO L225 Difference]: With dead ends: 15455 [2024-11-19 22:56:13,507 INFO L226 Difference]: Without dead ends: 15453 [2024-11-19 22:56:13,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:56:13,514 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:56:13,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 929 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:56:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15453 states. [2024-11-19 22:56:13,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15453 to 15453. [2024-11-19 22:56:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15453 states, 15452 states have (on average 1.3710846492363449) internal successors, (21186), 15452 states have internal predecessors, (21186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:13,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15453 states to 15453 states and 21186 transitions. [2024-11-19 22:56:13,704 INFO L78 Accepts]: Start accepts. Automaton has 15453 states and 21186 transitions. Word has length 119 [2024-11-19 22:56:13,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:56:13,704 INFO L471 AbstractCegarLoop]: Abstraction has 15453 states and 21186 transitions. [2024-11-19 22:56:13,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 15453 states and 21186 transitions. [2024-11-19 22:56:13,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 22:56:13,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:13,705 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:56:13,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-19 22:56:13,705 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:56:13,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:13,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1221320670, now seen corresponding path program 1 times [2024-11-19 22:56:13,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:13,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96394088] [2024-11-19 22:56:13,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:13,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:56:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:56:13,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:56:13,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:56:13,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96394088] [2024-11-19 22:56:13,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96394088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:56:13,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:56:13,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:56:13,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713302187] [2024-11-19 22:56:13,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:56:13,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:56:13,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:56:13,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:56:13,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:56:13,996 INFO L87 Difference]: Start difference. First operand 15453 states and 21186 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:14,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:56:14,198 INFO L93 Difference]: Finished difference Result 29465 states and 40552 transitions. [2024-11-19 22:56:14,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:56:14,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-11-19 22:56:14,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:56:14,245 INFO L225 Difference]: With dead ends: 29465 [2024-11-19 22:56:14,246 INFO L226 Difference]: Without dead ends: 26663 [2024-11-19 22:56:14,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:56:14,260 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 1177 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:56:14,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 1112 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:56:14,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26663 states. [2024-11-19 22:56:14,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26663 to 18253. [2024-11-19 22:56:14,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18253 states, 18252 states have (on average 1.3711374095989481) internal successors, (25026), 18252 states have internal predecessors, (25026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:14,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18253 states to 18253 states and 25026 transitions. [2024-11-19 22:56:14,521 INFO L78 Accepts]: Start accepts. Automaton has 18253 states and 25026 transitions. Word has length 119 [2024-11-19 22:56:14,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:56:14,521 INFO L471 AbstractCegarLoop]: Abstraction has 18253 states and 25026 transitions. [2024-11-19 22:56:14,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:14,522 INFO L276 IsEmpty]: Start isEmpty. Operand 18253 states and 25026 transitions. [2024-11-19 22:56:14,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-19 22:56:14,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:14,522 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:56:14,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-19 22:56:14,523 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:56:14,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:14,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1777695494, now seen corresponding path program 1 times [2024-11-19 22:56:14,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:14,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407843479] [2024-11-19 22:56:14,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:14,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:56:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:56:14,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:56:14,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:56:14,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407843479] [2024-11-19 22:56:14,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407843479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:56:14,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:56:14,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:56:14,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681733189] [2024-11-19 22:56:14,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:56:14,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:56:14,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:56:14,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:56:14,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:56:14,640 INFO L87 Difference]: Start difference. First operand 18253 states and 25026 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:14,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:56:14,803 INFO L93 Difference]: Finished difference Result 47297 states and 64676 transitions. [2024-11-19 22:56:14,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:56:14,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2024-11-19 22:56:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:56:14,852 INFO L225 Difference]: With dead ends: 47297 [2024-11-19 22:56:14,852 INFO L226 Difference]: Without dead ends: 29135 [2024-11-19 22:56:14,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:56:14,871 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 93 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:56:14,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 410 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:56:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29135 states. [2024-11-19 22:56:15,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29135 to 27469. [2024-11-19 22:56:15,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27469 states, 27468 states have (on average 1.356123489151012) internal successors, (37250), 27468 states have internal predecessors, (37250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27469 states to 27469 states and 37250 transitions. [2024-11-19 22:56:15,218 INFO L78 Accepts]: Start accepts. Automaton has 27469 states and 37250 transitions. Word has length 120 [2024-11-19 22:56:15,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:56:15,218 INFO L471 AbstractCegarLoop]: Abstraction has 27469 states and 37250 transitions. [2024-11-19 22:56:15,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:15,218 INFO L276 IsEmpty]: Start isEmpty. Operand 27469 states and 37250 transitions. [2024-11-19 22:56:15,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 22:56:15,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:15,223 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:56:15,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-19 22:56:15,223 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:56:15,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:15,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1132154545, now seen corresponding path program 1 times [2024-11-19 22:56:15,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:15,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202979360] [2024-11-19 22:56:15,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:15,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:56:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:56:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:56:15,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:56:15,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202979360] [2024-11-19 22:56:15,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202979360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:56:15,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:56:15,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:56:15,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000539875] [2024-11-19 22:56:15,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:56:15,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:56:15,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:56:15,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:56:15,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:56:15,339 INFO L87 Difference]: Start difference. First operand 27469 states and 37250 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:56:15,543 INFO L93 Difference]: Finished difference Result 54849 states and 74404 transitions. [2024-11-19 22:56:15,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:56:15,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-11-19 22:56:15,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:56:15,591 INFO L225 Difference]: With dead ends: 54849 [2024-11-19 22:56:15,591 INFO L226 Difference]: Without dead ends: 27471 [2024-11-19 22:56:15,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:56:15,618 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 82 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:56:15,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 380 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:56:15,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27471 states. [2024-11-19 22:56:15,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27471 to 27469. [2024-11-19 22:56:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27469 states, 27468 states have (on average 1.3409785932721712) internal successors, (36834), 27468 states have internal predecessors, (36834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:16,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27469 states to 27469 states and 36834 transitions. [2024-11-19 22:56:16,056 INFO L78 Accepts]: Start accepts. Automaton has 27469 states and 36834 transitions. Word has length 150 [2024-11-19 22:56:16,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:56:16,057 INFO L471 AbstractCegarLoop]: Abstraction has 27469 states and 36834 transitions. [2024-11-19 22:56:16,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:56:16,057 INFO L276 IsEmpty]: Start isEmpty. Operand 27469 states and 36834 transitions. [2024-11-19 22:56:16,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 22:56:16,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:56:16,061 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:56:16,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-11-19 22:56:16,062 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:56:16,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:56:16,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1845946094, now seen corresponding path program 1 times [2024-11-19 22:56:16,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:56:16,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375276643] [2024-11-19 22:56:16,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:56:16,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:56:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat