./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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-2.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 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:42:04,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:42:04,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:42:04,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:42:04,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:42:04,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:42:04,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:42:04,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:42:04,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:42:04,520 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:42:04,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:42:04,522 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:42:04,522 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:42:04,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:42:04,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:42:04,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:42:04,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:42:04,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:42:04,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:42:04,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:42:04,534 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:42:04,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:42:04,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:42:04,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:42:04,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:42:04,541 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:42:04,542 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:42:04,542 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:42:04,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:42:04,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:42:04,544 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:42:04,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:42:04,545 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:42:04,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:42:04,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:42:04,546 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:42:04,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:42:04,547 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:42:04,547 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:42:04,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:42:04,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:42:04,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:42:04,549 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 14:42:04,573 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:42:04,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:42:04,573 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:42:04,573 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:42:04,574 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:42:04,574 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:42:04,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:42:04,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:42:04,575 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:42:04,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:42:04,576 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:42:04,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 14:42:04,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:42:04,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:42:04,576 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:42:04,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:42:04,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:42:04,577 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:42:04,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:42:04,577 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:42:04,577 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:42:04,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:42:04,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:42:04,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:42:04,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:42:04,578 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:42:04,578 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:42:04,579 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:42:04,579 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 14:42:04,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 14:42:04,579 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:42:04,579 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:42:04,579 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:42:04,580 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2022-07-22 14:42:04,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:42:04,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:42:04,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:42:04,789 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:42:04,789 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:42:04,790 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-2.i [2022-07-22 14:42:04,836 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c0d0d660/d13b60a52e4e4a2e9146286ebc01d2d6/FLAGb5517cd36 [2022-07-22 14:42:05,312 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:42:05,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2022-07-22 14:42:05,332 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c0d0d660/d13b60a52e4e4a2e9146286ebc01d2d6/FLAGb5517cd36 [2022-07-22 14:42:05,348 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c0d0d660/d13b60a52e4e4a2e9146286ebc01d2d6 [2022-07-22 14:42:05,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:42:05,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:42:05,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:42:05,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:42:05,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:42:05,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:42:05" (1/1) ... [2022-07-22 14:42:05,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45766a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:05, skipping insertion in model container [2022-07-22 14:42:05,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:42:05" (1/1) ... [2022-07-22 14:42:05,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:42:05,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:42:05,641 WARN L230 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-2.i[22034,22047] [2022-07-22 14:42:05,653 WARN L230 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-2.i[22307,22320] [2022-07-22 14:42:05,659 WARN L230 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-2.i[22516,22529] [2022-07-22 14:42:05,660 WARN L230 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-2.i[22586,22599] [2022-07-22 14:42:05,665 WARN L230 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-2.i[22853,22866] [2022-07-22 14:42:05,674 WARN L230 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-2.i[22961,22974] [2022-07-22 14:42:05,675 WARN L230 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-2.i[23192,23205] [2022-07-22 14:42:05,676 WARN L230 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-2.i[23272,23285] [2022-07-22 14:42:05,676 WARN L230 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-2.i[23351,23364] [2022-07-22 14:42:05,677 WARN L230 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-2.i[23484,23497] [2022-07-22 14:42:05,678 WARN L230 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-2.i[23662,23675] [2022-07-22 14:42:05,678 WARN L230 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-2.i[23740,23753] [2022-07-22 14:42:05,679 WARN L230 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-2.i[23817,23830] [2022-07-22 14:42:05,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:42:05,687 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:42:05,708 WARN L230 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-2.i[22034,22047] [2022-07-22 14:42:05,710 WARN L230 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-2.i[22307,22320] [2022-07-22 14:42:05,711 WARN L230 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-2.i[22516,22529] [2022-07-22 14:42:05,712 WARN L230 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-2.i[22586,22599] [2022-07-22 14:42:05,713 WARN L230 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-2.i[22853,22866] [2022-07-22 14:42:05,714 WARN L230 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-2.i[22961,22974] [2022-07-22 14:42:05,715 WARN L230 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-2.i[23192,23205] [2022-07-22 14:42:05,716 WARN L230 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-2.i[23272,23285] [2022-07-22 14:42:05,717 WARN L230 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-2.i[23351,23364] [2022-07-22 14:42:05,718 WARN L230 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-2.i[23484,23497] [2022-07-22 14:42:05,726 WARN L230 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-2.i[23662,23675] [2022-07-22 14:42:05,727 WARN L230 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-2.i[23740,23753] [2022-07-22 14:42:05,728 WARN L230 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-2.i[23817,23830] [2022-07-22 14:42:05,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:42:05,751 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:42:05,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:05 WrapperNode [2022-07-22 14:42:05,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:42:05,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:42:05,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:42:05,753 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:42:05,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:05" (1/1) ... [2022-07-22 14:42:05,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:05" (1/1) ... [2022-07-22 14:42:05,824 INFO L137 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 225 [2022-07-22 14:42:05,828 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:42:05,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:42:05,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:42:05,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:42:05,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:05" (1/1) ... [2022-07-22 14:42:05,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:05" (1/1) ... [2022-07-22 14:42:05,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:05" (1/1) ... [2022-07-22 14:42:05,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:05" (1/1) ... [2022-07-22 14:42:05,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:05" (1/1) ... [2022-07-22 14:42:05,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:05" (1/1) ... [2022-07-22 14:42:05,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:05" (1/1) ... [2022-07-22 14:42:05,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:42:05,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:42:05,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:42:05,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:42:05,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:05" (1/1) ... [2022-07-22 14:42:05,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:42:05,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:42:05,939 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) [2022-07-22 14:42:05,953 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 [2022-07-22 14:42:05,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:42:05,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:42:05,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:42:05,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:42:05,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 14:42:05,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 14:42:05,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:42:05,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:42:06,063 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:42:06,065 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:42:06,300 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:42:06,305 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:42:06,306 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-22 14:42:06,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:42:06 BoogieIcfgContainer [2022-07-22 14:42:06,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:42:06,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:42:06,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:42:06,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:42:06,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:42:05" (1/3) ... [2022-07-22 14:42:06,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cabd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:42:06, skipping insertion in model container [2022-07-22 14:42:06,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:05" (2/3) ... [2022-07-22 14:42:06,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cabd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:42:06, skipping insertion in model container [2022-07-22 14:42:06,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:42:06" (3/3) ... [2022-07-22 14:42:06,315 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2022-07-22 14:42:06,330 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:42:06,330 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-07-22 14:42:06,392 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:42:06,400 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56708ae8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7f561fbc [2022-07-22 14:42:06,400 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-07-22 14:42:06,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 70 states have (on average 1.957142857142857) internal successors, (137), 83 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:06,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-22 14:42:06,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:06,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-22 14:42:06,410 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)] === [2022-07-22 14:42:06,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:06,415 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2022-07-22 14:42:06,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:42:06,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625696191] [2022-07-22 14:42:06,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:06,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:42:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:06,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:42:06,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625696191] [2022-07-22 14:42:06,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625696191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:06,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:06,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:42:06,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578949974] [2022-07-22 14:42:06,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:06,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:42:06,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:42:06,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:42:06,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:42:06,596 INFO L87 Difference]: Start difference. First operand has 84 states, 70 states have (on average 1.957142857142857) internal successors, (137), 83 states have internal predecessors, (137), 0 states have call successors, (0), 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) [2022-07-22 14:42:06,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:06,661 INFO L93 Difference]: Finished difference Result 182 states and 300 transitions. [2022-07-22 14:42:06,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:42:06,664 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 [2022-07-22 14:42:06,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:06,673 INFO L225 Difference]: With dead ends: 182 [2022-07-22 14:42:06,673 INFO L226 Difference]: Without dead ends: 96 [2022-07-22 14:42:06,676 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 [2022-07-22 14:42:06,680 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 85 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 104 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 [2022-07-22 14:42:06,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 104 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:42:06,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-22 14:42:06,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2022-07-22 14:42:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 77 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2022-07-22 14:42:06,715 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 4 [2022-07-22 14:42:06,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:06,716 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2022-07-22 14:42:06,716 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) [2022-07-22 14:42:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2022-07-22 14:42:06,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-22 14:42:06,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:06,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:42:06,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 14:42:06,722 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)] === [2022-07-22 14:42:06,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:06,723 INFO L85 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2022-07-22 14:42:06,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:42:06,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797966233] [2022-07-22 14:42:06,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:06,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:42:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:06,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:42:06,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797966233] [2022-07-22 14:42:06,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797966233] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:06,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:06,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:42:06,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848283492] [2022-07-22 14:42:06,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:06,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:42:06,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:42:06,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:42:06,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:42:06,791 INFO L87 Difference]: Start difference. First operand 78 states and 88 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) [2022-07-22 14:42:06,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:06,803 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-07-22 14:42:06,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:42:06,804 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 [2022-07-22 14:42:06,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:06,805 INFO L225 Difference]: With dead ends: 81 [2022-07-22 14:42:06,805 INFO L226 Difference]: Without dead ends: 79 [2022-07-22 14:42:06,806 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 [2022-07-22 14:42:06,807 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 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 [2022-07-22 14:42:06,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:42:06,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-22 14:42:06,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-07-22 14:42:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 67 states have (on average 1.328358208955224) internal successors, (89), 78 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2022-07-22 14:42:06,816 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 10 [2022-07-22 14:42:06,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:06,817 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2022-07-22 14:42:06,817 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) [2022-07-22 14:42:06,817 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2022-07-22 14:42:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-22 14:42:06,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:06,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:42:06,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 14:42:06,818 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)] === [2022-07-22 14:42:06,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:06,819 INFO L85 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2022-07-22 14:42:06,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:42:06,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518340814] [2022-07-22 14:42:06,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:06,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:42:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:06,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:06,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:42:06,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518340814] [2022-07-22 14:42:06,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518340814] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:06,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:06,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:42:06,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871830377] [2022-07-22 14:42:06,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:06,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:42:06,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:42:06,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:42:06,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:42:06,888 INFO L87 Difference]: Start difference. First operand 79 states and 89 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) [2022-07-22 14:42:06,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:06,958 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2022-07-22 14:42:06,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:42:06,958 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 [2022-07-22 14:42:06,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:06,959 INFO L225 Difference]: With dead ends: 80 [2022-07-22 14:42:06,959 INFO L226 Difference]: Without dead ends: 78 [2022-07-22 14:42:06,960 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 [2022-07-22 14:42:06,961 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:06,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 144 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:42:06,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-22 14:42:06,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-07-22 14:42:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.323076923076923) internal successors, (86), 75 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) [2022-07-22 14:42:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-07-22 14:42:06,967 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 10 [2022-07-22 14:42:06,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:06,967 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-07-22 14:42:06,967 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) [2022-07-22 14:42:06,968 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-07-22 14:42:06,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-22 14:42:06,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:06,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:42:06,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 14:42:06,969 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)] === [2022-07-22 14:42:06,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:06,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2022-07-22 14:42:06,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:42:06,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82297031] [2022-07-22 14:42:06,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:06,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:42:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:07,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:42:07,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82297031] [2022-07-22 14:42:07,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82297031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:07,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:07,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:42:07,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358209706] [2022-07-22 14:42:07,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:07,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:42:07,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:42:07,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:42:07,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:42:07,014 INFO L87 Difference]: Start difference. First operand 76 states and 86 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) [2022-07-22 14:42:07,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:07,049 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2022-07-22 14:42:07,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:42:07,050 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 [2022-07-22 14:42:07,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:07,051 INFO L225 Difference]: With dead ends: 79 [2022-07-22 14:42:07,051 INFO L226 Difference]: Without dead ends: 75 [2022-07-22 14:42:07,051 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 [2022-07-22 14:42:07,052 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 16 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 129 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 [2022-07-22 14:42:07,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 129 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:42:07,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-22 14:42:07,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-07-22 14:42:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 71 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) [2022-07-22 14:42:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2022-07-22 14:42:07,058 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 15 [2022-07-22 14:42:07,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:07,059 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2022-07-22 14:42:07,059 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) [2022-07-22 14:42:07,059 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2022-07-22 14:42:07,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 14:42:07,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:07,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:42:07,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 14:42:07,060 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)] === [2022-07-22 14:42:07,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:07,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1551589151, now seen corresponding path program 1 times [2022-07-22 14:42:07,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:42:07,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362342448] [2022-07-22 14:42:07,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:07,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:42:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:07,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:42:07,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362342448] [2022-07-22 14:42:07,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362342448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:07,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:07,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:42:07,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236771645] [2022-07-22 14:42:07,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:07,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:42:07,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:42:07,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:42:07,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:42:07,129 INFO L87 Difference]: Start difference. First operand 72 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) [2022-07-22 14:42:07,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:07,217 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2022-07-22 14:42:07,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:42:07,217 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 [2022-07-22 14:42:07,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:07,218 INFO L225 Difference]: With dead ends: 190 [2022-07-22 14:42:07,218 INFO L226 Difference]: Without dead ends: 126 [2022-07-22 14:42:07,219 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 [2022-07-22 14:42:07,220 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 57 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:07,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 190 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:42:07,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-22 14:42:07,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 74. [2022-07-22 14:42:07,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 73 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) [2022-07-22 14:42:07,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2022-07-22 14:42:07,227 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 16 [2022-07-22 14:42:07,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:07,227 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2022-07-22 14:42:07,227 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) [2022-07-22 14:42:07,228 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2022-07-22 14:42:07,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 14:42:07,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:07,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:42:07,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 14:42:07,229 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)] === [2022-07-22 14:42:07,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:07,229 INFO L85 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2022-07-22 14:42:07,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:42:07,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200754679] [2022-07-22 14:42:07,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:07,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:42:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:07,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:07,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:42:07,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200754679] [2022-07-22 14:42:07,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200754679] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:07,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:07,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:42:07,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686242359] [2022-07-22 14:42:07,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:07,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:42:07,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:42:07,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:42:07,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:42:07,267 INFO L87 Difference]: Start difference. First operand 74 states and 84 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) [2022-07-22 14:42:07,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:07,328 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2022-07-22 14:42:07,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:42:07,329 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 [2022-07-22 14:42:07,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:07,331 INFO L225 Difference]: With dead ends: 134 [2022-07-22 14:42:07,331 INFO L226 Difference]: Without dead ends: 114 [2022-07-22 14:42:07,331 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 [2022-07-22 14:42:07,335 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 134 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:07,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 120 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:42:07,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-22 14:42:07,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 73. [2022-07-22 14:42:07,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 65 states have (on average 1.2769230769230768) 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) [2022-07-22 14:42:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-07-22 14:42:07,358 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 16 [2022-07-22 14:42:07,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:07,359 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-07-22 14:42:07,359 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) [2022-07-22 14:42:07,359 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-07-22 14:42:07,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 14:42:07,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:07,361 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] [2022-07-22 14:42:07,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 14:42:07,362 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)] === [2022-07-22 14:42:07,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:07,362 INFO L85 PathProgramCache]: Analyzing trace with hash -940628020, now seen corresponding path program 1 times [2022-07-22 14:42:07,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:42:07,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142433051] [2022-07-22 14:42:07,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:07,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:42:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:07,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:42:07,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142433051] [2022-07-22 14:42:07,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142433051] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:07,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:07,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:42:07,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498604194] [2022-07-22 14:42:07,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:07,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:42:07,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:42:07,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:42:07,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:42:07,441 INFO L87 Difference]: Start difference. First operand 73 states and 83 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) [2022-07-22 14:42:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:07,459 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2022-07-22 14:42:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:42:07,459 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 [2022-07-22 14:42:07,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:07,460 INFO L225 Difference]: With dead ends: 139 [2022-07-22 14:42:07,460 INFO L226 Difference]: Without dead ends: 97 [2022-07-22 14:42:07,461 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 [2022-07-22 14:42:07,462 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 24 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:07,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 151 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:42:07,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-22 14:42:07,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2022-07-22 14:42:07,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 75 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) [2022-07-22 14:42:07,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2022-07-22 14:42:07,473 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 20 [2022-07-22 14:42:07,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:07,473 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2022-07-22 14:42:07,474 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) [2022-07-22 14:42:07,474 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2022-07-22 14:42:07,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-22 14:42:07,475 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:07,475 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] [2022-07-22 14:42:07,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 14:42:07,475 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)] === [2022-07-22 14:42:07,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:07,477 INFO L85 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2022-07-22 14:42:07,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:42:07,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870132789] [2022-07-22 14:42:07,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:07,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:42:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:07,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:42:07,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870132789] [2022-07-22 14:42:07,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870132789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:07,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:07,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:42:07,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8841906] [2022-07-22 14:42:07,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:07,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:42:07,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:42:07,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:42:07,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:42:07,536 INFO L87 Difference]: Start difference. First operand 76 states and 87 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) [2022-07-22 14:42:07,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:07,547 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2022-07-22 14:42:07,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:42:07,547 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 [2022-07-22 14:42:07,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:07,548 INFO L225 Difference]: With dead ends: 76 [2022-07-22 14:42:07,548 INFO L226 Difference]: Without dead ends: 74 [2022-07-22 14:42:07,548 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 [2022-07-22 14:42:07,549 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 13 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:07,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 132 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:42:07,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-22 14:42:07,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-07-22 14:42:07,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 73 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) [2022-07-22 14:42:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2022-07-22 14:42:07,553 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 21 [2022-07-22 14:42:07,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:07,554 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2022-07-22 14:42:07,554 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) [2022-07-22 14:42:07,554 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-07-22 14:42:07,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-22 14:42:07,555 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:07,555 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] [2022-07-22 14:42:07,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 14:42:07,555 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)] === [2022-07-22 14:42:07,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:07,556 INFO L85 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2022-07-22 14:42:07,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:42:07,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500293715] [2022-07-22 14:42:07,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:07,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:42:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:07,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:42:07,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500293715] [2022-07-22 14:42:07,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500293715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:07,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:07,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:42:07,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484042365] [2022-07-22 14:42:07,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:07,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:42:07,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:42:07,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:42:07,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:42:07,605 INFO L87 Difference]: Start difference. First operand 74 states and 85 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) [2022-07-22 14:42:07,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:07,651 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2022-07-22 14:42:07,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:42:07,651 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 [2022-07-22 14:42:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:07,652 INFO L225 Difference]: With dead ends: 75 [2022-07-22 14:42:07,652 INFO L226 Difference]: Without dead ends: 73 [2022-07-22 14:42:07,652 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 [2022-07-22 14:42:07,653 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:07,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 116 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:42:07,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-22 14:42:07,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2022-07-22 14:42:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 71 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) [2022-07-22 14:42:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2022-07-22 14:42:07,657 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 23 [2022-07-22 14:42:07,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:07,658 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2022-07-22 14:42:07,658 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) [2022-07-22 14:42:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-07-22 14:42:07,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 14:42:07,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:07,659 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] [2022-07-22 14:42:07,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 14:42:07,659 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)] === [2022-07-22 14:42:07,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:07,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2022-07-22 14:42:07,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:42:07,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017800815] [2022-07-22 14:42:07,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:07,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:42:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:07,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:07,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:42:07,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017800815] [2022-07-22 14:42:07,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017800815] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:07,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:07,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 14:42:07,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203250807] [2022-07-22 14:42:07,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:07,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 14:42:07,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:42:07,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 14:42:07,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:42:07,746 INFO L87 Difference]: Start difference. First operand 72 states and 83 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) [2022-07-22 14:42:07,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:07,957 INFO L93 Difference]: Finished difference Result 202 states and 231 transitions. [2022-07-22 14:42:07,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 14:42:07,957 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 [2022-07-22 14:42:07,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:07,958 INFO L225 Difference]: With dead ends: 202 [2022-07-22 14:42:07,958 INFO L226 Difference]: Without dead ends: 159 [2022-07-22 14:42:07,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-07-22 14:42:07,959 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 310 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:07,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 244 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:42:07,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-22 14:42:07,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 94. [2022-07-22 14:42:07,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 93 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:07,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2022-07-22 14:42:07,965 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 24 [2022-07-22 14:42:07,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:07,965 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2022-07-22 14:42:07,965 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) [2022-07-22 14:42:07,965 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2022-07-22 14:42:07,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 14:42:07,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:07,966 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] [2022-07-22 14:42:07,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 14:42:07,966 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)] === [2022-07-22 14:42:07,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:07,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2022-07-22 14:42:07,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:42:07,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129586335] [2022-07-22 14:42:07,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:07,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:42:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:08,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:42:08,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129586335] [2022-07-22 14:42:08,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129586335] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:08,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:08,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 14:42:08,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765226657] [2022-07-22 14:42:08,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:08,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 14:42:08,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:42:08,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 14:42:08,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:42:08,246 INFO L87 Difference]: Start difference. First operand 94 states and 109 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) [2022-07-22 14:42:08,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:08,621 INFO L93 Difference]: Finished difference Result 249 states and 280 transitions. [2022-07-22 14:42:08,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 14:42:08,622 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 [2022-07-22 14:42:08,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:08,624 INFO L225 Difference]: With dead ends: 249 [2022-07-22 14:42:08,624 INFO L226 Difference]: Without dead ends: 247 [2022-07-22 14:42:08,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-22 14:42:08,625 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 253 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:08,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 426 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 14:42:08,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-22 14:42:08,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 106. [2022-07-22 14:42:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 100 states have (on average 1.23) internal successors, (123), 105 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2022-07-22 14:42:08,634 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 24 [2022-07-22 14:42:08,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:08,635 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2022-07-22 14:42:08,635 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) [2022-07-22 14:42:08,635 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2022-07-22 14:42:08,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-22 14:42:08,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:08,639 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] [2022-07-22 14:42:08,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 14:42:08,640 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)] === [2022-07-22 14:42:08,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:08,640 INFO L85 PathProgramCache]: Analyzing trace with hash -545310703, now seen corresponding path program 1 times [2022-07-22 14:42:08,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:42:08,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514861511] [2022-07-22 14:42:08,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:08,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:42:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:42:08,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:42:08,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514861511] [2022-07-22 14:42:08,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514861511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:08,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:08,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 14:42:08,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129557285] [2022-07-22 14:42:08,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:08,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 14:42:08,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:42:08,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 14:42:08,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:42:08,688 INFO L87 Difference]: Start difference. First operand 106 states and 123 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) [2022-07-22 14:42:08,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:08,762 INFO L93 Difference]: Finished difference Result 158 states and 182 transitions. [2022-07-22 14:42:08,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 14:42:08,763 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 [2022-07-22 14:42:08,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:08,764 INFO L225 Difference]: With dead ends: 158 [2022-07-22 14:42:08,764 INFO L226 Difference]: Without dead ends: 140 [2022-07-22 14:42:08,764 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 [2022-07-22 14:42:08,765 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 61 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:08,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 193 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:42:08,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-22 14:42:08,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2022-07-22 14:42:08,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 126 states have (on average 1.246031746031746) internal successors, (157), 131 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 157 transitions. [2022-07-22 14:42:08,772 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 157 transitions. Word has length 26 [2022-07-22 14:42:08,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:08,772 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 157 transitions. [2022-07-22 14:42:08,772 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) [2022-07-22 14:42:08,772 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 157 transitions. [2022-07-22 14:42:08,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-22 14:42:08,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:08,773 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] [2022-07-22 14:42:08,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 14:42:08,774 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)] === [2022-07-22 14:42:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:08,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1566334865, now seen corresponding path program 1 times [2022-07-22 14:42:08,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:42:08,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916718213] [2022-07-22 14:42:08,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:08,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:42:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:42:08,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:42:08,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916718213] [2022-07-22 14:42:08,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916718213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:08,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:08,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:42:08,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428552248] [2022-07-22 14:42:08,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:08,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:42:08,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:42:08,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:42:08,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:42:08,855 INFO L87 Difference]: Start difference. First operand 132 states and 157 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) [2022-07-22 14:42:08,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:08,892 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2022-07-22 14:42:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:42:08,893 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 [2022-07-22 14:42:08,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:08,894 INFO L225 Difference]: With dead ends: 132 [2022-07-22 14:42:08,894 INFO L226 Difference]: Without dead ends: 130 [2022-07-22 14:42:08,894 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 [2022-07-22 14:42:08,896 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 51 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 78 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 [2022-07-22 14:42:08,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 78 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:42:08,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-22 14:42:08,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-22 14:42:08,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.24) internal successors, (155), 129 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) [2022-07-22 14:42:08,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2022-07-22 14:42:08,904 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 26 [2022-07-22 14:42:08,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:08,904 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2022-07-22 14:42:08,905 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) [2022-07-22 14:42:08,905 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2022-07-22 14:42:08,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 14:42:08,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:08,907 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] [2022-07-22 14:42:08,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 14:42:08,908 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)] === [2022-07-22 14:42:08,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:08,909 INFO L85 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2022-07-22 14:42:08,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:42:08,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349205792] [2022-07-22 14:42:08,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:08,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:42:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:09,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:42:09,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349205792] [2022-07-22 14:42:09,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349205792] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:09,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:09,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 14:42:09,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313844918] [2022-07-22 14:42:09,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:09,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 14:42:09,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:42:09,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 14:42:09,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:42:09,075 INFO L87 Difference]: Start difference. First operand 130 states and 155 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) [2022-07-22 14:42:09,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:09,347 INFO L93 Difference]: Finished difference Result 290 states and 338 transitions. [2022-07-22 14:42:09,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 14:42:09,348 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 [2022-07-22 14:42:09,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:09,349 INFO L225 Difference]: With dead ends: 290 [2022-07-22 14:42:09,349 INFO L226 Difference]: Without dead ends: 288 [2022-07-22 14:42:09,349 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 [2022-07-22 14:42:09,350 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 258 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:09,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 390 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 14:42:09,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-07-22 14:42:09,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 133. [2022-07-22 14:42:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.234375) internal successors, (158), 132 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:09,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 158 transitions. [2022-07-22 14:42:09,360 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 158 transitions. Word has length 27 [2022-07-22 14:42:09,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:09,360 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 158 transitions. [2022-07-22 14:42:09,361 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) [2022-07-22 14:42:09,361 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 158 transitions. [2022-07-22 14:42:09,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 14:42:09,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:09,362 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] [2022-07-22 14:42:09,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 14:42:09,362 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)] === [2022-07-22 14:42:09,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:09,363 INFO L85 PathProgramCache]: Analyzing trace with hash 2026653164, now seen corresponding path program 1 times [2022-07-22 14:42:09,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:42:09,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374598657] [2022-07-22 14:42:09,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:09,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:42:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:09,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:42:09,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374598657] [2022-07-22 14:42:09,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374598657] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:42:09,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297593028] [2022-07-22 14:42:09,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:09,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:42:09,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:42:09,436 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) [2022-07-22 14:42:09,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 14:42:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:09,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-22 14:42:09,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:09,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:09,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:09,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:09,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:09,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:09,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:09,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:09,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:09,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:42:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:09,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297593028] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:42:09,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:42:09,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-07-22 14:42:09,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85655419] [2022-07-22 14:42:09,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:42:09,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 14:42:09,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:42:09,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 14:42:09,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:42:09,824 INFO L87 Difference]: Start difference. First operand 133 states and 158 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) [2022-07-22 14:42:09,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:09,969 INFO L93 Difference]: Finished difference Result 220 states and 257 transitions. [2022-07-22 14:42:09,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 14:42:09,970 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 [2022-07-22 14:42:09,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:09,971 INFO L225 Difference]: With dead ends: 220 [2022-07-22 14:42:09,971 INFO L226 Difference]: Without dead ends: 158 [2022-07-22 14:42:09,971 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 [2022-07-22 14:42:09,972 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 121 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:09,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 213 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:42:09,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-22 14:42:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 135. [2022-07-22 14:42:09,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.2153846153846153) internal successors, (158), 134 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2022-07-22 14:42:09,981 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 29 [2022-07-22 14:42:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:09,982 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2022-07-22 14:42:09,982 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) [2022-07-22 14:42:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2022-07-22 14:42:09,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 14:42:09,982 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:09,983 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] [2022-07-22 14:42:10,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 14:42:10,207 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 [2022-07-22 14:42:10,207 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)] === [2022-07-22 14:42:10,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:10,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2133518130, now seen corresponding path program 1 times [2022-07-22 14:42:10,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:42:10,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094205440] [2022-07-22 14:42:10,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:10,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:42:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:10,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:10,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:42:10,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094205440] [2022-07-22 14:42:10,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094205440] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:10,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:10,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 14:42:10,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797151798] [2022-07-22 14:42:10,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:10,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 14:42:10,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:42:10,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 14:42:10,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-22 14:42:10,384 INFO L87 Difference]: Start difference. First operand 135 states and 158 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) [2022-07-22 14:42:10,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:10,498 INFO L93 Difference]: Finished difference Result 178 states and 200 transitions. [2022-07-22 14:42:10,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 14:42:10,498 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 [2022-07-22 14:42:10,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:10,499 INFO L225 Difference]: With dead ends: 178 [2022-07-22 14:42:10,499 INFO L226 Difference]: Without dead ends: 158 [2022-07-22 14:42:10,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:42:10,500 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 158 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:10,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 217 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:42:10,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-22 14:42:10,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 134. [2022-07-22 14:42:10,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.2093023255813953) internal successors, (156), 133 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2022-07-22 14:42:10,521 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 29 [2022-07-22 14:42:10,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:10,521 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2022-07-22 14:42:10,521 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) [2022-07-22 14:42:10,521 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2022-07-22 14:42:10,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 14:42:10,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:10,522 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] [2022-07-22 14:42:10,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 14:42:10,522 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-22 14:42:10,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:10,523 INFO L85 PathProgramCache]: Analyzing trace with hash 830518973, now seen corresponding path program 1 times [2022-07-22 14:42:10,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:42:10,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663988098] [2022-07-22 14:42:10,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:10,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:42:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:10,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:42:10,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663988098] [2022-07-22 14:42:10,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663988098] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:42:10,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568369682] [2022-07-22 14:42:10,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:10,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:42:10,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:42:10,592 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) [2022-07-22 14:42:10,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 14:42:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:10,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 14:42:10,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:10,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:10,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:10,716 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-22 14:42:10,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-22 14:42:10,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:10,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:10,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:10,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:10,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:42:10,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:42:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:42:10,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568369682] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:42:10,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:42:10,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2022-07-22 14:42:10,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440125880] [2022-07-22 14:42:10,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:42:10,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 14:42:10,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:42:10,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 14:42:10,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 14:42:10,855 INFO L87 Difference]: Start difference. First operand 134 states and 156 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) [2022-07-22 14:42:10,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:10,989 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2022-07-22 14:42:10,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 14:42:10,989 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 [2022-07-22 14:42:10,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:10,990 INFO L225 Difference]: With dead ends: 223 [2022-07-22 14:42:10,990 INFO L226 Difference]: Without dead ends: 192 [2022-07-22 14:42:10,991 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 [2022-07-22 14:42:10,991 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 99 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:10,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 306 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:42:10,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-22 14:42:10,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 151. [2022-07-22 14:42:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.2397260273972603) internal successors, (181), 150 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 181 transitions. [2022-07-22 14:42:10,998 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 181 transitions. Word has length 32 [2022-07-22 14:42:10,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:10,998 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 181 transitions. [2022-07-22 14:42:10,998 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) [2022-07-22 14:42:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 181 transitions. [2022-07-22 14:42:10,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 14:42:10,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:10,999 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, 1] [2022-07-22 14:42:11,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 14:42:11,215 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,SelfDestructingSolverStorable16 [2022-07-22 14:42:11,216 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-22 14:42:11,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:11,216 INFO L85 PathProgramCache]: Analyzing trace with hash -60835504, now seen corresponding path program 1 times [2022-07-22 14:42:11,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:42:11,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556435444] [2022-07-22 14:42:11,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:11,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:42:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:11,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:42:11,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556435444] [2022-07-22 14:42:11,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556435444] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:11,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:11,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:42:11,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059636133] [2022-07-22 14:42:11,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:11,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:42:11,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:42:11,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:42:11,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:42:11,300 INFO L87 Difference]: Start difference. First operand 151 states and 181 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:11,317 INFO L93 Difference]: Finished difference Result 310 states and 380 transitions. [2022-07-22 14:42:11,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:42:11,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 [2022-07-22 14:42:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:11,319 INFO L225 Difference]: With dead ends: 310 [2022-07-22 14:42:11,319 INFO L226 Difference]: Without dead ends: 228 [2022-07-22 14:42:11,319 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 [2022-07-22 14:42:11,320 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 26 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:11,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 161 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:42:11,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-22 14:42:11,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 188. [2022-07-22 14:42:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 183 states have (on average 1.2404371584699454) internal successors, (227), 187 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 227 transitions. [2022-07-22 14:42:11,331 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 227 transitions. Word has length 32 [2022-07-22 14:42:11,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:11,332 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 227 transitions. [2022-07-22 14:42:11,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:11,332 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 227 transitions. [2022-07-22 14:42:11,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-22 14:42:11,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:11,333 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] [2022-07-22 14:42:11,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-22 14:42:11,333 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)] === [2022-07-22 14:42:11,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:11,334 INFO L85 PathProgramCache]: Analyzing trace with hash -431498650, now seen corresponding path program 1 times [2022-07-22 14:42:11,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:42:11,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700568972] [2022-07-22 14:42:11,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:11,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:42:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:11,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:11,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:42:11,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700568972] [2022-07-22 14:42:11,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700568972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:11,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:11,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 14:42:11,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218851390] [2022-07-22 14:42:11,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:11,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 14:42:11,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:42:11,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 14:42:11,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:42:11,439 INFO L87 Difference]: Start difference. First operand 188 states and 227 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:11,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:11,517 INFO L93 Difference]: Finished difference Result 306 states and 371 transitions. [2022-07-22 14:42:11,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 14:42:11,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 [2022-07-22 14:42:11,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:11,518 INFO L225 Difference]: With dead ends: 306 [2022-07-22 14:42:11,518 INFO L226 Difference]: Without dead ends: 197 [2022-07-22 14:42:11,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-22 14:42:11,519 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 13 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:11,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 237 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:42:11,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-22 14:42:11,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 190. [2022-07-22 14:42:11,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 185 states have (on average 1.2378378378378379) internal successors, (229), 189 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:11,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 229 transitions. [2022-07-22 14:42:11,525 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 229 transitions. Word has length 36 [2022-07-22 14:42:11,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:11,525 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 229 transitions. [2022-07-22 14:42:11,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:11,526 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 229 transitions. [2022-07-22 14:42:11,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-22 14:42:11,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:11,526 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] [2022-07-22 14:42:11,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-22 14:42:11,526 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)] === [2022-07-22 14:42:11,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:11,526 INFO L85 PathProgramCache]: Analyzing trace with hash 589569704, now seen corresponding path program 1 times [2022-07-22 14:42:11,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:42:11,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127478601] [2022-07-22 14:42:11,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:11,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:42:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:11,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:42:11,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127478601] [2022-07-22 14:42:11,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127478601] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:42:11,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498024150] [2022-07-22 14:42:11,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:11,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:42:11,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:42:11,732 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) [2022-07-22 14:42:11,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 14:42:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:11,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-22 14:42:11,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:11,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:11,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:11,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:11,988 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-22 14:42:11,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:11,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:11,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:12,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:12,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:12,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:12,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:12,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:12,210 INFO L356 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-07-22 14:42:12,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 143 treesize of output 87 [2022-07-22 14:42:12,273 INFO L356 Elim1Store]: treesize reduction 118, result has 29.8 percent of original size [2022-07-22 14:42:12,276 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-22 14:42:12,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 14:42:12,476 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 [2022-07-22 14:42:12,477 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_3 input size 89 context size 89 output size 89 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:298) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:284) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 14:42:12,481 INFO L158 Benchmark]: Toolchain (without parser) took 7130.78ms. Allocated memory was 117.4MB in the beginning and 174.1MB in the end (delta: 56.6MB). Free memory was 87.9MB in the beginning and 87.2MB in the end (delta: 722.7kB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. [2022-07-22 14:42:12,481 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:42:12,482 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.48ms. Allocated memory was 117.4MB in the beginning and 144.7MB in the end (delta: 27.3MB). Free memory was 87.6MB in the beginning and 108.2MB in the end (delta: -20.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 14:42:12,482 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.90ms. Allocated memory is still 144.7MB. Free memory was 108.2MB in the beginning and 105.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:42:12,482 INFO L158 Benchmark]: Boogie Preprocessor took 63.17ms. Allocated memory is still 144.7MB. Free memory was 105.6MB in the beginning and 103.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:42:12,482 INFO L158 Benchmark]: RCFGBuilder took 414.11ms. Allocated memory is still 144.7MB. Free memory was 103.4MB in the beginning and 83.9MB in the end (delta: 19.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-22 14:42:12,482 INFO L158 Benchmark]: TraceAbstraction took 6171.49ms. Allocated memory was 144.7MB in the beginning and 174.1MB in the end (delta: 29.4MB). Free memory was 83.6MB in the beginning and 87.2MB in the end (delta: -3.6MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2022-07-22 14:42:12,484 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.48ms. Allocated memory was 117.4MB in the beginning and 144.7MB in the end (delta: 27.3MB). Free memory was 87.6MB in the beginning and 108.2MB in the end (delta: -20.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.90ms. Allocated memory is still 144.7MB. Free memory was 108.2MB in the beginning and 105.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.17ms. Allocated memory is still 144.7MB. Free memory was 105.6MB in the beginning and 103.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 414.11ms. Allocated memory is still 144.7MB. Free memory was 103.4MB in the beginning and 83.9MB in the end (delta: 19.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6171.49ms. Allocated memory was 144.7MB in the beginning and 174.1MB in the end (delta: 29.4MB). Free memory was 83.6MB in the beginning and 87.2MB in the end (delta: -3.6MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_3 input size 89 context size 89 output size 89 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_3 input size 89 context size 89 output size 89: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 14:42:12,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:42:14,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:42:14,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:42:14,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:42:14,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:42:14,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:42:14,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:42:14,652 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:42:14,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:42:14,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:42:14,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:42:14,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:42:14,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:42:14,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:42:14,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:42:14,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:42:14,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:42:14,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:42:14,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:42:14,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:42:14,664 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:42:14,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:42:14,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:42:14,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:42:14,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:42:14,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:42:14,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:42:14,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:42:14,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:42:14,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:42:14,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:42:14,690 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:42:14,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:42:14,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:42:14,692 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:42:14,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:42:14,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:42:14,695 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:42:14,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:42:14,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:42:14,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:42:14,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:42:14,701 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 14:42:14,725 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:42:14,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:42:14,726 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:42:14,726 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:42:14,727 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:42:14,727 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:42:14,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:42:14,728 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:42:14,728 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:42:14,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:42:14,729 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:42:14,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:42:14,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:42:14,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:42:14,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:42:14,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:42:14,730 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 14:42:14,731 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 14:42:14,731 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 14:42:14,731 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:42:14,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:42:14,731 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:42:14,732 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:42:14,732 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:42:14,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:42:14,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:42:14,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:42:14,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:42:14,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:42:14,733 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:42:14,733 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 14:42:14,733 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 14:42:14,733 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:42:14,734 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:42:14,734 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:42:14,734 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 14:42:14,734 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2022-07-22 14:42:14,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:42:15,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:42:15,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:42:15,017 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:42:15,017 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:42:15,018 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-2.i [2022-07-22 14:42:15,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805380133/cd4a210051f940d292b19bec9ee34759/FLAG8f4a43669 [2022-07-22 14:42:15,514 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:42:15,515 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2022-07-22 14:42:15,524 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805380133/cd4a210051f940d292b19bec9ee34759/FLAG8f4a43669 [2022-07-22 14:42:15,543 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805380133/cd4a210051f940d292b19bec9ee34759 [2022-07-22 14:42:15,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:42:15,548 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:42:15,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:42:15,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:42:15,551 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:42:15,552 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:42:15" (1/1) ... [2022-07-22 14:42:15,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fbd9378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:15, skipping insertion in model container [2022-07-22 14:42:15,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:42:15" (1/1) ... [2022-07-22 14:42:15,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:42:15,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:42:15,845 WARN L230 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-2.i[22034,22047] [2022-07-22 14:42:15,856 WARN L230 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-2.i[22307,22320] [2022-07-22 14:42:15,860 WARN L230 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-2.i[22516,22529] [2022-07-22 14:42:15,861 WARN L230 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-2.i[22586,22599] [2022-07-22 14:42:15,867 WARN L230 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-2.i[22853,22866] [2022-07-22 14:42:15,868 WARN L230 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-2.i[22961,22974] [2022-07-22 14:42:15,873 WARN L230 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-2.i[23192,23205] [2022-07-22 14:42:15,875 WARN L230 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-2.i[23272,23285] [2022-07-22 14:42:15,876 WARN L230 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-2.i[23351,23364] [2022-07-22 14:42:15,878 WARN L230 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-2.i[23484,23497] [2022-07-22 14:42:15,880 WARN L230 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-2.i[23662,23675] [2022-07-22 14:42:15,882 WARN L230 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-2.i[23740,23753] [2022-07-22 14:42:15,883 WARN L230 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-2.i[23817,23830] [2022-07-22 14:42:15,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:42:15,900 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:42:15,933 WARN L230 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-2.i[22034,22047] [2022-07-22 14:42:15,943 WARN L230 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-2.i[22307,22320] [2022-07-22 14:42:15,945 WARN L230 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-2.i[22516,22529] [2022-07-22 14:42:15,947 WARN L230 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-2.i[22586,22599] [2022-07-22 14:42:15,949 WARN L230 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-2.i[22853,22866] [2022-07-22 14:42:15,951 WARN L230 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-2.i[22961,22974] [2022-07-22 14:42:15,953 WARN L230 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-2.i[23192,23205] [2022-07-22 14:42:15,954 WARN L230 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-2.i[23272,23285] [2022-07-22 14:42:15,956 WARN L230 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-2.i[23351,23364] [2022-07-22 14:42:15,958 WARN L230 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-2.i[23484,23497] [2022-07-22 14:42:15,962 WARN L230 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-2.i[23662,23675] [2022-07-22 14:42:15,963 WARN L230 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-2.i[23740,23753] [2022-07-22 14:42:15,963 WARN L230 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-2.i[23817,23830] [2022-07-22 14:42:15,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:42:15,987 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:42:15,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:15 WrapperNode [2022-07-22 14:42:15,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:42:15,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:42:15,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:42:15,989 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:42:15,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:15" (1/1) ... [2022-07-22 14:42:16,024 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:15" (1/1) ... [2022-07-22 14:42:16,055 INFO L137 Inliner]: procedures = 120, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 223 [2022-07-22 14:42:16,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:42:16,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:42:16,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:42:16,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:42:16,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:15" (1/1) ... [2022-07-22 14:42:16,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:15" (1/1) ... [2022-07-22 14:42:16,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:15" (1/1) ... [2022-07-22 14:42:16,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:15" (1/1) ... [2022-07-22 14:42:16,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:15" (1/1) ... [2022-07-22 14:42:16,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:15" (1/1) ... [2022-07-22 14:42:16,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:15" (1/1) ... [2022-07-22 14:42:16,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:42:16,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:42:16,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:42:16,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:42:16,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:15" (1/1) ... [2022-07-22 14:42:16,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:42:16,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:42:16,122 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) [2022-07-22 14:42:16,132 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 [2022-07-22 14:42:16,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:42:16,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:42:16,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:42:16,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:42:16,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 14:42:16,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 14:42:16,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:42:16,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:42:16,292 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:42:16,294 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:42:16,763 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:42:16,767 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:42:16,767 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-22 14:42:16,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:42:16 BoogieIcfgContainer [2022-07-22 14:42:16,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:42:16,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:42:16,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:42:16,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:42:16,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:42:15" (1/3) ... [2022-07-22 14:42:16,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7731c409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:42:16, skipping insertion in model container [2022-07-22 14:42:16,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:42:15" (2/3) ... [2022-07-22 14:42:16,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7731c409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:42:16, skipping insertion in model container [2022-07-22 14:42:16,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:42:16" (3/3) ... [2022-07-22 14:42:16,784 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2022-07-22 14:42:16,796 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:42:16,802 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-07-22 14:42:16,846 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:42:16,851 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1ed3364d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@32883cb8 [2022-07-22 14:42:16,851 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-07-22 14:42:16,854 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 67 states have (on average 2.0) internal successors, (134), 80 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) [2022-07-22 14:42:16,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-22 14:42:16,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:16,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-22 14:42:16,858 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)] === [2022-07-22 14:42:16,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:16,862 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2022-07-22 14:42:16,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:16,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523625145] [2022-07-22 14:42:16,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:16,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:16,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:16,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:16,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-22 14:42:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:16,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 14:42:16,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:16,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:16,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:42:16,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:42:16,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1523625145] [2022-07-22 14:42:16,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1523625145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:16,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:16,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:42:16,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008620743] [2022-07-22 14:42:16,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:17,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:42:17,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:42:17,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:42:17,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:42:17,028 INFO L87 Difference]: Start difference. First operand has 81 states, 67 states have (on average 2.0) internal successors, (134), 80 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) 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) [2022-07-22 14:42:17,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:17,107 INFO L93 Difference]: Finished difference Result 176 states and 294 transitions. [2022-07-22 14:42:17,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:42:17,110 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 [2022-07-22 14:42:17,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:17,116 INFO L225 Difference]: With dead ends: 176 [2022-07-22 14:42:17,116 INFO L226 Difference]: Without dead ends: 93 [2022-07-22 14:42:17,118 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 [2022-07-22 14:42:17,122 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 82 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 101 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 [2022-07-22 14:42:17,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 101 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:42:17,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-22 14:42:17,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2022-07-22 14:42:17,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 63 states have (on average 1.3492063492063493) 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) [2022-07-22 14:42:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2022-07-22 14:42:17,158 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 4 [2022-07-22 14:42:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:17,159 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2022-07-22 14:42:17,159 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) [2022-07-22 14:42:17,159 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2022-07-22 14:42:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 14:42:17,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:17,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:42:17,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-22 14:42:17,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:42:17,367 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)] === [2022-07-22 14:42:17,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:17,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1534452756, now seen corresponding path program 1 times [2022-07-22 14:42:17,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:17,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127419450] [2022-07-22 14:42:17,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:17,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:17,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:17,374 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:17,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-22 14:42:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:17,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 14:42:17,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:17,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:17,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:17,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:42:17,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:42:17,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127419450] [2022-07-22 14:42:17,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127419450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:17,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:17,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:42:17,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288310688] [2022-07-22 14:42:17,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:17,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:42:17,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:42:17,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:42:17,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:42:17,561 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:17,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:17,779 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2022-07-22 14:42:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:42:17,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-22 14:42:17,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:17,781 INFO L225 Difference]: With dead ends: 198 [2022-07-22 14:42:17,781 INFO L226 Difference]: Without dead ends: 130 [2022-07-22 14:42:17,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:42:17,782 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 58 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:17,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 198 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 14:42:17,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-22 14:42:17,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2022-07-22 14:42:17,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 76 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) [2022-07-22 14:42:17,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2022-07-22 14:42:17,789 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 9 [2022-07-22 14:42:17,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:17,789 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2022-07-22 14:42:17,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:17,789 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2022-07-22 14:42:17,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 14:42:17,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:17,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:42:17,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-22 14:42:17,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:42:17,998 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)] === [2022-07-22 14:42:17,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:17,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1534454678, now seen corresponding path program 1 times [2022-07-22 14:42:17,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:18,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531835730] [2022-07-22 14:42:18,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:18,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:18,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:18,018 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:18,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-22 14:42:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:18,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 14:42:18,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:18,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:18,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:18,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:18,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:42:18,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:42:18,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531835730] [2022-07-22 14:42:18,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531835730] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:18,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:18,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:42:18,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386340265] [2022-07-22 14:42:18,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:18,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:42:18,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:42:18,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:42:18,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:42:18,132 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:18,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:18,322 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2022-07-22 14:42:18,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:42:18,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-22 14:42:18,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:18,324 INFO L225 Difference]: With dead ends: 131 [2022-07-22 14:42:18,324 INFO L226 Difference]: Without dead ends: 129 [2022-07-22 14:42:18,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:42:18,325 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 55 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:18,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 196 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 14:42:18,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-22 14:42:18,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 78. [2022-07-22 14:42:18,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 77 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2022-07-22 14:42:18,332 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 9 [2022-07-22 14:42:18,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:18,332 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2022-07-22 14:42:18,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:18,332 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2022-07-22 14:42:18,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 14:42:18,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:18,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:42:18,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-22 14:42:18,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:42:18,534 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-22 14:42:18,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:18,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1536301720, now seen corresponding path program 1 times [2022-07-22 14:42:18,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:18,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985598929] [2022-07-22 14:42:18,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:18,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:18,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:18,537 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:18,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-22 14:42:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:18,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 14:42:18,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:18,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:18,746 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:42:18,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:42:18,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985598929] [2022-07-22 14:42:18,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985598929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:18,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:18,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:42:18,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224979323] [2022-07-22 14:42:18,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:18,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:42:18,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:42:18,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:42:18,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:42:18,749 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:18,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:18,946 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2022-07-22 14:42:18,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:42:18,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-22 14:42:18,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:18,947 INFO L225 Difference]: With dead ends: 79 [2022-07-22 14:42:18,947 INFO L226 Difference]: Without dead ends: 77 [2022-07-22 14:42:18,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:42:18,948 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:18,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 216 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 14:42:18,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-22 14:42:18,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-07-22 14:42:18,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.328125) 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) [2022-07-22 14:42:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2022-07-22 14:42:18,952 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 9 [2022-07-22 14:42:18,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:18,952 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2022-07-22 14:42:18,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:18,952 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2022-07-22 14:42:18,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 14:42:18,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:18,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:42:18,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-22 14:42:19,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:42:19,154 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-22 14:42:19,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:19,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1743237117, now seen corresponding path program 1 times [2022-07-22 14:42:19,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:19,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228428073] [2022-07-22 14:42:19,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:19,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:19,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:19,176 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:19,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-22 14:42:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:19,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 14:42:19,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:19,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:42:19,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:42:19,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228428073] [2022-07-22 14:42:19,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228428073] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:19,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:19,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:42:19,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946605939] [2022-07-22 14:42:19,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:19,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:42:19,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:42:19,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:42:19,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:42:19,323 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:19,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:19,400 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-07-22 14:42:19,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:42:19,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-22 14:42:19,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:19,401 INFO L225 Difference]: With dead ends: 77 [2022-07-22 14:42:19,401 INFO L226 Difference]: Without dead ends: 73 [2022-07-22 14:42:19,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:42:19,402 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 14 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 123 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.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:19,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 123 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:42:19,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-22 14:42:19,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-07-22 14:42:19,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.3064516129032258) 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) [2022-07-22 14:42:19,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-07-22 14:42:19,406 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 13 [2022-07-22 14:42:19,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:19,407 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-07-22 14:42:19,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:19,407 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-07-22 14:42:19,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 14:42:19,407 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:19,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:42:19,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-22 14:42:19,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:42:19,616 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)] === [2022-07-22 14:42:19,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:19,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1794227426, now seen corresponding path program 1 times [2022-07-22 14:42:19,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:19,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778115373] [2022-07-22 14:42:19,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:19,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:19,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:19,628 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:19,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-22 14:42:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:19,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 14:42:19,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:19,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:19,732 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:42:19,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:42:19,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778115373] [2022-07-22 14:42:19,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778115373] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:19,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:19,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:42:19,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848373301] [2022-07-22 14:42:19,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:19,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:42:19,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:42:19,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:42:19,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:42:19,735 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:19,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:19,927 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2022-07-22 14:42:19,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:42:19,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-22 14:42:19,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:19,928 INFO L225 Difference]: With dead ends: 131 [2022-07-22 14:42:19,928 INFO L226 Difference]: Without dead ends: 111 [2022-07-22 14:42:19,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:42:19,929 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 131 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:19,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 116 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 14:42:19,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-22 14:42:19,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 70. [2022-07-22 14:42:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 69 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) [2022-07-22 14:42:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-07-22 14:42:19,933 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 14 [2022-07-22 14:42:19,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:19,934 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-07-22 14:42:19,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-07-22 14:42:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-22 14:42:19,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:19,934 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:42:19,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-22 14:42:20,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:42:20,142 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)] === [2022-07-22 14:42:20,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:20,143 INFO L85 PathProgramCache]: Analyzing trace with hash -140282291, now seen corresponding path program 1 times [2022-07-22 14:42:20,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:20,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025373090] [2022-07-22 14:42:20,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:20,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:20,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:20,147 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:20,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-22 14:42:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:20,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 14:42:20,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:20,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:42:20,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:42:20,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025373090] [2022-07-22 14:42:20,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025373090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:20,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:20,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:42:20,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252148298] [2022-07-22 14:42:20,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:20,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:42:20,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:42:20,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:42:20,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:42:20,221 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:20,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:20,234 INFO L93 Difference]: Finished difference Result 136 states and 156 transitions. [2022-07-22 14:42:20,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:42:20,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-22 14:42:20,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:20,237 INFO L225 Difference]: With dead ends: 136 [2022-07-22 14:42:20,237 INFO L226 Difference]: Without dead ends: 94 [2022-07-22 14:42:20,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:42:20,238 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 24 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:20,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 145 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:42:20,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-22 14:42:20,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2022-07-22 14:42:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 72 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) [2022-07-22 14:42:20,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2022-07-22 14:42:20,247 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 18 [2022-07-22 14:42:20,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:20,247 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2022-07-22 14:42:20,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2022-07-22 14:42:20,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-22 14:42:20,248 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:20,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:42:20,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-22 14:42:20,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:42:20,449 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)] === [2022-07-22 14:42:20,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:20,449 INFO L85 PathProgramCache]: Analyzing trace with hash -53794182, now seen corresponding path program 1 times [2022-07-22 14:42:20,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:20,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712229684] [2022-07-22 14:42:20,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:20,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:20,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:20,455 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:20,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-22 14:42:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:20,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 14:42:20,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:20,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:20,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:20,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-07-22 14:42:20,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-07-22 14:42:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:20,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:42:20,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:42:20,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712229684] [2022-07-22 14:42:20,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712229684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:20,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:20,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 14:42:20,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613934408] [2022-07-22 14:42:20,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:20,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 14:42:20,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:42:20,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 14:42:20,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:42:20,625 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:20,946 INFO L93 Difference]: Finished difference Result 183 states and 210 transitions. [2022-07-22 14:42:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 14:42:20,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-22 14:42:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:20,948 INFO L225 Difference]: With dead ends: 183 [2022-07-22 14:42:20,948 INFO L226 Difference]: Without dead ends: 138 [2022-07-22 14:42:20,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-22 14:42:20,949 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 112 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:20,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 247 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 14:42:20,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-22 14:42:20,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 82. [2022-07-22 14:42:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 81 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2022-07-22 14:42:20,953 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 19 [2022-07-22 14:42:20,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:20,953 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2022-07-22 14:42:20,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:20,953 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2022-07-22 14:42:20,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-22 14:42:20,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:20,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:42:20,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-22 14:42:21,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:42:21,162 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-22 14:42:21,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:21,163 INFO L85 PathProgramCache]: Analyzing trace with hash -746851846, now seen corresponding path program 1 times [2022-07-22 14:42:21,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:21,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97623571] [2022-07-22 14:42:21,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:21,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:21,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:21,165 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:21,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-22 14:42:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:21,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 14:42:21,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:21,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:21,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:42:21,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:42:21,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97623571] [2022-07-22 14:42:21,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97623571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:21,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:21,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:42:21,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44448477] [2022-07-22 14:42:21,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:21,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:42:21,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:42:21,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:42:21,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:42:21,278 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:21,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:21,293 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2022-07-22 14:42:21,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:42:21,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-22 14:42:21,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:21,294 INFO L225 Difference]: With dead ends: 82 [2022-07-22 14:42:21,294 INFO L226 Difference]: Without dead ends: 80 [2022-07-22 14:42:21,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:42:21,295 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 13 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:21,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 126 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:42:21,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-22 14:42:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-22 14:42:21,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 79 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) [2022-07-22 14:42:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2022-07-22 14:42:21,310 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 19 [2022-07-22 14:42:21,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:21,310 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2022-07-22 14:42:21,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2022-07-22 14:42:21,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 14:42:21,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:21,311 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] [2022-07-22 14:42:21,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-22 14:42:21,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:42:21,512 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-22 14:42:21,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:21,512 INFO L85 PathProgramCache]: Analyzing trace with hash -169331172, now seen corresponding path program 1 times [2022-07-22 14:42:21,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:21,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825193228] [2022-07-22 14:42:21,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:21,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:21,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:21,514 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:21,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-22 14:42:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:21,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 14:42:21,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:21,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:21,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:21,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:42:21,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:42:21,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825193228] [2022-07-22 14:42:21,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825193228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:21,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:21,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:42:21,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740061488] [2022-07-22 14:42:21,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:21,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:42:21,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:42:21,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:42:21,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:42:21,640 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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) [2022-07-22 14:42:21,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:21,808 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2022-07-22 14:42:21,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:42:21,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 [2022-07-22 14:42:21,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:21,809 INFO L225 Difference]: With dead ends: 147 [2022-07-22 14:42:21,809 INFO L226 Difference]: Without dead ends: 88 [2022-07-22 14:42:21,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:42:21,810 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:21,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 190 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 14:42:21,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-22 14:42:21,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2022-07-22 14:42:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 81 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:21,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2022-07-22 14:42:21,813 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 20 [2022-07-22 14:42:21,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:21,813 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2022-07-22 14:42:21,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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) [2022-07-22 14:42:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2022-07-22 14:42:21,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 14:42:21,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:21,814 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] [2022-07-22 14:42:21,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-22 14:42:22,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:42:22,020 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-22 14:42:22,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:22,021 INFO L85 PathProgramCache]: Analyzing trace with hash -169329250, now seen corresponding path program 1 times [2022-07-22 14:42:22,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:22,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360424277] [2022-07-22 14:42:22,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:22,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:22,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:22,027 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:22,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-22 14:42:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:22,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 14:42:22,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:22,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:22,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:22,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:22,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:42:22,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:42:22,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360424277] [2022-07-22 14:42:22,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360424277] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:22,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:22,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:42:22,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954972081] [2022-07-22 14:42:22,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:22,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:42:22,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:42:22,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:42:22,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:42:22,130 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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) [2022-07-22 14:42:22,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:22,303 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2022-07-22 14:42:22,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:42:22,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 [2022-07-22 14:42:22,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:22,304 INFO L225 Difference]: With dead ends: 89 [2022-07-22 14:42:22,304 INFO L226 Difference]: Without dead ends: 87 [2022-07-22 14:42:22,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:42:22,304 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:22,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 188 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 14:42:22,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-22 14:42:22,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2022-07-22 14:42:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 76 states have (on average 1.25) internal successors, (95), 82 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2022-07-22 14:42:22,308 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 20 [2022-07-22 14:42:22,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:22,308 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2022-07-22 14:42:22,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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) [2022-07-22 14:42:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2022-07-22 14:42:22,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 14:42:22,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:22,308 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] [2022-07-22 14:42:22,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-22 14:42:22,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:42:22,516 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-22 14:42:22,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:22,516 INFO L85 PathProgramCache]: Analyzing trace with hash -167482208, now seen corresponding path program 1 times [2022-07-22 14:42:22,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:22,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499559046] [2022-07-22 14:42:22,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:22,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:22,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:22,518 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:22,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-22 14:42:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:22,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 14:42:22,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:22,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:42:22,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:42:22,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499559046] [2022-07-22 14:42:22,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499559046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:22,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:22,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:42:22,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025310087] [2022-07-22 14:42:22,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:22,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:42:22,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:42:22,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:42:22,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:42:22,675 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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) [2022-07-22 14:42:22,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:22,920 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2022-07-22 14:42:22,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:42:22,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 [2022-07-22 14:42:22,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:22,922 INFO L225 Difference]: With dead ends: 84 [2022-07-22 14:42:22,922 INFO L226 Difference]: Without dead ends: 82 [2022-07-22 14:42:22,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:42:22,922 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:22,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 178 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 14:42:22,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-22 14:42:22,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2022-07-22 14:42:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 79 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) [2022-07-22 14:42:22,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2022-07-22 14:42:22,925 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 20 [2022-07-22 14:42:22,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:22,926 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2022-07-22 14:42:22,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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) [2022-07-22 14:42:22,926 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2022-07-22 14:42:22,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-22 14:42:22,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:22,926 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] [2022-07-22 14:42:22,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-22 14:42:23,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:42:23,139 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-22 14:42:23,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:23,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1528659518, now seen corresponding path program 1 times [2022-07-22 14:42:23,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:23,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574036534] [2022-07-22 14:42:23,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:23,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:23,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:23,142 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:23,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-22 14:42:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:23,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-22 14:42:23,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:23,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:23,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:23,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:23,430 INFO L356 Elim1Store]: treesize reduction 89, result has 7.3 percent of original size [2022-07-22 14:42:23,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 149 [2022-07-22 14:42:23,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:23,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:23,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 85 treesize of output 91 [2022-07-22 14:42:23,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:23,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 56 treesize of output 75 [2022-07-22 14:42:23,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 16 [2022-07-22 14:42:23,478 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-22 14:42:23,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 17 [2022-07-22 14:42:24,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:24,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:42:24,140 INFO L356 Elim1Store]: treesize reduction 51, result has 5.6 percent of original size [2022-07-22 14:42:24,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 72 [2022-07-22 14:42:24,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:24,167 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:42:24,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 168 treesize of output 160 [2022-07-22 14:42:24,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 124 treesize of output 117 [2022-07-22 14:42:24,198 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-22 14:42:24,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 111 treesize of output 113 [2022-07-22 14:42:24,383 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:42:24,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 7 [2022-07-22 14:42:24,404 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:42:24,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 7 [2022-07-22 14:42:24,437 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:42:24,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 7 [2022-07-22 14:42:24,459 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:42:24,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:24,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:42:24,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 45 [2022-07-22 14:42:24,525 INFO L356 Elim1Store]: treesize reduction 17, result has 41.4 percent of original size [2022-07-22 14:42:24,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 47 [2022-07-22 14:42:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:24,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:42:24,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:42:24,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574036534] [2022-07-22 14:42:24,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574036534] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:24,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:24,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 14:42:24,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547834596] [2022-07-22 14:42:24,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:24,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 14:42:24,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:42:24,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 14:42:24,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:42:24,559 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:24,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:24,872 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2022-07-22 14:42:24,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 14:42:24,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-07-22 14:42:24,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:24,874 INFO L225 Difference]: With dead ends: 141 [2022-07-22 14:42:24,874 INFO L226 Difference]: Without dead ends: 139 [2022-07-22 14:42:24,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-22 14:42:24,875 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 66 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:24,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 362 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 150 Unchecked, 0.2s Time] [2022-07-22 14:42:24,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-22 14:42:24,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 94. [2022-07-22 14:42:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 88 states have (on average 1.2272727272727273) internal successors, (108), 93 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2022-07-22 14:42:24,880 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 22 [2022-07-22 14:42:24,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:24,880 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2022-07-22 14:42:24,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:24,888 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2022-07-22 14:42:24,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-22 14:42:24,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:24,889 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] [2022-07-22 14:42:24,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-22 14:42:25,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:42:25,099 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-22 14:42:25,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:25,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1745239424, now seen corresponding path program 1 times [2022-07-22 14:42:25,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:25,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321836378] [2022-07-22 14:42:25,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:25,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:25,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:25,101 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:25,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-22 14:42:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:25,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 14:42:25,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:25,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-07-22 14:42:25,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-07-22 14:42:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:25,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:42:25,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:42:25,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321836378] [2022-07-22 14:42:25,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321836378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:25,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:25,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 14:42:25,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342734924] [2022-07-22 14:42:25,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:25,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 14:42:25,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:42:25,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 14:42:25,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 14:42:25,336 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:25,926 INFO L93 Difference]: Finished difference Result 193 states and 222 transitions. [2022-07-22 14:42:25,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 14:42:25,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-07-22 14:42:25,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:25,927 INFO L225 Difference]: With dead ends: 193 [2022-07-22 14:42:25,927 INFO L226 Difference]: Without dead ends: 150 [2022-07-22 14:42:25,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-22 14:42:25,928 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 108 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:25,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 278 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 14:42:25,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-22 14:42:25,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 91. [2022-07-22 14:42:25,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 90 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:25,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2022-07-22 14:42:25,942 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 22 [2022-07-22 14:42:25,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:25,942 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2022-07-22 14:42:25,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:25,942 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2022-07-22 14:42:25,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 14:42:25,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:25,944 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] [2022-07-22 14:42:25,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-22 14:42:26,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:42:26,145 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-22 14:42:26,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:26,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1090169010, now seen corresponding path program 1 times [2022-07-22 14:42:26,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:26,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735757164] [2022-07-22 14:42:26,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:26,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:26,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:26,147 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:26,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-22 14:42:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:26,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 14:42:26,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:26,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:26,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:26,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-07-22 14:42:26,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-07-22 14:42:26,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:42:26,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:42:26,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:42:26,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735757164] [2022-07-22 14:42:26,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735757164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:26,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:26,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:42:26,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266718908] [2022-07-22 14:42:26,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:26,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:42:26,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:42:26,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:42:26,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:42:26,380 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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) [2022-07-22 14:42:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:26,669 INFO L93 Difference]: Finished difference Result 147 states and 169 transitions. [2022-07-22 14:42:26,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:42:26,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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 [2022-07-22 14:42:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:26,670 INFO L225 Difference]: With dead ends: 147 [2022-07-22 14:42:26,670 INFO L226 Difference]: Without dead ends: 129 [2022-07-22 14:42:26,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:42:26,671 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 23 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:26,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 188 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 14:42:26,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-22 14:42:26,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2022-07-22 14:42:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 115 states have (on average 1.2521739130434784) internal successors, (144), 120 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:26,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 144 transitions. [2022-07-22 14:42:26,676 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 144 transitions. Word has length 24 [2022-07-22 14:42:26,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:26,676 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 144 transitions. [2022-07-22 14:42:26,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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) [2022-07-22 14:42:26,676 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 144 transitions. [2022-07-22 14:42:26,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 14:42:26,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:26,677 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] [2022-07-22 14:42:26,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-22 14:42:26,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:42:26,885 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-22 14:42:26,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:26,885 INFO L85 PathProgramCache]: Analyzing trace with hash -2028302030, now seen corresponding path program 1 times [2022-07-22 14:42:26,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:26,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329360143] [2022-07-22 14:42:26,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:26,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:26,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:26,887 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:26,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-22 14:42:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:27,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 14:42:27,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:27,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 19 [2022-07-22 14:42:27,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-07-22 14:42:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:27,132 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:42:27,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:42:27,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329360143] [2022-07-22 14:42:27,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329360143] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:27,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:27,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 14:42:27,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280279049] [2022-07-22 14:42:27,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:27,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 14:42:27,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:42:27,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 14:42:27,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 14:42:27,133 INFO L87 Difference]: Start difference. First operand 121 states and 144 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) [2022-07-22 14:42:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:27,742 INFO L93 Difference]: Finished difference Result 228 states and 266 transitions. [2022-07-22 14:42:27,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 14:42:27,743 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 [2022-07-22 14:42:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:27,743 INFO L225 Difference]: With dead ends: 228 [2022-07-22 14:42:27,743 INFO L226 Difference]: Without dead ends: 185 [2022-07-22 14:42:27,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-22 14:42:27,744 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 122 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:27,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 348 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 14:42:27,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-22 14:42:27,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 121. [2022-07-22 14:42:27,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 115 states have (on average 1.2434782608695651) internal successors, (143), 120 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:27,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 143 transitions. [2022-07-22 14:42:27,749 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 143 transitions. Word has length 24 [2022-07-22 14:42:27,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:27,749 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 143 transitions. [2022-07-22 14:42:27,749 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) [2022-07-22 14:42:27,749 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 143 transitions. [2022-07-22 14:42:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 14:42:27,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:27,749 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] [2022-07-22 14:42:27,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-22 14:42:27,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:42:27,950 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-22 14:42:27,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:27,950 INFO L85 PathProgramCache]: Analyzing trace with hash 272520560, now seen corresponding path program 1 times [2022-07-22 14:42:27,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:27,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105696170] [2022-07-22 14:42:27,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:27,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:27,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:27,952 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:27,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-22 14:42:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:28,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 14:42:28,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:28,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-07-22 14:42:28,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-07-22 14:42:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:42:28,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:42:28,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:42:28,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105696170] [2022-07-22 14:42:28,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105696170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:28,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:28,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 14:42:28,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793370766] [2022-07-22 14:42:28,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:28,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 14:42:28,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:42:28,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 14:42:28,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:42:28,223 INFO L87 Difference]: Start difference. First operand 121 states and 143 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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) [2022-07-22 14:42:28,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:28,623 INFO L93 Difference]: Finished difference Result 168 states and 197 transitions. [2022-07-22 14:42:28,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 14:42:28,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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 [2022-07-22 14:42:28,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:28,624 INFO L225 Difference]: With dead ends: 168 [2022-07-22 14:42:28,624 INFO L226 Difference]: Without dead ends: 150 [2022-07-22 14:42:28,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:42:28,625 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 25 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:28,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 245 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 14:42:28,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-22 14:42:28,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 112. [2022-07-22 14:42:28,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 106 states have (on average 1.2547169811320755) internal successors, (133), 111 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) [2022-07-22 14:42:28,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2022-07-22 14:42:28,632 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 24 [2022-07-22 14:42:28,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:28,633 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2022-07-22 14:42:28,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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) [2022-07-22 14:42:28,633 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-07-22 14:42:28,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-22 14:42:28,633 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:28,633 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] [2022-07-22 14:42:28,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-22 14:42:28,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:42:28,845 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-22 14:42:28,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:28,845 INFO L85 PathProgramCache]: Analyzing trace with hash -753351988, now seen corresponding path program 1 times [2022-07-22 14:42:28,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:28,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556879646] [2022-07-22 14:42:28,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:28,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:28,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:28,847 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:28,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-22 14:42:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:29,012 WARN L261 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-22 14:42:29,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:29,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:29,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:29,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:29,103 INFO L356 Elim1Store]: treesize reduction 99, result has 8.3 percent of original size [2022-07-22 14:42:29,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 193 [2022-07-22 14:42:29,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:29,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:29,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2022-07-22 14:42:29,120 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-22 14:42:29,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 17 [2022-07-22 14:42:29,390 INFO L356 Elim1Store]: treesize reduction 35, result has 7.9 percent of original size [2022-07-22 14:42:29,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 37 [2022-07-22 14:42:29,397 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-22 14:42:29,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 16 [2022-07-22 14:42:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:29,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:42:29,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:42:29,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1556879646] [2022-07-22 14:42:29,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1556879646] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:29,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:29,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 14:42:29,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074394446] [2022-07-22 14:42:29,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:29,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 14:42:29,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:42:29,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 14:42:29,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:42:29,414 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:29,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:29,957 INFO L93 Difference]: Finished difference Result 167 states and 196 transitions. [2022-07-22 14:42:29,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 14:42:29,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-07-22 14:42:29,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:29,958 INFO L225 Difference]: With dead ends: 167 [2022-07-22 14:42:29,958 INFO L226 Difference]: Without dead ends: 165 [2022-07-22 14:42:29,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-22 14:42:29,959 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 64 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:29,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 377 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 127 Invalid, 0 Unknown, 42 Unchecked, 0.4s Time] [2022-07-22 14:42:29,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-22 14:42:29,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 115. [2022-07-22 14:42:29,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 114 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:29,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 136 transitions. [2022-07-22 14:42:29,963 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 136 transitions. Word has length 25 [2022-07-22 14:42:29,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:29,964 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 136 transitions. [2022-07-22 14:42:29,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:29,964 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 136 transitions. [2022-07-22 14:42:29,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 14:42:29,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:29,965 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] [2022-07-22 14:42:29,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-22 14:42:30,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:42:30,165 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-22 14:42:30,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:30,166 INFO L85 PathProgramCache]: Analyzing trace with hash 363058206, now seen corresponding path program 1 times [2022-07-22 14:42:30,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:30,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936025508] [2022-07-22 14:42:30,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:30,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:30,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:30,167 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:30,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-22 14:42:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:30,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 14:42:30,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:30,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:30,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:30,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:30,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:42:30,401 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-22 14:42:30,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 23 [2022-07-22 14:42:30,409 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-22 14:42:30,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 12 [2022-07-22 14:42:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:30,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:42:30,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936025508] [2022-07-22 14:42:30,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936025508] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:42:30,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:42:30,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-07-22 14:42:30,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310718748] [2022-07-22 14:42:30,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:42:30,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 14:42:30,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:42:30,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 14:42:30,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:42:30,433 INFO L87 Difference]: Start difference. First operand 115 states and 136 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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) [2022-07-22 14:42:31,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:31,132 INFO L93 Difference]: Finished difference Result 257 states and 301 transitions. [2022-07-22 14:42:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 14:42:31,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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 27 [2022-07-22 14:42:31,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:31,133 INFO L225 Difference]: With dead ends: 257 [2022-07-22 14:42:31,133 INFO L226 Difference]: Without dead ends: 178 [2022-07-22 14:42:31,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-22 14:42:31,134 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 259 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:31,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 280 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 14:42:31,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-22 14:42:31,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 133. [2022-07-22 14:42:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 132 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) [2022-07-22 14:42:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 161 transitions. [2022-07-22 14:42:31,141 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 161 transitions. Word has length 27 [2022-07-22 14:42:31,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:31,141 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 161 transitions. [2022-07-22 14:42:31,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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) [2022-07-22 14:42:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 161 transitions. [2022-07-22 14:42:31,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-22 14:42:31,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:31,141 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] [2022-07-22 14:42:31,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-07-22 14:42:31,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:42:31,354 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-22 14:42:31,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:31,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1334430447, now seen corresponding path program 1 times [2022-07-22 14:42:31,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:31,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907994550] [2022-07-22 14:42:31,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:31,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:31,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:31,357 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:31,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-22 14:42:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:31,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 14:42:31,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:31,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:31,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:42:31,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:42:31,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907994550] [2022-07-22 14:42:31,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907994550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:42:31,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:42:31,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:42:31,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750278813] [2022-07-22 14:42:31,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:42:31,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:42:31,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:42:31,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:42:31,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:42:31,519 INFO L87 Difference]: Start difference. First operand 133 states and 161 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:31,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:31,544 INFO L93 Difference]: Finished difference Result 296 states and 366 transitions. [2022-07-22 14:42:31,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:42:31,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-07-22 14:42:31,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:31,545 INFO L225 Difference]: With dead ends: 296 [2022-07-22 14:42:31,545 INFO L226 Difference]: Without dead ends: 212 [2022-07-22 14:42:31,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:42:31,546 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 28 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:31,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 161 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:42:31,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-22 14:42:31,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 170. [2022-07-22 14:42:31,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 164 states have (on average 1.2621951219512195) internal successors, (207), 169 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 207 transitions. [2022-07-22 14:42:31,552 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 207 transitions. Word has length 30 [2022-07-22 14:42:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:31,553 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 207 transitions. [2022-07-22 14:42:31,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 207 transitions. [2022-07-22 14:42:31,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 14:42:31,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:31,553 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, 1] [2022-07-22 14:42:31,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-22 14:42:31,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:42:31,763 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)] === [2022-07-22 14:42:31,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:31,763 INFO L85 PathProgramCache]: Analyzing trace with hash -721495, now seen corresponding path program 1 times [2022-07-22 14:42:31,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:31,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403266932] [2022-07-22 14:42:31,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:31,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:31,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:31,765 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:31,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-22 14:42:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:31,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-22 14:42:31,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:31,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:31,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:31,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:32,039 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:42:32,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:32,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:32,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:32,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:32,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:32,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:32,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:32,143 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:42:32,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:32,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:32,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:32,269 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:42:32,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:32,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:32,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:42:32,363 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1405) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv0 32))) (forall ((v_ArrVal_1404 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-07-22 14:42:36,653 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-22 14:42:36,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2022-07-22 14:42:36,658 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:42:36,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 54 treesize of output 30 [2022-07-22 14:42:36,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:36,670 INFO L356 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2022-07-22 14:42:36,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2022-07-22 14:42:36,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:36,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:42:36,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403266932] [2022-07-22 14:42:36,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403266932] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:42:36,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:42:36,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-07-22 14:42:36,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644590291] [2022-07-22 14:42:36,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:42:36,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 14:42:36,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:42:36,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 14:42:36,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=4, NotChecked=24, Total=210 [2022-07-22 14:42:36,698 INFO L87 Difference]: Start difference. First operand 170 states and 207 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:38,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:42:38,243 INFO L93 Difference]: Finished difference Result 384 states and 456 transitions. [2022-07-22 14:42:38,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 14:42:38,243 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-22 14:42:38,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:42:38,244 INFO L225 Difference]: With dead ends: 384 [2022-07-22 14:42:38,244 INFO L226 Difference]: Without dead ends: 290 [2022-07-22 14:42:38,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=4, NotChecked=36, Total=420 [2022-07-22 14:42:38,245 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 237 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-22 14:42:38,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 761 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 328 Invalid, 0 Unknown, 193 Unchecked, 1.3s Time] [2022-07-22 14:42:38,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-22 14:42:38,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 191. [2022-07-22 14:42:38,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 185 states have (on average 1.2486486486486486) internal successors, (231), 190 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 231 transitions. [2022-07-22 14:42:38,262 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 231 transitions. Word has length 32 [2022-07-22 14:42:38,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:42:38,262 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 231 transitions. [2022-07-22 14:42:38,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:42:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 231 transitions. [2022-07-22 14:42:38,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 14:42:38,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:42:38,263 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, 1] [2022-07-22 14:42:38,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-22 14:42:38,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:42:38,471 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-22 14:42:38,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:42:38,472 INFO L85 PathProgramCache]: Analyzing trace with hash -572234199, now seen corresponding path program 1 times [2022-07-22 14:42:38,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:42:38,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791650429] [2022-07-22 14:42:38,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:42:38,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:42:38,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:42:38,473 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:42:38,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-22 14:42:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:42:38,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-22 14:42:38,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:42:38,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:38,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:39,356 INFO L356 Elim1Store]: treesize reduction 23, result has 56.6 percent of original size [2022-07-22 14:42:39,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 646 treesize of output 593 [2022-07-22 14:42:39,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:39,936 INFO L356 Elim1Store]: treesize reduction 23, result has 56.6 percent of original size [2022-07-22 14:42:39,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 489 treesize of output 436 [2022-07-22 14:42:39,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:40,118 INFO L356 Elim1Store]: treesize reduction 110, result has 13.4 percent of original size [2022-07-22 14:42:40,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 226 treesize of output 250 [2022-07-22 14:42:40,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 191 treesize of output 119 [2022-07-22 14:42:40,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:40,246 INFO L356 Elim1Store]: treesize reduction 110, result has 13.4 percent of original size [2022-07-22 14:42:40,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 226 treesize of output 250 [2022-07-22 14:42:40,275 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:42:40,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 199 treesize of output 128 [2022-07-22 14:42:40,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-07-22 14:42:40,403 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-22 14:42:40,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 [2022-07-22 14:42:40,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-07-22 14:42:40,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-07-22 14:42:40,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 24 [2022-07-22 14:42:40,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 24 [2022-07-22 14:42:40,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2022-07-22 14:42:40,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 25 treesize of output 15 [2022-07-22 14:42:40,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 33 [2022-07-22 14:42:40,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 33 [2022-07-22 14:42:40,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:40,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2022-07-22 14:42:41,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 46 treesize of output 49 [2022-07-22 14:42:41,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:41,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 53 treesize of output 19 [2022-07-22 14:42:41,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:41,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 21 [2022-07-22 14:42:41,392 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:42:41,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 13 [2022-07-22 14:42:41,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:41,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:42:41,645 INFO L356 Elim1Store]: treesize reduction 94, result has 1.1 percent of original size [2022-07-22 14:42:41,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 266 treesize of output 241 [2022-07-22 14:42:41,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 238 treesize of output 198 [2022-07-22 14:42:41,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:41,694 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-07-22 14:42:41,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 216 treesize of output 207 [2022-07-22 14:42:41,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:41,770 INFO L356 Elim1Store]: treesize reduction -1, result has 101.9 percent of original size [2022-07-22 14:42:41,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 86 [2022-07-22 14:42:41,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:41,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:41,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:42:41,787 INFO L356 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-07-22 14:42:41,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 62 [2022-07-22 14:42:41,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:41,820 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-22 14:42:41,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 63 [2022-07-22 14:42:42,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:42,041 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:42:42,062 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-07-22 14:42:42,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 97 treesize of output 70 [2022-07-22 14:42:42,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:42:42,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2022-07-22 14:42:42,548 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:42:42,567 INFO L356 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2022-07-22 14:42:42,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 62 [2022-07-22 14:42:42,577 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-22 14:42:42,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 24 [2022-07-22 14:42:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:42:42,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:42:43,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:42:43,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:42:43,735 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:42:43,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 14:43:01,311 WARN L233 SmtUtils]: Spent 11.64s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 14:43:37,248 WARN L233 SmtUtils]: Spent 18.56s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 14:46:07,760 WARN L233 SmtUtils]: Spent 2.45m on a formula simplification. DAG size of input: 64 DAG size of output: 40 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-22 14:46:07,760 INFO L356 Elim1Store]: treesize reduction 146, result has 36.8 percent of original size [2022-07-22 14:46:07,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 45089 treesize of output 40311