./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-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.graphml --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 fc74ae7e31589f228260101e75826f872a5ff2be20b18370840af309ca05fc6e --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-13 23:55:56,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-13 23:55:56,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-13 23:55:56,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-13 23:55:56,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-13 23:55:56,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-13 23:55:56,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-13 23:55:56,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-13 23:55:56,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-13 23:55:56,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-13 23:55:56,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-13 23:55:56,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-13 23:55:56,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-13 23:55:56,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-13 23:55:56,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-13 23:55:56,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-13 23:55:56,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-13 23:55:56,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-13 23:55:56,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-13 23:55:56,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-13 23:55:56,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-13 23:55:56,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-13 23:55:56,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-13 23:55:56,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-13 23:55:56,986 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-13 23:55:56,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-13 23:55:56,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-13 23:55:56,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-13 23:55:56,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-13 23:55:56,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-13 23:55:56,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-13 23:55:56,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-13 23:55:56,990 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-13 23:55:56,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-13 23:55:56,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-13 23:55:56,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-13 23:55:56,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-13 23:55:56,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-13 23:55:56,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-13 23:55:56,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-13 23:55:56,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-13 23:55:56,995 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-13 23:55:57,027 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-13 23:55:57,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-13 23:55:57,028 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-13 23:55:57,028 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-13 23:55:57,029 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-13 23:55:57,029 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-13 23:55:57,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-13 23:55:57,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-13 23:55:57,030 INFO L138 SettingsManager]: * Use SBE=true [2023-02-13 23:55:57,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-13 23:55:57,031 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-13 23:55:57,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-13 23:55:57,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-13 23:55:57,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-13 23:55:57,031 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-13 23:55:57,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-13 23:55:57,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-13 23:55:57,032 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-13 23:55:57,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-13 23:55:57,032 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-13 23:55:57,032 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-13 23:55:57,032 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-13 23:55:57,032 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-13 23:55:57,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-13 23:55:57,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-13 23:55:57,033 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-13 23:55:57,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-13 23:55:57,033 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-13 23:55:57,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-13 23:55:57,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-13 23:55:57,034 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-13 23:55:57,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-13 23:55:57,034 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-13 23:55:57,034 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-13 23:55:57,034 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-13 23:55:57,034 INFO L138 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.graphml 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 -> fc74ae7e31589f228260101e75826f872a5ff2be20b18370840af309ca05fc6e [2023-02-13 23:55:57,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-13 23:55:57,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-13 23:55:57,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-13 23:55:57,234 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-13 23:55:57,234 INFO L275 PluginConnector]: CDTParser initialized [2023-02-13 23:55:57,235 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2023-02-13 23:55:58,109 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-13 23:55:58,271 INFO L351 CDTParser]: Found 1 translation units. [2023-02-13 23:55:58,271 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2023-02-13 23:55:58,277 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b38db935f/fe2d897ca38a437ca5fb0988381daa61/FLAG6e0a63803 [2023-02-13 23:55:58,285 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b38db935f/fe2d897ca38a437ca5fb0988381daa61 [2023-02-13 23:55:58,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-13 23:55:58,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-13 23:55:58,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-13 23:55:58,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-13 23:55:58,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-13 23:55:58,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 11:55:58" (1/1) ... [2023-02-13 23:55:58,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@635fbf45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:55:58, skipping insertion in model container [2023-02-13 23:55:58,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 11:55:58" (1/1) ... [2023-02-13 23:55:58,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-13 23:55:58,325 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-13 23:55:58,415 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2023-02-13 23:55:58,418 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2023-02-13 23:55:58,419 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2023-02-13 23:55:58,420 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2023-02-13 23:55:58,421 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2023-02-13 23:55:58,422 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2023-02-13 23:55:58,424 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2023-02-13 23:55:58,430 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2023-02-13 23:55:58,432 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2023-02-13 23:55:58,433 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2023-02-13 23:55:58,436 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2023-02-13 23:55:58,437 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2023-02-13 23:55:58,440 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2023-02-13 23:55:58,442 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2023-02-13 23:55:58,443 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2023-02-13 23:55:58,446 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2023-02-13 23:55:58,447 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2023-02-13 23:55:58,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 23:55:58,458 INFO L203 MainTranslator]: Completed pre-run [2023-02-13 23:55:58,467 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2023-02-13 23:55:58,469 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2023-02-13 23:55:58,470 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2023-02-13 23:55:58,471 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2023-02-13 23:55:58,472 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2023-02-13 23:55:58,473 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2023-02-13 23:55:58,479 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2023-02-13 23:55:58,480 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2023-02-13 23:55:58,481 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2023-02-13 23:55:58,481 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2023-02-13 23:55:58,483 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2023-02-13 23:55:58,483 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2023-02-13 23:55:58,484 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2023-02-13 23:55:58,485 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2023-02-13 23:55:58,486 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2023-02-13 23:55:58,487 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2023-02-13 23:55:58,488 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2023-02-13 23:55:58,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 23:55:58,497 INFO L208 MainTranslator]: Completed translation [2023-02-13 23:55:58,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:55:58 WrapperNode [2023-02-13 23:55:58,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-13 23:55:58,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-13 23:55:58,499 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-13 23:55:58,499 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-13 23:55:58,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:55:58" (1/1) ... [2023-02-13 23:55:58,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:55:58" (1/1) ... [2023-02-13 23:55:58,522 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 229 [2023-02-13 23:55:58,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-13 23:55:58,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-13 23:55:58,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-13 23:55:58,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-13 23:55:58,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:55:58" (1/1) ... [2023-02-13 23:55:58,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:55:58" (1/1) ... [2023-02-13 23:55:58,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:55:58" (1/1) ... [2023-02-13 23:55:58,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:55:58" (1/1) ... [2023-02-13 23:55:58,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:55:58" (1/1) ... [2023-02-13 23:55:58,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:55:58" (1/1) ... [2023-02-13 23:55:58,537 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:55:58" (1/1) ... [2023-02-13 23:55:58,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:55:58" (1/1) ... [2023-02-13 23:55:58,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-13 23:55:58,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-13 23:55:58,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-13 23:55:58,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-13 23:55:58,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:55:58" (1/1) ... [2023-02-13 23:55:58,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-13 23:55:58,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:55:58,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-13 23:55:58,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-13 23:55:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-13 23:55:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-13 23:55:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-13 23:55:58,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-13 23:55:58,647 INFO L235 CfgBuilder]: Building ICFG [2023-02-13 23:55:58,649 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-13 23:55:58,901 INFO L276 CfgBuilder]: Performing block encoding [2023-02-13 23:55:58,905 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-13 23:55:58,905 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-13 23:55:58,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:55:58 BoogieIcfgContainer [2023-02-13 23:55:58,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-13 23:55:58,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-13 23:55:58,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-13 23:55:58,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-13 23:55:58,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.02 11:55:58" (1/3) ... [2023-02-13 23:55:58,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505d1a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 11:55:58, skipping insertion in model container [2023-02-13 23:55:58,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:55:58" (2/3) ... [2023-02-13 23:55:58,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505d1a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 11:55:58, skipping insertion in model container [2023-02-13 23:55:58,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:55:58" (3/3) ... [2023-02-13 23:55:58,912 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2023-02-13 23:55:58,922 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-13 23:55:58,923 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2023-02-13 23:55:58,962 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-13 23:55:58,967 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2e329780, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-13 23:55:58,980 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-02-13 23:55:58,983 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 53 states have (on average 1.849056603773585) internal successors, (98), 70 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:55:58,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-13 23:55:58,987 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:55:58,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:55:58,988 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:55:58,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:55:58,991 INFO L85 PathProgramCache]: Analyzing trace with hash 123971630, now seen corresponding path program 1 times [2023-02-13 23:55:59,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:55:59,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12033419] [2023-02-13 23:55:59,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:55:59,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:55:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:55:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:55:59,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:55:59,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12033419] [2023-02-13 23:55:59,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12033419] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:55:59,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:55:59,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-13 23:55:59,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632166203] [2023-02-13 23:55:59,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:55:59,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-13 23:55:59,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:55:59,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 23:55:59,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:55:59,299 INFO L87 Difference]: Start difference. First operand has 71 states, 53 states have (on average 1.849056603773585) internal successors, (98), 70 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:55:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:55:59,401 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2023-02-13 23:55:59,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-13 23:55:59,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-13 23:55:59,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:55:59,408 INFO L225 Difference]: With dead ends: 125 [2023-02-13 23:55:59,408 INFO L226 Difference]: Without dead ends: 109 [2023-02-13 23:55:59,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:55:59,412 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 83 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:55:59,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 252 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:55:59,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-13 23:55:59,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 65. [2023-02-13 23:55:59,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:55:59,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2023-02-13 23:55:59,453 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2023-02-13 23:55:59,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:55:59,454 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2023-02-13 23:55:59,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:55:59,454 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2023-02-13 23:55:59,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-13 23:55:59,455 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:55:59,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:55:59,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-13 23:55:59,456 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:55:59,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:55:59,458 INFO L85 PathProgramCache]: Analyzing trace with hash 120336139, now seen corresponding path program 1 times [2023-02-13 23:55:59,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:55:59,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083274974] [2023-02-13 23:55:59,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:55:59,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:55:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:55:59,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:55:59,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:55:59,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083274974] [2023-02-13 23:55:59,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083274974] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:55:59,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:55:59,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-13 23:55:59,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541073307] [2023-02-13 23:55:59,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:55:59,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-13 23:55:59,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:55:59,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 23:55:59,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:55:59,556 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:55:59,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:55:59,603 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2023-02-13 23:55:59,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-13 23:55:59,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-13 23:55:59,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:55:59,604 INFO L225 Difference]: With dead ends: 65 [2023-02-13 23:55:59,604 INFO L226 Difference]: Without dead ends: 63 [2023-02-13 23:55:59,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:55:59,605 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 100 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:55:59,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 56 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:55:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-13 23:55:59,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-13 23:55:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:55:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2023-02-13 23:55:59,613 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 8 [2023-02-13 23:55:59,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:55:59,613 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2023-02-13 23:55:59,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:55:59,613 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2023-02-13 23:55:59,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-13 23:55:59,614 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:55:59,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:55:59,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-13 23:55:59,614 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:55:59,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:55:59,619 INFO L85 PathProgramCache]: Analyzing trace with hash -564542931, now seen corresponding path program 1 times [2023-02-13 23:55:59,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:55:59,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116680075] [2023-02-13 23:55:59,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:55:59,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:55:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:55:59,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:55:59,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:55:59,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116680075] [2023-02-13 23:55:59,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116680075] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:55:59,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:55:59,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-13 23:55:59,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767342926] [2023-02-13 23:55:59,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:55:59,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-13 23:55:59,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:55:59,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 23:55:59,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:55:59,701 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:55:59,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:55:59,756 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2023-02-13 23:55:59,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-13 23:55:59,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-13 23:55:59,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:55:59,757 INFO L225 Difference]: With dead ends: 69 [2023-02-13 23:55:59,757 INFO L226 Difference]: Without dead ends: 67 [2023-02-13 23:55:59,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:55:59,758 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 43 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:55:59,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 117 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:55:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-13 23:55:59,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2023-02-13 23:55:59,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:55:59,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2023-02-13 23:55:59,763 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 9 [2023-02-13 23:55:59,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:55:59,763 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2023-02-13 23:55:59,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:55:59,763 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2023-02-13 23:55:59,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-13 23:55:59,763 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:55:59,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:55:59,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-13 23:55:59,763 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:55:59,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:55:59,764 INFO L85 PathProgramCache]: Analyzing trace with hash -429055130, now seen corresponding path program 1 times [2023-02-13 23:55:59,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:55:59,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429905338] [2023-02-13 23:55:59,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:55:59,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:55:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:55:59,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:55:59,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:55:59,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429905338] [2023-02-13 23:55:59,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429905338] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:55:59,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:55:59,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-13 23:55:59,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341544990] [2023-02-13 23:55:59,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:55:59,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-13 23:55:59,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:55:59,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-13 23:55:59,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:55:59,817 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:55:59,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:55:59,875 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2023-02-13 23:55:59,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-13 23:55:59,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-13 23:55:59,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:55:59,878 INFO L225 Difference]: With dead ends: 67 [2023-02-13 23:55:59,879 INFO L226 Difference]: Without dead ends: 65 [2023-02-13 23:55:59,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:55:59,881 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 59 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:55:59,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 113 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:55:59,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-13 23:55:59,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2023-02-13 23:55:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.36) internal successors, (68), 63 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:55:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2023-02-13 23:55:59,891 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 11 [2023-02-13 23:55:59,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:55:59,891 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2023-02-13 23:55:59,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:55:59,891 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2023-02-13 23:55:59,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-13 23:55:59,892 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:55:59,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:55:59,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-13 23:55:59,892 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:55:59,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:55:59,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1359750351, now seen corresponding path program 1 times [2023-02-13 23:55:59,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:55:59,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969203352] [2023-02-13 23:55:59,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:55:59,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:55:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:55:59,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:55:59,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:55:59,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969203352] [2023-02-13 23:55:59,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969203352] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:55:59,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:55:59,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-13 23:55:59,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611376592] [2023-02-13 23:55:59,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:55:59,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-13 23:55:59,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:55:59,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-13 23:55:59,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:55:59,959 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:56:00,009 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2023-02-13 23:56:00,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-13 23:56:00,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-13 23:56:00,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:56:00,011 INFO L225 Difference]: With dead ends: 65 [2023-02-13 23:56:00,011 INFO L226 Difference]: Without dead ends: 63 [2023-02-13 23:56:00,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:56:00,012 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:56:00,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 107 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:56:00,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-13 23:56:00,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2023-02-13 23:56:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.346938775510204) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2023-02-13 23:56:00,022 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 11 [2023-02-13 23:56:00,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:56:00,022 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2023-02-13 23:56:00,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,022 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2023-02-13 23:56:00,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-13 23:56:00,023 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:56:00,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:56:00,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-13 23:56:00,023 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:56:00,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:56:00,024 INFO L85 PathProgramCache]: Analyzing trace with hash -415802953, now seen corresponding path program 1 times [2023-02-13 23:56:00,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:56:00,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071380316] [2023-02-13 23:56:00,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:56:00,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:56:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:56:00,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:56:00,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:56:00,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071380316] [2023-02-13 23:56:00,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071380316] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:56:00,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:56:00,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-13 23:56:00,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184787723] [2023-02-13 23:56:00,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:56:00,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-13 23:56:00,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:56:00,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 23:56:00,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:56:00,105 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:56:00,137 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2023-02-13 23:56:00,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-13 23:56:00,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-13 23:56:00,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:56:00,138 INFO L225 Difference]: With dead ends: 63 [2023-02-13 23:56:00,139 INFO L226 Difference]: Without dead ends: 59 [2023-02-13 23:56:00,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:56:00,140 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 16 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:56:00,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 126 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:56:00,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-13 23:56:00,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2023-02-13 23:56:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2023-02-13 23:56:00,150 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 12 [2023-02-13 23:56:00,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:56:00,150 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2023-02-13 23:56:00,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,151 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2023-02-13 23:56:00,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-13 23:56:00,152 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:56:00,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:56:00,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-13 23:56:00,152 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:56:00,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:56:00,153 INFO L85 PathProgramCache]: Analyzing trace with hash -415312395, now seen corresponding path program 1 times [2023-02-13 23:56:00,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:56:00,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465867166] [2023-02-13 23:56:00,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:56:00,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:56:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:56:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:56:00,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:56:00,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465867166] [2023-02-13 23:56:00,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465867166] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:56:00,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:56:00,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-13 23:56:00,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437843924] [2023-02-13 23:56:00,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:56:00,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-13 23:56:00,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:56:00,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-13 23:56:00,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:56:00,212 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:56:00,293 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2023-02-13 23:56:00,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-13 23:56:00,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-13 23:56:00,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:56:00,294 INFO L225 Difference]: With dead ends: 100 [2023-02-13 23:56:00,295 INFO L226 Difference]: Without dead ends: 98 [2023-02-13 23:56:00,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:56:00,296 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 95 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:56:00,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 144 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:56:00,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-13 23:56:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 56. [2023-02-13 23:56:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2023-02-13 23:56:00,309 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 12 [2023-02-13 23:56:00,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:56:00,310 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2023-02-13 23:56:00,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2023-02-13 23:56:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-13 23:56:00,311 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:56:00,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:56:00,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-13 23:56:00,312 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:56:00,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:56:00,313 INFO L85 PathProgramCache]: Analyzing trace with hash 797416153, now seen corresponding path program 1 times [2023-02-13 23:56:00,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:56:00,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919817492] [2023-02-13 23:56:00,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:56:00,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:56:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:56:00,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:56:00,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:56:00,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919817492] [2023-02-13 23:56:00,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919817492] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:56:00,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:56:00,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-13 23:56:00,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524987276] [2023-02-13 23:56:00,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:56:00,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-13 23:56:00,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:56:00,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 23:56:00,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:56:00,356 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:56:00,383 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2023-02-13 23:56:00,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-13 23:56:00,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-13 23:56:00,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:56:00,384 INFO L225 Difference]: With dead ends: 57 [2023-02-13 23:56:00,384 INFO L226 Difference]: Without dead ends: 53 [2023-02-13 23:56:00,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:56:00,385 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:56:00,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 114 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:56:00,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-13 23:56:00,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2023-02-13 23:56:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2023-02-13 23:56:00,387 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 12 [2023-02-13 23:56:00,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:56:00,387 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2023-02-13 23:56:00,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,387 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2023-02-13 23:56:00,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-13 23:56:00,387 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:56:00,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:56:00,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-13 23:56:00,387 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:56:00,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:56:00,388 INFO L85 PathProgramCache]: Analyzing trace with hash 10221853, now seen corresponding path program 1 times [2023-02-13 23:56:00,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:56:00,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088841922] [2023-02-13 23:56:00,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:56:00,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:56:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:56:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:56:00,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:56:00,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088841922] [2023-02-13 23:56:00,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088841922] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:56:00,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:56:00,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-13 23:56:00,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26301243] [2023-02-13 23:56:00,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:56:00,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-13 23:56:00,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:56:00,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-13 23:56:00,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:56:00,524 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:56:00,623 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2023-02-13 23:56:00,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-13 23:56:00,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-13 23:56:00,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:56:00,624 INFO L225 Difference]: With dead ends: 118 [2023-02-13 23:56:00,624 INFO L226 Difference]: Without dead ends: 116 [2023-02-13 23:56:00,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-13 23:56:00,626 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 76 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:56:00,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 250 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:56:00,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-13 23:56:00,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 57. [2023-02-13 23:56:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2023-02-13 23:56:00,633 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 13 [2023-02-13 23:56:00,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:56:00,633 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2023-02-13 23:56:00,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2023-02-13 23:56:00,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-13 23:56:00,635 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:56:00,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:56:00,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-13 23:56:00,635 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:56:00,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:56:00,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1032848570, now seen corresponding path program 1 times [2023-02-13 23:56:00,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:56:00,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82176194] [2023-02-13 23:56:00,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:56:00,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:56:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:56:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:56:00,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:56:00,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82176194] [2023-02-13 23:56:00,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82176194] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:56:00,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:56:00,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-13 23:56:00,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524477168] [2023-02-13 23:56:00,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:56:00,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-13 23:56:00,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:56:00,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-13 23:56:00,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:56:00,690 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:56:00,738 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2023-02-13 23:56:00,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-13 23:56:00,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-13 23:56:00,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:56:00,741 INFO L225 Difference]: With dead ends: 74 [2023-02-13 23:56:00,741 INFO L226 Difference]: Without dead ends: 72 [2023-02-13 23:56:00,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:56:00,742 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 69 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:56:00,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 103 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:56:00,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-13 23:56:00,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2023-02-13 23:56:00,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2023-02-13 23:56:00,746 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 13 [2023-02-13 23:56:00,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:56:00,746 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2023-02-13 23:56:00,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2023-02-13 23:56:00,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-13 23:56:00,751 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:56:00,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:56:00,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-13 23:56:00,752 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:56:00,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:56:00,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1031124666, now seen corresponding path program 1 times [2023-02-13 23:56:00,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:56:00,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134330066] [2023-02-13 23:56:00,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:56:00,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:56:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:56:00,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:56:00,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:56:00,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134330066] [2023-02-13 23:56:00,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134330066] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:56:00,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:56:00,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-13 23:56:00,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397304204] [2023-02-13 23:56:00,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:56:00,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-13 23:56:00,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:56:00,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-13 23:56:00,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:56:00,783 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:56:00,823 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2023-02-13 23:56:00,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-13 23:56:00,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-13 23:56:00,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:56:00,823 INFO L225 Difference]: With dead ends: 55 [2023-02-13 23:56:00,823 INFO L226 Difference]: Without dead ends: 53 [2023-02-13 23:56:00,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:56:00,824 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:56:00,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 77 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:56:00,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-13 23:56:00,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-02-13 23:56:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2023-02-13 23:56:00,827 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2023-02-13 23:56:00,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:56:00,827 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2023-02-13 23:56:00,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,827 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2023-02-13 23:56:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-13 23:56:00,827 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:56:00,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:56:00,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-13 23:56:00,827 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:56:00,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:56:00,827 INFO L85 PathProgramCache]: Analyzing trace with hash 310078394, now seen corresponding path program 1 times [2023-02-13 23:56:00,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:56:00,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381302103] [2023-02-13 23:56:00,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:56:00,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:56:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:56:00,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:56:00,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:56:00,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381302103] [2023-02-13 23:56:00,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381302103] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:56:00,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:56:00,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-13 23:56:00,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509608673] [2023-02-13 23:56:00,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:56:00,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-13 23:56:00,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:56:00,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-13 23:56:00,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:56:00,894 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:56:00,949 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2023-02-13 23:56:00,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-13 23:56:00,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-13 23:56:00,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:56:00,951 INFO L225 Difference]: With dead ends: 78 [2023-02-13 23:56:00,951 INFO L226 Difference]: Without dead ends: 76 [2023-02-13 23:56:00,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-13 23:56:00,952 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 82 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:56:00,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 85 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:56:00,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-13 23:56:00,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 53. [2023-02-13 23:56:00,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2023-02-13 23:56:00,956 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 14 [2023-02-13 23:56:00,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:56:00,956 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2023-02-13 23:56:00,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:00,956 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2023-02-13 23:56:00,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-13 23:56:00,956 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:56:00,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:56:00,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-13 23:56:00,957 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:56:00,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:56:00,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1953530500, now seen corresponding path program 1 times [2023-02-13 23:56:00,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:56:00,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567563428] [2023-02-13 23:56:00,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:56:00,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:56:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:56:01,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:56:01,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:56:01,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567563428] [2023-02-13 23:56:01,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567563428] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:56:01,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:56:01,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-13 23:56:01,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361567968] [2023-02-13 23:56:01,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:56:01,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-13 23:56:01,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:56:01,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-13 23:56:01,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:56:01,072 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:01,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:56:01,133 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2023-02-13 23:56:01,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-13 23:56:01,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-13 23:56:01,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:56:01,135 INFO L225 Difference]: With dead ends: 92 [2023-02-13 23:56:01,135 INFO L226 Difference]: Without dead ends: 90 [2023-02-13 23:56:01,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-13 23:56:01,135 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 52 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:56:01,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 131 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:56:01,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-13 23:56:01,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2023-02-13 23:56:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 60 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2023-02-13 23:56:01,140 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 14 [2023-02-13 23:56:01,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:56:01,141 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2023-02-13 23:56:01,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:01,141 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2023-02-13 23:56:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-13 23:56:01,141 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:56:01,141 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:56:01,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-13 23:56:01,142 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:56:01,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:56:01,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1951983355, now seen corresponding path program 1 times [2023-02-13 23:56:01,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:56:01,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125793652] [2023-02-13 23:56:01,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:56:01,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:56:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:56:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:56:01,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:56:01,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125793652] [2023-02-13 23:56:01,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125793652] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:56:01,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:56:01,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-13 23:56:01,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578284758] [2023-02-13 23:56:01,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:56:01,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-13 23:56:01,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:56:01,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-13 23:56:01,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:56:01,175 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:01,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:56:01,223 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2023-02-13 23:56:01,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-13 23:56:01,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-13 23:56:01,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:56:01,224 INFO L225 Difference]: With dead ends: 81 [2023-02-13 23:56:01,224 INFO L226 Difference]: Without dead ends: 79 [2023-02-13 23:56:01,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:56:01,225 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 60 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:56:01,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 95 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:56:01,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-13 23:56:01,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. [2023-02-13 23:56:01,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:01,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2023-02-13 23:56:01,228 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 14 [2023-02-13 23:56:01,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:56:01,229 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2023-02-13 23:56:01,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:01,229 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2023-02-13 23:56:01,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-13 23:56:01,229 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:56:01,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:56:01,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-13 23:56:01,229 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:56:01,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:56:01,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1900089420, now seen corresponding path program 1 times [2023-02-13 23:56:01,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:56:01,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650036409] [2023-02-13 23:56:01,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:56:01,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:56:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:56:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:56:01,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:56:01,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650036409] [2023-02-13 23:56:01,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650036409] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:56:01,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:56:01,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-13 23:56:01,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076572124] [2023-02-13 23:56:01,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:56:01,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-13 23:56:01,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:56:01,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-13 23:56:01,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:56:01,311 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:01,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:56:01,363 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2023-02-13 23:56:01,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-13 23:56:01,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-13 23:56:01,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:56:01,364 INFO L225 Difference]: With dead ends: 70 [2023-02-13 23:56:01,364 INFO L226 Difference]: Without dead ends: 66 [2023-02-13 23:56:01,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-13 23:56:01,365 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 23 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:56:01,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 96 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:56:01,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-02-13 23:56:01,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2023-02-13 23:56:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:01,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2023-02-13 23:56:01,369 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 14 [2023-02-13 23:56:01,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:56:01,369 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2023-02-13 23:56:01,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:01,370 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2023-02-13 23:56:01,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-13 23:56:01,370 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:56:01,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:56:01,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-13 23:56:01,370 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:56:01,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:56:01,371 INFO L85 PathProgramCache]: Analyzing trace with hash -381937728, now seen corresponding path program 1 times [2023-02-13 23:56:01,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:56:01,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375576899] [2023-02-13 23:56:01,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:56:01,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:56:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:56:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:56:01,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:56:01,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375576899] [2023-02-13 23:56:01,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375576899] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:56:01,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:56:01,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-13 23:56:01,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618811710] [2023-02-13 23:56:01,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:56:01,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-13 23:56:01,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:56:01,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-13 23:56:01,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:56:01,452 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:01,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:56:01,521 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2023-02-13 23:56:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-13 23:56:01,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-13 23:56:01,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:56:01,522 INFO L225 Difference]: With dead ends: 87 [2023-02-13 23:56:01,522 INFO L226 Difference]: Without dead ends: 85 [2023-02-13 23:56:01,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-13 23:56:01,523 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 44 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:56:01,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 147 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:56:01,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-13 23:56:01,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 63. [2023-02-13 23:56:01,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.25) internal successors, (70), 62 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:01,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2023-02-13 23:56:01,527 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 15 [2023-02-13 23:56:01,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:56:01,528 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2023-02-13 23:56:01,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:01,528 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2023-02-13 23:56:01,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-13 23:56:01,528 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:56:01,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:56:01,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-13 23:56:01,529 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:56:01,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:56:01,529 INFO L85 PathProgramCache]: Analyzing trace with hash -441974753, now seen corresponding path program 1 times [2023-02-13 23:56:01,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:56:01,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822433296] [2023-02-13 23:56:01,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:56:01,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:56:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:56:01,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:56:01,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:56:01,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822433296] [2023-02-13 23:56:01,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822433296] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:56:01,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:56:01,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-13 23:56:01,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947173164] [2023-02-13 23:56:01,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:56:01,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-13 23:56:01,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:56:01,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 23:56:01,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:56:01,558 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:01,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:56:01,582 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2023-02-13 23:56:01,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-13 23:56:01,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-13 23:56:01,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:56:01,582 INFO L225 Difference]: With dead ends: 63 [2023-02-13 23:56:01,583 INFO L226 Difference]: Without dead ends: 61 [2023-02-13 23:56:01,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:56:01,583 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 35 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:56:01,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 64 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:56:01,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-02-13 23:56:01,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-02-13 23:56:01,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 60 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:01,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2023-02-13 23:56:01,588 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 16 [2023-02-13 23:56:01,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:56:01,588 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2023-02-13 23:56:01,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2023-02-13 23:56:01,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-13 23:56:01,589 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:56:01,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:56:01,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-13 23:56:01,589 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:56:01,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:56:01,590 INFO L85 PathProgramCache]: Analyzing trace with hash -816311340, now seen corresponding path program 1 times [2023-02-13 23:56:01,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:56:01,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504115346] [2023-02-13 23:56:01,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:56:01,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:56:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:56:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:56:01,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:56:01,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504115346] [2023-02-13 23:56:01,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504115346] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:56:01,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:56:01,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-13 23:56:01,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668887297] [2023-02-13 23:56:01,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:56:01,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-13 23:56:01,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:56:01,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 23:56:01,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:56:01,615 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:56:01,640 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2023-02-13 23:56:01,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-13 23:56:01,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-13 23:56:01,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:56:01,641 INFO L225 Difference]: With dead ends: 61 [2023-02-13 23:56:01,641 INFO L226 Difference]: Without dead ends: 57 [2023-02-13 23:56:01,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:56:01,641 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:56:01,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 86 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:56:01,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-13 23:56:01,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-02-13 23:56:01,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2023-02-13 23:56:01,645 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 17 [2023-02-13 23:56:01,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:56:01,645 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2023-02-13 23:56:01,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:01,646 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2023-02-13 23:56:01,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-13 23:56:01,646 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:56:01,646 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:56:01,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-13 23:56:01,646 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:56:01,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:56:01,647 INFO L85 PathProgramCache]: Analyzing trace with hash -508949322, now seen corresponding path program 1 times [2023-02-13 23:56:01,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:56:01,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9705175] [2023-02-13 23:56:01,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:56:01,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:56:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:56:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:56:01,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:56:01,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9705175] [2023-02-13 23:56:01,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9705175] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:56:01,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317729129] [2023-02-13 23:56:01,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:56:01,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:56:01,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:56:01,703 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 23:56:01,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-13 23:56:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:56:01,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-13 23:56:01,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:56:01,928 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:56:01,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:56:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-13 23:56:02,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317729129] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:56:02,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:56:02,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 17 [2023-02-13 23:56:02,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089536420] [2023-02-13 23:56:02,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:56:02,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-13 23:56:02,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:56:02,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-13 23:56:02,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-02-13 23:56:02,006 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:02,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:56:02,187 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2023-02-13 23:56:02,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-13 23:56:02,188 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-13 23:56:02,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:56:02,188 INFO L225 Difference]: With dead ends: 104 [2023-02-13 23:56:02,188 INFO L226 Difference]: Without dead ends: 102 [2023-02-13 23:56:02,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2023-02-13 23:56:02,189 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 202 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:56:02,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 145 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:56:02,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-13 23:56:02,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 53. [2023-02-13 23:56:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2023-02-13 23:56:02,195 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 18 [2023-02-13 23:56:02,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:56:02,195 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2023-02-13 23:56:02,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:02,195 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2023-02-13 23:56:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-13 23:56:02,197 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:56:02,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:56:02,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-13 23:56:02,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:56:02,402 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:56:02,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:56:02,402 INFO L85 PathProgramCache]: Analyzing trace with hash 479271318, now seen corresponding path program 1 times [2023-02-13 23:56:02,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:56:02,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587002207] [2023-02-13 23:56:02,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:56:02,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:56:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:56:02,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:56:02,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:56:02,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587002207] [2023-02-13 23:56:02,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587002207] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:56:02,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:56:02,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-13 23:56:02,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169448871] [2023-02-13 23:56:02,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:56:02,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-13 23:56:02,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:56:02,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-13 23:56:02,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:56:02,466 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:02,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:56:02,526 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2023-02-13 23:56:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-13 23:56:02,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-13 23:56:02,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:56:02,527 INFO L225 Difference]: With dead ends: 68 [2023-02-13 23:56:02,527 INFO L226 Difference]: Without dead ends: 66 [2023-02-13 23:56:02,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-13 23:56:02,528 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 70 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:56:02,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 44 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:56:02,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-02-13 23:56:02,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2023-02-13 23:56:02,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2023-02-13 23:56:02,534 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 18 [2023-02-13 23:56:02,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:56:02,534 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2023-02-13 23:56:02,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:02,534 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2023-02-13 23:56:02,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-13 23:56:02,535 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:56:02,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:56:02,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-13 23:56:02,535 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:56:02,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:56:02,535 INFO L85 PathProgramCache]: Analyzing trace with hash 397067279, now seen corresponding path program 1 times [2023-02-13 23:56:02,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:56:02,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84800037] [2023-02-13 23:56:02,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:56:02,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:56:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:56:02,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:56:02,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:56:02,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84800037] [2023-02-13 23:56:02,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84800037] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:56:02,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:56:02,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-13 23:56:02,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517315421] [2023-02-13 23:56:02,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:56:02,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-13 23:56:02,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:56:02,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-13 23:56:02,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:56:02,610 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:02,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:56:02,661 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2023-02-13 23:56:02,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-13 23:56:02,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-13 23:56:02,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:56:02,662 INFO L225 Difference]: With dead ends: 60 [2023-02-13 23:56:02,662 INFO L226 Difference]: Without dead ends: 58 [2023-02-13 23:56:02,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-13 23:56:02,663 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 84 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:56:02,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 37 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:56:02,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-13 23:56:02,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2023-02-13 23:56:02,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2023-02-13 23:56:02,668 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 19 [2023-02-13 23:56:02,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:56:02,668 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2023-02-13 23:56:02,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:02,668 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2023-02-13 23:56:02,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-13 23:56:02,668 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:56:02,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:56:02,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-13 23:56:02,669 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:56:02,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:56:02,669 INFO L85 PathProgramCache]: Analyzing trace with hash 450508359, now seen corresponding path program 1 times [2023-02-13 23:56:02,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:56:02,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935112418] [2023-02-13 23:56:02,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:56:02,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:56:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:56:02,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:56:02,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:56:02,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935112418] [2023-02-13 23:56:02,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935112418] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:56:02,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:56:02,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-13 23:56:02,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952399641] [2023-02-13 23:56:02,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:56:02,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-13 23:56:02,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:56:02,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-13 23:56:02,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:56:02,723 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:02,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:56:02,765 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2023-02-13 23:56:02,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-13 23:56:02,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-13 23:56:02,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:56:02,766 INFO L225 Difference]: With dead ends: 43 [2023-02-13 23:56:02,766 INFO L226 Difference]: Without dead ends: 20 [2023-02-13 23:56:02,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-13 23:56:02,767 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 63 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:56:02,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 27 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:56:02,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-13 23:56:02,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-02-13 23:56:02,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:02,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2023-02-13 23:56:02,769 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 19 [2023-02-13 23:56:02,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:56:02,770 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2023-02-13 23:56:02,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:02,770 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2023-02-13 23:56:02,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-13 23:56:02,770 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:56:02,770 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:56:02,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-13 23:56:02,771 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-02-13 23:56:02,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:56:02,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1395641153, now seen corresponding path program 1 times [2023-02-13 23:56:02,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:56:02,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523281324] [2023-02-13 23:56:02,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:56:02,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:56:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:56:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:56:02,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:56:02,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523281324] [2023-02-13 23:56:02,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523281324] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:56:02,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831807421] [2023-02-13 23:56:02,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:56:02,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:56:02,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:56:02,835 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 23:56:02,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-13 23:56:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:56:02,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-13 23:56:02,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:56:03,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:56:03,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:56:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-13 23:56:03,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831807421] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:56:03,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:56:03,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 17 [2023-02-13 23:56:03,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870545898] [2023-02-13 23:56:03,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:56:03,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-13 23:56:03,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:56:03,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-13 23:56:03,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-02-13 23:56:03,116 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:03,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:56:03,186 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2023-02-13 23:56:03,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-13 23:56:03,186 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-13 23:56:03,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:56:03,186 INFO L225 Difference]: With dead ends: 31 [2023-02-13 23:56:03,186 INFO L226 Difference]: Without dead ends: 0 [2023-02-13 23:56:03,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2023-02-13 23:56:03,188 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:56:03,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 36 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:56:03,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-13 23:56:03,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-13 23:56:03,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:03,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-13 23:56:03,190 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2023-02-13 23:56:03,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:56:03,190 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-13 23:56:03,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:56:03,190 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-13 23:56:03,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-13 23:56:03,192 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 17 remaining) [2023-02-13 23:56:03,193 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (15 of 17 remaining) [2023-02-13 23:56:03,193 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (14 of 17 remaining) [2023-02-13 23:56:03,193 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (13 of 17 remaining) [2023-02-13 23:56:03,193 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (12 of 17 remaining) [2023-02-13 23:56:03,193 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (11 of 17 remaining) [2023-02-13 23:56:03,193 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (10 of 17 remaining) [2023-02-13 23:56:03,194 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (9 of 17 remaining) [2023-02-13 23:56:03,194 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (8 of 17 remaining) [2023-02-13 23:56:03,194 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (7 of 17 remaining) [2023-02-13 23:56:03,194 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (6 of 17 remaining) [2023-02-13 23:56:03,194 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (5 of 17 remaining) [2023-02-13 23:56:03,194 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (4 of 17 remaining) [2023-02-13 23:56:03,194 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (3 of 17 remaining) [2023-02-13 23:56:03,194 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (2 of 17 remaining) [2023-02-13 23:56:03,194 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (1 of 17 remaining) [2023-02-13 23:56:03,195 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (0 of 17 remaining) [2023-02-13 23:56:03,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-13 23:56:03,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-02-13 23:56:03,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-13 23:56:13,543 WARN L233 SmtUtils]: Spent 7.56s on a formula simplification. DAG size of input: 77 DAG size of output: 75 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-02-13 23:56:29,092 WARN L233 SmtUtils]: Spent 15.55s on a formula simplification. DAG size of input: 73 DAG size of output: 71 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-02-13 23:56:29,585 INFO L899 garLoopResultBuilder]: For program point L225(line 225) no Hoare annotation was computed. [2023-02-13 23:56:29,586 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2023-02-13 23:56:29,586 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 358) no Hoare annotation was computed. [2023-02-13 23:56:29,586 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2023-02-13 23:56:29,586 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2023-02-13 23:56:29,586 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 316) no Hoare annotation was computed. [2023-02-13 23:56:29,586 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2023-02-13 23:56:29,586 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2023-02-13 23:56:29,586 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 15 375) the Hoare annotation is: true [2023-02-13 23:56:29,586 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2023-02-13 23:56:29,586 INFO L895 garLoopResultBuilder]: At program point L168(lines 102 252) the Hoare annotation is: (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0)) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0)) (<= 1 |ULTIMATE.start_main_~main__t~0#1|) (not (<= |ULTIMATE.start_main_~main__tagbuf_len~0#1| |ULTIMATE.start_main_~main__t~0#1|))) [2023-02-13 23:56:29,586 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 252) no Hoare annotation was computed. [2023-02-13 23:56:29,586 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 362) no Hoare annotation was computed. [2023-02-13 23:56:29,586 INFO L899 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2023-02-13 23:56:29,587 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2023-02-13 23:56:29,587 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-13 23:56:29,587 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 374) no Hoare annotation was computed. [2023-02-13 23:56:29,587 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2023-02-13 23:56:29,587 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 339) no Hoare annotation was computed. [2023-02-13 23:56:29,588 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 243) no Hoare annotation was computed. [2023-02-13 23:56:29,588 INFO L899 garLoopResultBuilder]: For program point L351(line 351) no Hoare annotation was computed. [2023-02-13 23:56:29,588 INFO L895 garLoopResultBuilder]: At program point L285(lines 283 364) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~main__t~0#1| 0))) (let ((.cse1 (let ((.cse3 (<= 0 |ULTIMATE.start_main_~main__t~0#1|)) (.cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)))) (or (and .cse3 .cse4 .cse0) (and .cse3 .cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 0)))))) (.cse2 (< |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 1) .cse1 .cse2) (and (<= 1 |ULTIMATE.start_main_~main__t~0#1|) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 1) .cse1 .cse2)))) [2023-02-13 23:56:29,588 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 237) no Hoare annotation was computed. [2023-02-13 23:56:29,588 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 161) no Hoare annotation was computed. [2023-02-13 23:56:29,588 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 254) no Hoare annotation was computed. [2023-02-13 23:56:29,588 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2023-02-13 23:56:29,588 INFO L899 garLoopResultBuilder]: For program point L310(line 310) no Hoare annotation was computed. [2023-02-13 23:56:29,589 INFO L899 garLoopResultBuilder]: For program point L277(lines 277 364) no Hoare annotation was computed. [2023-02-13 23:56:29,589 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 310) no Hoare annotation was computed. [2023-02-13 23:56:29,589 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-13 23:56:29,589 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 95) no Hoare annotation was computed. [2023-02-13 23:56:29,589 INFO L895 garLoopResultBuilder]: At program point $Ultimate##12(lines 64 253) the Hoare annotation is: (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0)) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0)) (<= 1 |ULTIMATE.start_main_~main__t~0#1|) (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) [2023-02-13 23:56:29,589 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 143) no Hoare annotation was computed. [2023-02-13 23:56:29,589 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 197) no Hoare annotation was computed. [2023-02-13 23:56:29,589 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 204) no Hoare annotation was computed. [2023-02-13 23:56:29,589 INFO L899 garLoopResultBuilder]: For program point L237(line 237) no Hoare annotation was computed. [2023-02-13 23:56:29,589 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 127) no Hoare annotation was computed. [2023-02-13 23:56:29,589 INFO L899 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2023-02-13 23:56:29,590 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-02-13 23:56:29,590 INFO L899 garLoopResultBuilder]: For program point L279(line 279) no Hoare annotation was computed. [2023-02-13 23:56:29,590 INFO L899 garLoopResultBuilder]: For program point L337(lines 337 360) no Hoare annotation was computed. [2023-02-13 23:56:29,590 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 351) no Hoare annotation was computed. [2023-02-13 23:56:29,590 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 210) no Hoare annotation was computed. [2023-02-13 23:56:29,590 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-02-13 23:56:29,590 INFO L899 garLoopResultBuilder]: For program point L296(lines 296 318) no Hoare annotation was computed. [2023-02-13 23:56:29,590 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 368) no Hoare annotation was computed. [2023-02-13 23:56:29,590 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-13 23:56:29,590 INFO L899 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2023-02-13 23:56:29,590 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2023-02-13 23:56:29,591 INFO L902 garLoopResultBuilder]: At program point L90(lines 32 368) the Hoare annotation is: true [2023-02-13 23:56:29,591 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 369) no Hoare annotation was computed. [2023-02-13 23:56:29,591 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2023-02-13 23:56:29,591 INFO L899 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2023-02-13 23:56:29,591 INFO L899 garLoopResultBuilder]: For program point L289(lines 289 363) no Hoare annotation was computed. [2023-02-13 23:56:29,591 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-13 23:56:29,591 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 155) no Hoare annotation was computed. [2023-02-13 23:56:29,591 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 245) no Hoare annotation was computed. [2023-02-13 23:56:29,591 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 93) no Hoare annotation was computed. [2023-02-13 23:56:29,591 INFO L899 garLoopResultBuilder]: For program point L339(line 339) no Hoare annotation was computed. [2023-02-13 23:56:29,592 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 163) no Hoare annotation was computed. [2023-02-13 23:56:29,592 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 256) no Hoare annotation was computed. [2023-02-13 23:56:29,592 INFO L899 garLoopResultBuilder]: For program point L298(line 298) no Hoare annotation was computed. [2023-02-13 23:56:29,592 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 202) no Hoare annotation was computed. [2023-02-13 23:56:29,592 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 225) no Hoare annotation was computed. [2023-02-13 23:56:29,592 INFO L899 garLoopResultBuilder]: For program point L216(lines 216 251) no Hoare annotation was computed. [2023-02-13 23:56:29,592 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2023-02-13 23:56:29,592 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 199) no Hoare annotation was computed. [2023-02-13 23:56:29,592 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 298) no Hoare annotation was computed. [2023-02-13 23:56:29,592 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 366) no Hoare annotation was computed. [2023-02-13 23:56:29,592 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 201) no Hoare annotation was computed. [2023-02-13 23:56:29,593 INFO L895 garLoopResultBuilder]: At program point L35(lines 32 368) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_main_~main__t~0#1| 1))) (let ((.cse0 (let ((.cse2 (<= 1 |ULTIMATE.start_main_~main__t~0#1|)) (.cse3 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)))) (or (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 0)) .cse2 .cse3) (and .cse2 .cse3 (not (= |ULTIMATE.start_main_~main__tagbuf_len~0#1| 0)) (< 0 (+ |ULTIMATE.start_main_~main__tagbuf_len~0#1| 1)) .cse1))))) (or (and (or (= |ULTIMATE.start_main_~main__t~0#1| 0) (and .cse0 .cse1)) (< |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) (and .cse0 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 1) (not (<= |ULTIMATE.start_main_~main__tagbuf_len~0#1| |ULTIMATE.start_main_~main__t~0#1|)))))) [2023-02-13 23:56:29,595 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:56:29,597 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-13 23:56:29,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.02 11:56:29 BoogieIcfgContainer [2023-02-13 23:56:29,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-13 23:56:29,608 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-13 23:56:29,608 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-13 23:56:29,608 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-13 23:56:29,609 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:55:58" (3/4) ... [2023-02-13 23:56:29,610 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-13 23:56:29,618 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-02-13 23:56:29,619 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-13 23:56:29,619 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-13 23:56:29,619 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-13 23:56:29,648 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-13 23:56:29,648 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-13 23:56:29,648 INFO L158 Benchmark]: Toolchain (without parser) took 31360.63ms. Allocated memory was 107.0MB in the beginning and 570.4MB in the end (delta: 463.5MB). Free memory was 74.4MB in the beginning and 204.2MB in the end (delta: -129.8MB). Peak memory consumption was 335.8MB. Max. memory is 16.1GB. [2023-02-13 23:56:29,648 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory was 75.9MB in the beginning and 75.8MB in the end (delta: 79.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-13 23:56:29,649 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.23ms. Allocated memory is still 107.0MB. Free memory was 74.2MB in the beginning and 58.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-13 23:56:29,649 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.04ms. Allocated memory is still 107.0MB. Free memory was 58.1MB in the beginning and 56.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-13 23:56:29,649 INFO L158 Benchmark]: Boogie Preprocessor took 15.85ms. Allocated memory is still 107.0MB. Free memory was 56.0MB in the beginning and 54.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-13 23:56:29,649 INFO L158 Benchmark]: RCFGBuilder took 366.59ms. Allocated memory is still 107.0MB. Free memory was 54.6MB in the beginning and 73.8MB in the end (delta: -19.2MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2023-02-13 23:56:29,649 INFO L158 Benchmark]: TraceAbstraction took 30699.72ms. Allocated memory was 107.0MB in the beginning and 570.4MB in the end (delta: 463.5MB). Free memory was 73.0MB in the beginning and 208.4MB in the end (delta: -135.4MB). Peak memory consumption was 337.6MB. Max. memory is 16.1GB. [2023-02-13 23:56:29,649 INFO L158 Benchmark]: Witness Printer took 39.99ms. Allocated memory is still 570.4MB. Free memory was 208.4MB in the beginning and 204.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-13 23:56:29,650 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory was 75.9MB in the beginning and 75.8MB in the end (delta: 79.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.23ms. Allocated memory is still 107.0MB. Free memory was 74.2MB in the beginning and 58.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.04ms. Allocated memory is still 107.0MB. Free memory was 58.1MB in the beginning and 56.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.85ms. Allocated memory is still 107.0MB. Free memory was 56.0MB in the beginning and 54.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 366.59ms. Allocated memory is still 107.0MB. Free memory was 54.6MB in the beginning and 73.8MB in the end (delta: -19.2MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * TraceAbstraction took 30699.72ms. Allocated memory was 107.0MB in the beginning and 570.4MB in the end (delta: 463.5MB). Free memory was 73.0MB in the beginning and 208.4MB in the end (delta: -135.4MB). Peak memory consumption was 337.6MB. Max. memory is 16.1GB. * Witness Printer took 39.99ms. Allocated memory is still 570.4MB. Free memory was 208.4MB in the beginning and 204.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 44]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 73]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 115]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 127]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 143]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 155]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 225]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 237]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 279]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 298]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 310]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 339]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 351]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 30.6s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 26.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1387 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1387 mSDsluCounter, 2452 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1498 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1818 IncrementalHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 954 mSDtfsCounter, 1818 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 349 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 17 NumberOfFragments, 189 HoareAnnotationTreeSize, 6 FomulaSimplifications, 279314 FormulaSimplificationTreeSizeReduction, 25.7s HoareSimplificationTime, 6 FomulaSimplificationsInter, 465478 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 366 ConstructedInterpolants, 0 QuantifiedInterpolants, 1691 SizeOfPredicates, 12 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && main__t <= main__tagbuf_len - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && !(main__tagbuf_len <= main__t) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: (((main__t == 0 && __VERIFIER_assert__cond == 1) && (((0 <= main__t && !(__VERIFIER_assert__cond == 0)) && main__t == 0) || ((0 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && main__t < main__tagbuf_len) || (((1 <= main__t && __VERIFIER_assert__cond == 1) && (((0 <= main__t && !(__VERIFIER_assert__cond == 0)) && main__t == 0) || ((0 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && main__t < main__tagbuf_len) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((main__t == 0 || ((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) || ((((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(main__tagbuf_len == 0)) && 0 < main__tagbuf_len + 1) && main__t <= 1)) && main__t <= 1)) && main__t < main__tagbuf_len) || (((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) || ((((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(main__tagbuf_len == 0)) && 0 < main__tagbuf_len + 1) && main__t <= 1)) && __VERIFIER_assert__cond == 1) && !(main__tagbuf_len <= main__t)) RESULT: Ultimate proved your program to be correct! [2023-02-13 23:56:29,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE