./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-01-1.i --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/forester-heap/sll-01-1.i -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 ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-13 23:28:21,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-13 23:28:21,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-13 23:28:21,441 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-13 23:28:21,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-13 23:28:21,442 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-13 23:28:21,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-13 23:28:21,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-13 23:28:21,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-13 23:28:21,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-13 23:28:21,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-13 23:28:21,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-13 23:28:21,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-13 23:28:21,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-13 23:28:21,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-13 23:28:21,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-13 23:28:21,462 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-13 23:28:21,463 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-13 23:28:21,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-13 23:28:21,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-13 23:28:21,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-13 23:28:21,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-13 23:28:21,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-13 23:28:21,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-13 23:28:21,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-13 23:28:21,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-13 23:28:21,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-13 23:28:21,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-13 23:28:21,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-13 23:28:21,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-13 23:28:21,493 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-13 23:28:21,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-13 23:28:21,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-13 23:28:21,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-13 23:28:21,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-13 23:28:21,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-13 23:28:21,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-13 23:28:21,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-13 23:28:21,496 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-13 23:28:21,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-13 23:28:21,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-13 23:28:21,504 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:28:21,527 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-13 23:28:21,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-13 23:28:21,528 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-13 23:28:21,528 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-13 23:28:21,529 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-13 23:28:21,529 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-13 23:28:21,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-13 23:28:21,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-13 23:28:21,530 INFO L138 SettingsManager]: * Use SBE=true [2023-02-13 23:28:21,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-13 23:28:21,531 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-13 23:28:21,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-13 23:28:21,531 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-13 23:28:21,531 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-13 23:28:21,531 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-13 23:28:21,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-13 23:28:21,532 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-13 23:28:21,532 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-13 23:28:21,532 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-13 23:28:21,532 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-13 23:28:21,532 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-13 23:28:21,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-13 23:28:21,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-13 23:28:21,533 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-13 23:28:21,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-13 23:28:21,533 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-13 23:28:21,533 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-13 23:28:21,533 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-13 23:28:21,533 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-13 23:28:21,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-13 23:28:21,534 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-13 23:28:21,534 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-13 23:28:21,534 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-13 23:28:21,534 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-13 23:28:21,534 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-13 23:28:21,534 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 -> ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d [2023-02-13 23:28:21,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-13 23:28:21,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-13 23:28:21,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-13 23:28:21,744 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-13 23:28:21,744 INFO L275 PluginConnector]: CDTParser initialized [2023-02-13 23:28:21,746 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-1.i [2023-02-13 23:28:22,762 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-13 23:28:22,958 INFO L351 CDTParser]: Found 1 translation units. [2023-02-13 23:28:22,959 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i [2023-02-13 23:28:22,969 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82aa66cb8/c520ecd941a840179f7c260c195a6158/FLAGb1eab5be2 [2023-02-13 23:28:23,336 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82aa66cb8/c520ecd941a840179f7c260c195a6158 [2023-02-13 23:28:23,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-13 23:28:23,341 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-13 23:28:23,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-13 23:28:23,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-13 23:28:23,344 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-13 23:28:23,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 11:28:23" (1/1) ... [2023-02-13 23:28:23,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1206baff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:28:23, skipping insertion in model container [2023-02-13 23:28:23,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 11:28:23" (1/1) ... [2023-02-13 23:28:23,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-13 23:28:23,378 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-13 23:28:23,585 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/forester-heap/sll-01-1.i[22034,22047] [2023-02-13 23:28:23,598 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/forester-heap/sll-01-1.i[22307,22320] [2023-02-13 23:28:23,601 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/forester-heap/sll-01-1.i[22516,22529] [2023-02-13 23:28:23,602 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/forester-heap/sll-01-1.i[22586,22599] [2023-02-13 23:28:23,604 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/forester-heap/sll-01-1.i[22853,22866] [2023-02-13 23:28:23,605 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/forester-heap/sll-01-1.i[22961,22974] [2023-02-13 23:28:23,608 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/forester-heap/sll-01-1.i[23192,23205] [2023-02-13 23:28:23,609 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/forester-heap/sll-01-1.i[23272,23285] [2023-02-13 23:28:23,610 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/forester-heap/sll-01-1.i[23351,23364] [2023-02-13 23:28:23,611 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/forester-heap/sll-01-1.i[23441,23454] [2023-02-13 23:28:23,612 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/forester-heap/sll-01-1.i[23619,23632] [2023-02-13 23:28:23,614 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/forester-heap/sll-01-1.i[23697,23710] [2023-02-13 23:28:23,615 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/forester-heap/sll-01-1.i[23774,23787] [2023-02-13 23:28:23,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 23:28:23,628 INFO L203 MainTranslator]: Completed pre-run [2023-02-13 23:28:23,657 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/forester-heap/sll-01-1.i[22034,22047] [2023-02-13 23:28:23,664 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/forester-heap/sll-01-1.i[22307,22320] [2023-02-13 23:28:23,668 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/forester-heap/sll-01-1.i[22516,22529] [2023-02-13 23:28:23,668 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/forester-heap/sll-01-1.i[22586,22599] [2023-02-13 23:28:23,672 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/forester-heap/sll-01-1.i[22853,22866] [2023-02-13 23:28:23,673 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/forester-heap/sll-01-1.i[22961,22974] [2023-02-13 23:28:23,677 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/forester-heap/sll-01-1.i[23192,23205] [2023-02-13 23:28:23,678 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/forester-heap/sll-01-1.i[23272,23285] [2023-02-13 23:28:23,679 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/forester-heap/sll-01-1.i[23351,23364] [2023-02-13 23:28:23,680 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/forester-heap/sll-01-1.i[23441,23454] [2023-02-13 23:28:23,682 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/forester-heap/sll-01-1.i[23619,23632] [2023-02-13 23:28:23,683 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/forester-heap/sll-01-1.i[23697,23710] [2023-02-13 23:28:23,684 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/forester-heap/sll-01-1.i[23774,23787] [2023-02-13 23:28:23,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 23:28:23,708 INFO L208 MainTranslator]: Completed translation [2023-02-13 23:28:23,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:28:23 WrapperNode [2023-02-13 23:28:23,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-13 23:28:23,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-13 23:28:23,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-13 23:28:23,711 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-13 23:28:23,715 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:28:23" (1/1) ... [2023-02-13 23:28:23,737 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:28:23" (1/1) ... [2023-02-13 23:28:23,762 INFO L138 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 221 [2023-02-13 23:28:23,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-13 23:28:23,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-13 23:28:23,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-13 23:28:23,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-13 23:28:23,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:28:23" (1/1) ... [2023-02-13 23:28:23,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:28:23" (1/1) ... [2023-02-13 23:28:23,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:28:23" (1/1) ... [2023-02-13 23:28:23,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:28:23" (1/1) ... [2023-02-13 23:28:23,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:28:23" (1/1) ... [2023-02-13 23:28:23,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:28:23" (1/1) ... [2023-02-13 23:28:23,810 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:28:23" (1/1) ... [2023-02-13 23:28:23,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:28:23" (1/1) ... [2023-02-13 23:28:23,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-13 23:28:23,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-13 23:28:23,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-13 23:28:23,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-13 23:28:23,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:28:23" (1/1) ... [2023-02-13 23:28:23,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-13 23:28:23,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:28:23,838 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:28:23,845 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:28:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-13 23:28:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-13 23:28:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-13 23:28:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-13 23:28:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-13 23:28:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-13 23:28:23,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-13 23:28:23,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-13 23:28:23,982 INFO L235 CfgBuilder]: Building ICFG [2023-02-13 23:28:23,983 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-13 23:28:24,221 INFO L276 CfgBuilder]: Performing block encoding [2023-02-13 23:28:24,226 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-13 23:28:24,226 INFO L300 CfgBuilder]: Removed 30 assume(true) statements. [2023-02-13 23:28:24,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:28:24 BoogieIcfgContainer [2023-02-13 23:28:24,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-13 23:28:24,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-13 23:28:24,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-13 23:28:24,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-13 23:28:24,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.02 11:28:23" (1/3) ... [2023-02-13 23:28:24,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b400f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 11:28:24, skipping insertion in model container [2023-02-13 23:28:24,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:28:23" (2/3) ... [2023-02-13 23:28:24,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b400f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 11:28:24, skipping insertion in model container [2023-02-13 23:28:24,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:28:24" (3/3) ... [2023-02-13 23:28:24,233 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2023-02-13 23:28:24,246 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-13 23:28:24,246 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2023-02-13 23:28:24,295 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-13 23:28:24,301 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;@28078bd7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-13 23:28:24,302 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-02-13 23:28:24,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 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:28:24,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-13 23:28:24,310 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:28:24,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-13 23:28:24,310 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:28:24,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:28:24,314 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2023-02-13 23:28:24,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:28:24,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91255332] [2023-02-13 23:28:24,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:24,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:28:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:24,448 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:28:24,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:28:24,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91255332] [2023-02-13 23:28:24,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91255332] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:28:24,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:28:24,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 23:28:24,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280311303] [2023-02-13 23:28:24,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:28:24,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-13 23:28:24,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:28:24,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 23:28:24,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:28:24,472 INFO L87 Difference]: Start difference. First operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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:28:24,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:28:24,511 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2023-02-13 23:28:24,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 23:28:24,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-02-13 23:28:24,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:28:24,519 INFO L225 Difference]: With dead ends: 180 [2023-02-13 23:28:24,520 INFO L226 Difference]: Without dead ends: 95 [2023-02-13 23:28:24,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:28:24,529 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 83 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:28:24,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 102 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:28:24,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-02-13 23:28:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2023-02-13 23:28:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.323076923076923) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:28:24,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2023-02-13 23:28:24,555 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 4 [2023-02-13 23:28:24,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:28:24,556 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2023-02-13 23:28:24,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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:28:24,556 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2023-02-13 23:28:24,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-13 23:28:24,557 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:28:24,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:28:24,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-13 23:28:24,557 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:28:24,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:28:24,558 INFO L85 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2023-02-13 23:28:24,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:28:24,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318314673] [2023-02-13 23:28:24,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:24,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:28:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:24,601 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:28:24,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:28:24,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318314673] [2023-02-13 23:28:24,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318314673] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:28:24,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:28:24,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 23:28:24,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289395294] [2023-02-13 23:28:24,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:28:24,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-13 23:28:24,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:28:24,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 23:28:24,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:28:24,604 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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:28:24,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:28:24,618 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2023-02-13 23:28:24,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 23:28:24,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-02-13 23:28:24,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:28:24,620 INFO L225 Difference]: With dead ends: 80 [2023-02-13 23:28:24,620 INFO L226 Difference]: Without dead ends: 78 [2023-02-13 23:28:24,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:28:24,622 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:28:24,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:28:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-13 23:28:24,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-02-13 23:28:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 77 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:28:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2023-02-13 23:28:24,632 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 10 [2023-02-13 23:28:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:28:24,633 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2023-02-13 23:28:24,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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:28:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2023-02-13 23:28:24,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-13 23:28:24,637 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:28:24,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:28:24,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-13 23:28:24,637 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:28:24,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:28:24,638 INFO L85 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2023-02-13 23:28:24,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:28:24,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912605875] [2023-02-13 23:28:24,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:24,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:28:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:24,783 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:28:24,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:28:24,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912605875] [2023-02-13 23:28:24,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912605875] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:28:24,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:28:24,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-13 23:28:24,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420751663] [2023-02-13 23:28:24,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:28:24,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-13 23:28:24,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:28:24,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 23:28:24,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:28:24,787 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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:28:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:28:24,832 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2023-02-13 23:28:24,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-13 23:28:24,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-02-13 23:28:24,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:28:24,834 INFO L225 Difference]: With dead ends: 79 [2023-02-13 23:28:24,834 INFO L226 Difference]: Without dead ends: 77 [2023-02-13 23:28:24,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:28:24,835 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:28:24,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:28:24,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-13 23:28:24,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2023-02-13 23:28:24,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.3125) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:28:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2023-02-13 23:28:24,841 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2023-02-13 23:28:24,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:28:24,841 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2023-02-13 23:28:24,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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:28:24,841 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2023-02-13 23:28:24,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-13 23:28:24,842 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:28:24,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:28:24,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-13 23:28:24,842 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:28:24,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:28:24,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2023-02-13 23:28:24,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:28:24,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21688604] [2023-02-13 23:28:24,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:24,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:28:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:24,876 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:28:24,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:28:24,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21688604] [2023-02-13 23:28:24,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21688604] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:28:24,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:28:24,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 23:28:24,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421020713] [2023-02-13 23:28:24,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:28:24,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-13 23:28:24,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:28:24,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 23:28:24,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:28:24,879 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:28:24,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:28:24,918 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2023-02-13 23:28:24,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 23:28:24,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:28:24,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:28:24,919 INFO L225 Difference]: With dead ends: 78 [2023-02-13 23:28:24,920 INFO L226 Difference]: Without dead ends: 74 [2023-02-13 23:28:24,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:28:24,922 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 16 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:28:24,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 125 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:28:24,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-13 23:28:24,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2023-02-13 23:28:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 70 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:28:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2023-02-13 23:28:24,933 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 15 [2023-02-13 23:28:24,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:28:24,933 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2023-02-13 23:28:24,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:28:24,934 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2023-02-13 23:28:24,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-13 23:28:24,934 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:28:24,934 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:28:24,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-13 23:28:24,935 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:28:24,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:28:24,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1551589151, now seen corresponding path program 1 times [2023-02-13 23:28:24,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:28:24,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274866786] [2023-02-13 23:28:24,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:24,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:28:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:25,060 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:28:25,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:28:25,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274866786] [2023-02-13 23:28:25,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274866786] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:28:25,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:28:25,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-13 23:28:25,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613076653] [2023-02-13 23:28:25,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:28:25,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-13 23:28:25,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:28:25,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 23:28:25,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:28:25,062 INFO L87 Difference]: Start difference. First operand 71 states and 80 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:28:25,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:28:25,124 INFO L93 Difference]: Finished difference Result 187 states and 209 transitions. [2023-02-13 23:28:25,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-13 23:28:25,124 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:28:25,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:28:25,125 INFO L225 Difference]: With dead ends: 187 [2023-02-13 23:28:25,125 INFO L226 Difference]: Without dead ends: 124 [2023-02-13 23:28:25,126 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:28:25,126 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 56 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:28:25,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 187 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:28:25,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-13 23:28:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 73. [2023-02-13 23:28:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.28125) internal successors, (82), 72 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:28:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2023-02-13 23:28:25,132 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 16 [2023-02-13 23:28:25,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:28:25,132 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2023-02-13 23:28:25,132 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:28:25,133 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2023-02-13 23:28:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-13 23:28:25,133 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:28:25,133 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:28:25,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-13 23:28:25,134 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:28:25,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:28:25,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2023-02-13 23:28:25,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:28:25,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058036738] [2023-02-13 23:28:25,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:25,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:28:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:25,176 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:28:25,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:28:25,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058036738] [2023-02-13 23:28:25,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058036738] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:28:25,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:28:25,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-13 23:28:25,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946573686] [2023-02-13 23:28:25,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:28:25,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-13 23:28:25,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:28:25,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 23:28:25,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:28:25,179 INFO L87 Difference]: Start difference. First operand 73 states and 82 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:28:25,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:28:25,235 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2023-02-13 23:28:25,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-13 23:28:25,236 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:28:25,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:28:25,237 INFO L225 Difference]: With dead ends: 132 [2023-02-13 23:28:25,238 INFO L226 Difference]: Without dead ends: 112 [2023-02-13 23:28:25,238 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:28:25,238 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 131 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:28:25,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 116 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:28:25,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-13 23:28:25,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 72. [2023-02-13 23:28:25,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.265625) internal successors, (81), 71 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:28:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2023-02-13 23:28:25,244 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2023-02-13 23:28:25,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:28:25,245 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2023-02-13 23:28:25,245 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:28:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2023-02-13 23:28:25,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-13 23:28:25,246 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:28:25,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:28:25,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-13 23:28:25,246 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:28:25,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:28:25,247 INFO L85 PathProgramCache]: Analyzing trace with hash -940628212, now seen corresponding path program 1 times [2023-02-13 23:28:25,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:28:25,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43661989] [2023-02-13 23:28:25,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:25,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:28:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:25,291 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:28:25,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:28:25,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43661989] [2023-02-13 23:28:25,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43661989] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:28:25,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:28:25,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 23:28:25,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275265594] [2023-02-13 23:28:25,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:28:25,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-13 23:28:25,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:28:25,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 23:28:25,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:28:25,294 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:28:25,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:28:25,308 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2023-02-13 23:28:25,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 23:28:25,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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) Word has length 20 [2023-02-13 23:28:25,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:28:25,310 INFO L225 Difference]: With dead ends: 137 [2023-02-13 23:28:25,310 INFO L226 Difference]: Without dead ends: 96 [2023-02-13 23:28:25,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:28:25,312 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 24 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:28:25,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 149 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:28:25,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-13 23:28:25,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2023-02-13 23:28:25,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:28:25,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2023-02-13 23:28:25,336 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2023-02-13 23:28:25,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:28:25,336 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2023-02-13 23:28:25,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:28:25,337 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2023-02-13 23:28:25,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-13 23:28:25,338 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:28:25,338 INFO L195 NwaCegarLoop]: trace histogram [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:28:25,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-13 23:28:25,338 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:28:25,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:28:25,339 INFO L85 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2023-02-13 23:28:25,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:28:25,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174736258] [2023-02-13 23:28:25,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:25,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:28:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:25,383 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:28:25,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:28:25,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174736258] [2023-02-13 23:28:25,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174736258] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:28:25,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:28:25,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 23:28:25,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736739273] [2023-02-13 23:28:25,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:28:25,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-13 23:28:25,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:28:25,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 23:28:25,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:28:25,390 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:28:25,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:28:25,405 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2023-02-13 23:28:25,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 23:28:25,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2023-02-13 23:28:25,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:28:25,406 INFO L225 Difference]: With dead ends: 75 [2023-02-13 23:28:25,406 INFO L226 Difference]: Without dead ends: 73 [2023-02-13 23:28:25,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:28:25,410 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 13 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:28:25,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 129 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:28:25,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-13 23:28:25,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-02-13 23:28:25,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:28:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2023-02-13 23:28:25,429 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 21 [2023-02-13 23:28:25,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:28:25,429 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2023-02-13 23:28:25,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:28:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2023-02-13 23:28:25,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-13 23:28:25,432 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:28:25,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:28:25,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-13 23:28:25,432 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:28:25,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:28:25,433 INFO L85 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2023-02-13 23:28:25,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:28:25,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867670437] [2023-02-13 23:28:25,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:25,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:28:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:25,545 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:28:25,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:28:25,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867670437] [2023-02-13 23:28:25,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867670437] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:28:25,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:28:25,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-13 23:28:25,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449665177] [2023-02-13 23:28:25,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:28:25,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-13 23:28:25,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:28:25,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 23:28:25,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:28:25,548 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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:28:25,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:28:25,589 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2023-02-13 23:28:25,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-13 23:28:25,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2023-02-13 23:28:25,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:28:25,590 INFO L225 Difference]: With dead ends: 74 [2023-02-13 23:28:25,590 INFO L226 Difference]: Without dead ends: 72 [2023-02-13 23:28:25,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:28:25,592 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:28:25,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:28:25,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-13 23:28:25,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2023-02-13 23:28:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 70 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:28:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2023-02-13 23:28:25,600 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 23 [2023-02-13 23:28:25,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:28:25,600 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2023-02-13 23:28:25,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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:28:25,601 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2023-02-13 23:28:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-13 23:28:25,602 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:28:25,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:28:25,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-13 23:28:25,603 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:28:25,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:28:25,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2023-02-13 23:28:25,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:28:25,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952545673] [2023-02-13 23:28:25,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:25,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:28:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:25,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:28:25,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:28:25,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952545673] [2023-02-13 23:28:25,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952545673] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:28:25,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:28:25,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-13 23:28:25,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077908799] [2023-02-13 23:28:25,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:28:25,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-13 23:28:25,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:28:25,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-13 23:28:25,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:28:25,702 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:28:25,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:28:25,839 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2023-02-13 23:28:25,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-13 23:28:25,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2023-02-13 23:28:25,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:28:25,841 INFO L225 Difference]: With dead ends: 175 [2023-02-13 23:28:25,841 INFO L226 Difference]: Without dead ends: 133 [2023-02-13 23:28:25,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-02-13 23:28:25,843 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 114 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:28:25,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 281 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:28:25,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-13 23:28:25,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 81. [2023-02-13 23:28:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:28:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2023-02-13 23:28:25,850 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 24 [2023-02-13 23:28:25,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:28:25,850 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2023-02-13 23:28:25,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:28:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2023-02-13 23:28:25,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-13 23:28:25,852 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:28:25,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:28:25,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-13 23:28:25,856 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:28:25,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:28:25,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2023-02-13 23:28:25,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:28:25,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045589821] [2023-02-13 23:28:25,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:25,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:28:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:27,338 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:28:27,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:28:27,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045589821] [2023-02-13 23:28:27,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045589821] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:28:27,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:28:27,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-13 23:28:27,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500069664] [2023-02-13 23:28:27,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:28:27,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-13 23:28:27,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:28:27,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-13 23:28:27,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-13 23:28:27,340 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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:28:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:28:27,632 INFO L93 Difference]: Finished difference Result 234 states and 259 transitions. [2023-02-13 23:28:27,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-13 23:28:27,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2023-02-13 23:28:27,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:28:27,634 INFO L225 Difference]: With dead ends: 234 [2023-02-13 23:28:27,634 INFO L226 Difference]: Without dead ends: 232 [2023-02-13 23:28:27,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-02-13 23:28:27,635 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 258 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-13 23:28:27,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 420 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-13 23:28:27,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-02-13 23:28:27,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 93. [2023-02-13 23:28:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 92 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:28:27,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2023-02-13 23:28:27,646 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 24 [2023-02-13 23:28:27,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:28:27,646 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2023-02-13 23:28:27,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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:28:27,646 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2023-02-13 23:28:27,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-13 23:28:27,647 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:28:27,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:28:27,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-13 23:28:27,647 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:28:27,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:28:27,648 INFO L85 PathProgramCache]: Analyzing trace with hash 680714775, now seen corresponding path program 1 times [2023-02-13 23:28:27,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:28:27,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315841058] [2023-02-13 23:28:27,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:27,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:28:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-13 23:28:27,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:28:27,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315841058] [2023-02-13 23:28:27,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315841058] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:28:27,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:28:27,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-13 23:28:27,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850695973] [2023-02-13 23:28:27,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:28:27,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-13 23:28:27,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:28:27,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-13 23:28:27,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:28:27,702 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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:28:27,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:28:27,779 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2023-02-13 23:28:27,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-13 23:28:27,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2023-02-13 23:28:27,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:28:27,780 INFO L225 Difference]: With dead ends: 139 [2023-02-13 23:28:27,780 INFO L226 Difference]: Without dead ends: 121 [2023-02-13 23:28:27,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:28:27,781 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 44 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:28:27,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 186 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:28:27,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-13 23:28:27,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2023-02-13 23:28:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 112 states have internal predecessors, (133), 0 states have call successors, (0), 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:28:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2023-02-13 23:28:27,793 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 26 [2023-02-13 23:28:27,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:28:27,793 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2023-02-13 23:28:27,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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:28:27,793 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2023-02-13 23:28:27,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-13 23:28:27,794 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:28:27,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:28:27,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-13 23:28:27,794 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:28:27,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:28:27,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1502606953, now seen corresponding path program 1 times [2023-02-13 23:28:27,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:28:27,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898049] [2023-02-13 23:28:27,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:27,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:28:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-13 23:28:27,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:28:27,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898049] [2023-02-13 23:28:27,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898049] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:28:27,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:28:27,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 23:28:27,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822936891] [2023-02-13 23:28:27,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:28:27,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-13 23:28:27,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:28:27,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 23:28:27,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:28:27,834 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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:28:27,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:28:27,868 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2023-02-13 23:28:27,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 23:28:27,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2023-02-13 23:28:27,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:28:27,869 INFO L225 Difference]: With dead ends: 113 [2023-02-13 23:28:27,869 INFO L226 Difference]: Without dead ends: 111 [2023-02-13 23:28:27,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:28:27,870 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 49 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:28:27,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 76 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:28:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-13 23:28:27,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-02-13 23:28:27,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 110 states have internal predecessors, (131), 0 states have call successors, (0), 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:28:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2023-02-13 23:28:27,882 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 26 [2023-02-13 23:28:27,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:28:27,883 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2023-02-13 23:28:27,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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:28:27,883 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2023-02-13 23:28:27,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-13 23:28:27,883 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:28:27,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:28:27,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-13 23:28:27,884 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:28:27,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:28:27,884 INFO L85 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2023-02-13 23:28:27,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:28:27,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672704954] [2023-02-13 23:28:27,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:27,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:28:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:29,189 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:28:29,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:28:29,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672704954] [2023-02-13 23:28:29,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672704954] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:28:29,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:28:29,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-13 23:28:29,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023445194] [2023-02-13 23:28:29,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:28:29,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-13 23:28:29,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:28:29,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-13 23:28:29,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-13 23:28:29,191 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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:28:29,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:28:29,465 INFO L93 Difference]: Finished difference Result 268 states and 308 transitions. [2023-02-13 23:28:29,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-13 23:28:29,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2023-02-13 23:28:29,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:28:29,466 INFO L225 Difference]: With dead ends: 268 [2023-02-13 23:28:29,466 INFO L226 Difference]: Without dead ends: 266 [2023-02-13 23:28:29,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-02-13 23:28:29,467 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 263 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:28:29,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 384 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:28:29,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-02-13 23:28:29,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 114. [2023-02-13 23:28:29,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.2293577981651376) internal successors, (134), 113 states have internal predecessors, (134), 0 states have call successors, (0), 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:28:29,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2023-02-13 23:28:29,484 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 27 [2023-02-13 23:28:29,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:28:29,485 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2023-02-13 23:28:29,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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:28:29,485 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2023-02-13 23:28:29,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-13 23:28:29,485 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:28:29,485 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:28:29,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-13 23:28:29,486 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:28:29,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:28:29,486 INFO L85 PathProgramCache]: Analyzing trace with hash -937634650, now seen corresponding path program 1 times [2023-02-13 23:28:29,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:28:29,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345488591] [2023-02-13 23:28:29,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:29,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:28:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:28:29,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:28:29,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345488591] [2023-02-13 23:28:29,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345488591] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:28:29,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231236437] [2023-02-13 23:28:29,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:29,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:28:29,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:28:29,569 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:28:29,570 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:28:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:29,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-13 23:28:29,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:28:29,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-13 23:28:29,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-13 23:28:29,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:28:29,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-13 23:28:29,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:28:29,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-13 23:28:29,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-13 23:28:29,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-13 23:28:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:28:29,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:28:29,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:28:29,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231236437] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:28:29,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:28:29,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-02-13 23:28:29,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302021374] [2023-02-13 23:28:29,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:28:29,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-13 23:28:29,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:28:29,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-13 23:28:29,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-13 23:28:29,887 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 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:28:30,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:28:30,028 INFO L93 Difference]: Finished difference Result 199 states and 229 transitions. [2023-02-13 23:28:30,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-13 23:28:30,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 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) Word has length 29 [2023-02-13 23:28:30,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:28:30,032 INFO L225 Difference]: With dead ends: 199 [2023-02-13 23:28:30,032 INFO L226 Difference]: Without dead ends: 139 [2023-02-13 23:28:30,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-02-13 23:28:30,033 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 109 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:28:30,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 209 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:28:30,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-02-13 23:28:30,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 116. [2023-02-13 23:28:30,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.2072072072072073) internal successors, (134), 115 states have internal predecessors, (134), 0 states have call successors, (0), 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:28:30,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2023-02-13 23:28:30,053 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 29 [2023-02-13 23:28:30,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:28:30,054 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2023-02-13 23:28:30,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 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:28:30,054 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2023-02-13 23:28:30,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-13 23:28:30,055 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:28:30,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:28:30,068 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:28:30,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-13 23:28:30,269 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:28:30,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:28:30,269 INFO L85 PathProgramCache]: Analyzing trace with hash -2010394174, now seen corresponding path program 1 times [2023-02-13 23:28:30,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:28:30,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138568418] [2023-02-13 23:28:30,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:30,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:28:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:28:30,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:28:30,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138568418] [2023-02-13 23:28:30,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138568418] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:28:30,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:28:30,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-13 23:28:30,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790956803] [2023-02-13 23:28:30,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:28:30,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-13 23:28:30,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:28:30,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-13 23:28:30,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:28:30,446 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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:28:30,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:28:30,596 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2023-02-13 23:28:30,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-13 23:28:30,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2023-02-13 23:28:30,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:28:30,597 INFO L225 Difference]: With dead ends: 159 [2023-02-13 23:28:30,597 INFO L226 Difference]: Without dead ends: 139 [2023-02-13 23:28:30,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-13 23:28:30,598 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 63 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:28:30,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 290 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:28:30,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-02-13 23:28:30,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 115. [2023-02-13 23:28:30,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.2) internal successors, (132), 114 states have internal predecessors, (132), 0 states have call successors, (0), 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:28:30,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2023-02-13 23:28:30,614 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 29 [2023-02-13 23:28:30,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:28:30,614 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2023-02-13 23:28:30,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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:28:30,614 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2023-02-13 23:28:30,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-13 23:28:30,614 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:28:30,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:28:30,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-13 23:28:30,615 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:28:30,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:28:30,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1521997910, now seen corresponding path program 1 times [2023-02-13 23:28:30,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:28:30,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065373792] [2023-02-13 23:28:30,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:30,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:28:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:28:30,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:28:30,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065373792] [2023-02-13 23:28:30,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065373792] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:28:30,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:28:30,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 23:28:30,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038225949] [2023-02-13 23:28:30,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:28:30,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-13 23:28:30,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:28:30,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 23:28:30,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:28:30,655 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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:28:30,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:28:30,685 INFO L93 Difference]: Finished difference Result 220 states and 257 transitions. [2023-02-13 23:28:30,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 23:28:30,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2023-02-13 23:28:30,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:28:30,686 INFO L225 Difference]: With dead ends: 220 [2023-02-13 23:28:30,686 INFO L226 Difference]: Without dead ends: 165 [2023-02-13 23:28:30,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:28:30,687 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 26 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:28:30,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 164 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:28:30,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-13 23:28:30,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 138. [2023-02-13 23:28:30,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 133 states have (on average 1.2105263157894737) internal successors, (161), 137 states have internal predecessors, (161), 0 states have call successors, (0), 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:28:30,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 161 transitions. [2023-02-13 23:28:30,710 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 161 transitions. Word has length 31 [2023-02-13 23:28:30,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:28:30,710 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 161 transitions. [2023-02-13 23:28:30,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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:28:30,710 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 161 transitions. [2023-02-13 23:28:30,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-13 23:28:30,710 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:28:30,711 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:28:30,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-13 23:28:30,711 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:28:30,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:28:30,711 INFO L85 PathProgramCache]: Analyzing trace with hash 914215427, now seen corresponding path program 1 times [2023-02-13 23:28:30,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:28:30,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586793360] [2023-02-13 23:28:30,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:30,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:28:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:28:30,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:28:30,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586793360] [2023-02-13 23:28:30,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586793360] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:28:30,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280661250] [2023-02-13 23:28:30,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:30,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:28:30,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:28:30,802 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:28:30,804 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:28:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:30,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-13 23:28:30,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:28:30,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-13 23:28:30,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-13 23:28:30,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-13 23:28:30,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-13 23:28:30,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-13 23:28:30,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-13 23:28:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-13 23:28:30,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:28:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-13 23:28:31,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280661250] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:28:31,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:28:31,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2023-02-13 23:28:31,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055692675] [2023-02-13 23:28:31,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:28:31,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-13 23:28:31,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:28:31,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-13 23:28:31,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:28:31,051 INFO L87 Difference]: Start difference. First operand 138 states and 161 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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:28:31,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:28:31,217 INFO L93 Difference]: Finished difference Result 247 states and 282 transitions. [2023-02-13 23:28:31,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-13 23:28:31,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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 32 [2023-02-13 23:28:31,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:28:31,218 INFO L225 Difference]: With dead ends: 247 [2023-02-13 23:28:31,218 INFO L226 Difference]: Without dead ends: 216 [2023-02-13 23:28:31,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-13 23:28:31,219 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 95 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:28:31,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 286 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:28:31,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-02-13 23:28:31,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 165. [2023-02-13 23:28:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 160 states have (on average 1.2375) internal successors, (198), 164 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:28:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 198 transitions. [2023-02-13 23:28:31,250 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 198 transitions. Word has length 32 [2023-02-13 23:28:31,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:28:31,250 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 198 transitions. [2023-02-13 23:28:31,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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:28:31,250 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 198 transitions. [2023-02-13 23:28:31,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-13 23:28:31,251 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:28:31,251 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:28:31,259 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:28:31,459 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,SelfDestructingSolverStorable17 [2023-02-13 23:28:31,459 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:28:31,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:28:31,460 INFO L85 PathProgramCache]: Analyzing trace with hash 191981961, now seen corresponding path program 1 times [2023-02-13 23:28:31,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:28:31,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972203735] [2023-02-13 23:28:31,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:31,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:28:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:31,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:28:31,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:28:31,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972203735] [2023-02-13 23:28:31,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972203735] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:28:31,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:28:31,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-13 23:28:31,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775588072] [2023-02-13 23:28:31,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:28:31,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-13 23:28:31,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:28:31,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-13 23:28:31,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:28:31,530 INFO L87 Difference]: Start difference. First operand 165 states and 198 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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:28:31,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:28:31,590 INFO L93 Difference]: Finished difference Result 231 states and 274 transitions. [2023-02-13 23:28:31,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-13 23:28:31,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2023-02-13 23:28:31,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:28:31,591 INFO L225 Difference]: With dead ends: 231 [2023-02-13 23:28:31,591 INFO L226 Difference]: Without dead ends: 117 [2023-02-13 23:28:31,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:28:31,592 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 24 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:28:31,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 188 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:28:31,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-13 23:28:31,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-02-13 23:28:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 113 states have (on average 1.1592920353982301) internal successors, (131), 116 states have internal predecessors, (131), 0 states have call successors, (0), 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:28:31,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2023-02-13 23:28:31,609 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 35 [2023-02-13 23:28:31,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:28:31,609 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2023-02-13 23:28:31,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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:28:31,609 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2023-02-13 23:28:31,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-13 23:28:31,610 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:28:31,610 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:28:31,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-13 23:28:31,610 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:28:31,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:28:31,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1562646056, now seen corresponding path program 1 times [2023-02-13 23:28:31,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:28:31,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076202936] [2023-02-13 23:28:31,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:31,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:28:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:28:31,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:28:31,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076202936] [2023-02-13 23:28:31,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076202936] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:28:31,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98766330] [2023-02-13 23:28:31,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:31,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:28:31,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:28:31,965 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 23:28:31,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-13 23:28:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:32,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-13 23:28:32,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:28:32,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-13 23:28:32,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-13 23:28:32,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-13 23:28:32,190 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-13 23:28:32,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-13 23:28:32,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:28:32,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-02-13 23:28:32,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:28:32,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-02-13 23:28:32,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-13 23:28:32,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-13 23:28:32,343 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-13 23:28:32,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-13 23:28:32,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2023-02-13 23:28:32,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:28:32,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-13 23:28:32,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:28:32,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:28:32,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2023-02-13 23:28:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:28:32,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:28:32,589 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_978 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_978) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_979 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_979) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 0)))) is different from false [2023-02-13 23:28:36,392 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:28:36,397 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:28:36,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2023-02-13 23:28:36,402 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:28:36,404 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:28:36,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 30 [2023-02-13 23:28:36,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-13 23:28:36,410 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:28:36,412 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-13 23:28:36,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2023-02-13 23:28:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:28:36,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98766330] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:28:36,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:28:36,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2023-02-13 23:28:36,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321071644] [2023-02-13 23:28:36,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:28:36,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-13 23:28:36,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:28:36,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-13 23:28:36,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=369, Unknown=2, NotChecked=40, Total=506 [2023-02-13 23:28:36,438 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 23 states, 23 states have (on average 4.0) internal successors, (92), 23 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:28:37,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:28:37,795 INFO L93 Difference]: Finished difference Result 318 states and 359 transitions. [2023-02-13 23:28:37,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-13 23:28:37,795 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.0) internal successors, (92), 23 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-13 23:28:37,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:28:37,796 INFO L225 Difference]: With dead ends: 318 [2023-02-13 23:28:37,796 INFO L226 Difference]: Without dead ends: 258 [2023-02-13 23:28:37,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=360, Invalid=971, Unknown=5, NotChecked=70, Total=1406 [2023-02-13 23:28:37,797 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 671 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 81 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-13 23:28:37,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 686 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 422 Invalid, 13 Unknown, 126 Unchecked, 0.6s Time] [2023-02-13 23:28:37,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-02-13 23:28:37,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 138. [2023-02-13 23:28:37,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 134 states have (on average 1.1567164179104477) internal successors, (155), 137 states have internal predecessors, (155), 0 states have call successors, (0), 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:28:37,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 155 transitions. [2023-02-13 23:28:37,820 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 155 transitions. Word has length 36 [2023-02-13 23:28:37,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:28:37,820 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 155 transitions. [2023-02-13 23:28:37,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.0) internal successors, (92), 23 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:28:37,820 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2023-02-13 23:28:37,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-13 23:28:37,821 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:28:37,821 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:28:37,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-13 23:28:38,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:28:38,026 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:28:38,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:28:38,027 INFO L85 PathProgramCache]: Analyzing trace with hash 878042536, now seen corresponding path program 1 times [2023-02-13 23:28:38,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:28:38,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113441854] [2023-02-13 23:28:38,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:38,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:28:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:28:39,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:28:39,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113441854] [2023-02-13 23:28:39,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113441854] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:28:39,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038680419] [2023-02-13 23:28:39,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:28:39,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:28:39,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:28:39,797 INFO L229 MonitoredProcess]: Starting monitored process 5 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:28:39,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-13 23:28:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:28:39,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 79 conjunts are in the unsatisfiable core [2023-02-13 23:28:39,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:28:39,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-13 23:28:39,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:28:40,057 INFO L321 Elim1Store]: treesize reduction 23, result has 56.6 percent of original size [2023-02-13 23:28:40,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 383 treesize of output 326 [2023-02-13 23:28:40,116 INFO L321 Elim1Store]: treesize reduction 23, result has 56.6 percent of original size [2023-02-13 23:28:40,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 491 treesize of output 404 [2023-02-13 23:28:40,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:28:40,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:28:40,185 INFO L321 Elim1Store]: treesize reduction 575, result has 3.8 percent of original size [2023-02-13 23:28:40,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 368 treesize of output 516 [2023-02-13 23:28:40,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:28:40,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:28:40,251 INFO L321 Elim1Store]: treesize reduction 404, result has 5.4 percent of original size [2023-02-13 23:28:40,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 393 treesize of output 457 [2023-02-13 23:28:40,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 67 [2023-02-13 23:28:40,269 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:28:40,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 82 [2023-02-13 23:28:40,298 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-13 23:28:40,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-13 23:28:40,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2023-02-13 23:28:40,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2023-02-13 23:28:40,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2023-02-13 23:28:40,387 WARN L193 Elim1Store]: Array PQE input equivalent to false [2023-02-13 23:28:40,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 105 [2023-02-13 23:28:40,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2023-02-13 23:28:40,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-13 23:28:40,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2023-02-13 23:28:40,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-13 23:28:40,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2023-02-13 23:28:40,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 49 [2023-02-13 23:28:40,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2023-02-13 23:28:40,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2023-02-13 23:28:40,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2023-02-13 23:28:40,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2023-02-13 23:28:41,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-13 23:28:41,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 208 [2023-02-13 23:28:41,028 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:28:41,029 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:28:41,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 3 [2023-02-13 23:28:41,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2023-02-13 23:28:41,154 INFO L321 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-02-13 23:28:41,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 85 [2023-02-13 23:28:41,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2023-02-13 23:28:41,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2023-02-13 23:28:41,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2023-02-13 23:28:41,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2023-02-13 23:28:41,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2023-02-13 23:28:41,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-02-13 23:28:41,217 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-13 23:28:41,361 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-02-13 23:28:41,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 62 [2023-02-13 23:28:41,371 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:28:41,389 INFO L321 Elim1Store]: treesize reduction 72, result has 30.1 percent of original size [2023-02-13 23:28:41,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 74 [2023-02-13 23:28:41,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:28:41,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:28:41,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2023-02-13 23:28:41,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:28:41,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:28:41,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2023-02-13 23:28:41,417 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-13 23:28:41,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-02-13 23:28:41,669 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:28:41,670 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:28:41,694 INFO L321 Elim1Store]: treesize reduction 114, result has 25.5 percent of original size [2023-02-13 23:28:41,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 138 treesize of output 133 [2023-02-13 23:28:41,724 INFO L321 Elim1Store]: treesize reduction 140, result has 20.0 percent of original size [2023-02-13 23:28:41,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 167 treesize of output 166 [2023-02-13 23:28:42,257 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:28:42,269 INFO L321 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2023-02-13 23:28:42,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 52 [2023-02-13 23:28:42,276 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-13 23:28:42,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 21 [2023-02-13 23:28:42,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:28:42,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:28:42,536 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:28:42,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 169 [2023-02-13 23:28:42,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:28:42,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 157 [2023-02-13 23:28:49,293 WARN L233 SmtUtils]: Spent 6.47s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-13 23:28:59,266 INFO L321 Elim1Store]: treesize reduction 62, result has 54.4 percent of original size [2023-02-13 23:28:59,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 21925 treesize of output 17583 [2023-02-13 23:29:03,508 INFO L321 Elim1Store]: treesize reduction 62, result has 54.4 percent of original size [2023-02-13 23:29:03,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 58693 treesize of output 42759