./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 6c24879c 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-?-6c24879 [2022-07-12 03:20:41,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:20:41,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:20:41,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:20:41,407 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:20:41,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:20:41,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:20:41,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:20:41,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:20:41,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:20:41,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:20:41,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:20:41,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:20:41,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:20:41,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:20:41,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:20:41,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:20:41,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:20:41,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:20:41,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:20:41,426 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:20:41,428 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:20:41,429 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:20:41,432 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:20:41,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:20:41,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:20:41,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:20:41,435 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:20:41,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:20:41,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:20:41,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:20:41,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:20:41,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:20:41,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:20:41,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:20:41,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:20:41,439 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:20:41,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:20:41,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:20:41,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:20:41,440 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:20:41,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:20:41,441 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:20:41,458 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:20:41,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:20:41,462 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:20:41,462 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:20:41,463 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:20:41,463 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:20:41,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:20:41,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:20:41,463 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:20:41,464 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:20:41,464 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:20:41,464 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:20:41,465 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:20:41,465 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:20:41,465 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:20:41,465 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:20:41,465 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:20:41,465 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:20:41,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:20:41,466 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:20:41,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:20:41,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:20:41,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:20:41,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:20:41,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:20:41,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:20:41,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:20:41,467 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:20:41,468 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:20:41,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:20:41,468 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:20:41,468 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:20:41,468 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:20:41,468 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-12 03:20:41,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:20:41,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:20:41,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:20:41,724 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:20:41,724 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:20:41,725 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-12 03:20:41,766 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b61dc646/fa473bf5adb64945b89888d79547fbde/FLAG61b1092e8 [2022-07-12 03:20:42,172 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:20:42,173 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2022-07-12 03:20:42,181 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b61dc646/fa473bf5adb64945b89888d79547fbde/FLAG61b1092e8 [2022-07-12 03:20:42,198 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b61dc646/fa473bf5adb64945b89888d79547fbde [2022-07-12 03:20:42,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:20:42,202 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:20:42,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:20:42,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:20:42,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:20:42,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:20:42" (1/1) ... [2022-07-12 03:20:42,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b037f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:42, skipping insertion in model container [2022-07-12 03:20:42,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:20:42" (1/1) ... [2022-07-12 03:20:42,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:20:42,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:20:42,521 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-12 03:20:42,533 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-12 03:20:42,536 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-12 03:20:42,537 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-12 03:20:42,542 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-12 03:20:42,543 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-12 03:20:42,545 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-12 03:20:42,559 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-12 03:20:42,562 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-12 03:20:42,563 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-12 03:20:42,564 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-12 03:20:42,566 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-12 03:20:42,566 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-12 03:20:42,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:20:42,580 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:20:42,599 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-12 03:20:42,601 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-12 03:20:42,602 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-12 03:20:42,602 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-12 03:20:42,604 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-12 03:20:42,604 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-12 03:20:42,606 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-12 03:20:42,609 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-12 03:20:42,610 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-12 03:20:42,611 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-12 03:20:42,612 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-12 03:20:42,612 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-12 03:20:42,613 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-12 03:20:42,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:20:42,630 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:20:42,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:42 WrapperNode [2022-07-12 03:20:42,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:20:42,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:20:42,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:20:42,631 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:20:42,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:42" (1/1) ... [2022-07-12 03:20:42,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:42" (1/1) ... [2022-07-12 03:20:42,665 INFO L137 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 225 [2022-07-12 03:20:42,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:20:42,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:20:42,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:20:42,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:20:42,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:42" (1/1) ... [2022-07-12 03:20:42,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:42" (1/1) ... [2022-07-12 03:20:42,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:42" (1/1) ... [2022-07-12 03:20:42,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:42" (1/1) ... [2022-07-12 03:20:42,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:42" (1/1) ... [2022-07-12 03:20:42,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:42" (1/1) ... [2022-07-12 03:20:42,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:42" (1/1) ... [2022-07-12 03:20:42,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:20:42,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:20:42,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:20:42,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:20:42,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:42" (1/1) ... [2022-07-12 03:20:42,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:20:42,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:42,713 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-12 03:20:42,718 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-12 03:20:42,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:20:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:20:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:20:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:20:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:20:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:20:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:20:42,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:20:42,880 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:20:42,881 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:20:43,173 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:20:43,180 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:20:43,180 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-12 03:20:43,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:20:43 BoogieIcfgContainer [2022-07-12 03:20:43,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:20:43,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:20:43,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:20:43,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:20:43,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:20:42" (1/3) ... [2022-07-12 03:20:43,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13544844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:20:43, skipping insertion in model container [2022-07-12 03:20:43,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:42" (2/3) ... [2022-07-12 03:20:43,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13544844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:20:43, skipping insertion in model container [2022-07-12 03:20:43,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:20:43" (3/3) ... [2022-07-12 03:20:43,192 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2022-07-12 03:20:43,205 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:20:43,205 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-07-12 03:20:43,261 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:20:43,266 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@1afba293, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@35000393 [2022-07-12 03:20:43,267 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-07-12 03:20:43,270 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-12 03:20:43,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-12 03:20:43,282 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:43,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-12 03:20:43,284 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-12 03:20:43,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:43,289 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2022-07-12 03:20:43,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:43,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229729669] [2022-07-12 03:20:43,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:43,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:43,430 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-12 03:20:43,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:43,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229729669] [2022-07-12 03:20:43,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229729669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:43,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:43,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:43,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010036334] [2022-07-12 03:20:43,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:43,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:43,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:43,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:43,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:43,463 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-12 03:20:43,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:43,523 INFO L93 Difference]: Finished difference Result 182 states and 300 transitions. [2022-07-12 03:20:43,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:43,526 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-12 03:20:43,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:43,533 INFO L225 Difference]: With dead ends: 182 [2022-07-12 03:20:43,534 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 03:20:43,550 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-12 03:20:43,552 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-12 03:20:43,553 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-12 03:20:43,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 03:20:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2022-07-12 03:20:43,581 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-12 03:20:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2022-07-12 03:20:43,588 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 4 [2022-07-12 03:20:43,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:43,589 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2022-07-12 03:20:43,589 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-12 03:20:43,589 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2022-07-12 03:20:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 03:20:43,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:43,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:43,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:20:43,593 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-12 03:20:43,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:43,594 INFO L85 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2022-07-12 03:20:43,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:43,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003426108] [2022-07-12 03:20:43,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:43,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:43,653 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-12 03:20:43,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:43,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003426108] [2022-07-12 03:20:43,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003426108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:43,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:43,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:43,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273066780] [2022-07-12 03:20:43,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:43,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:43,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:43,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:43,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:43,656 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-12 03:20:43,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:43,667 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-07-12 03:20:43,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:43,670 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-12 03:20:43,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:43,671 INFO L225 Difference]: With dead ends: 81 [2022-07-12 03:20:43,671 INFO L226 Difference]: Without dead ends: 79 [2022-07-12 03:20:43,672 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-12 03:20:43,672 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-12 03:20:43,673 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-12 03:20:43,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-12 03:20:43,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-07-12 03:20:43,679 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-12 03:20:43,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2022-07-12 03:20:43,680 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 10 [2022-07-12 03:20:43,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:43,681 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2022-07-12 03:20:43,681 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-12 03:20:43,681 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2022-07-12 03:20:43,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 03:20:43,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:43,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:43,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:20:43,684 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-12 03:20:43,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:43,688 INFO L85 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2022-07-12 03:20:43,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:43,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564186491] [2022-07-12 03:20:43,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:43,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:43,762 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-12 03:20:43,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:43,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564186491] [2022-07-12 03:20:43,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564186491] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:43,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:43,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:43,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502904406] [2022-07-12 03:20:43,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:43,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:43,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:43,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:43,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:43,766 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-12 03:20:43,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:43,826 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2022-07-12 03:20:43,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:20:43,826 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-12 03:20:43,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:43,827 INFO L225 Difference]: With dead ends: 80 [2022-07-12 03:20:43,827 INFO L226 Difference]: Without dead ends: 78 [2022-07-12 03:20:43,827 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-12 03:20:43,828 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:43,828 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.0s Time] [2022-07-12 03:20:43,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-12 03:20:43,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-07-12 03:20:43,831 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-12 03:20:43,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-07-12 03:20:43,832 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 10 [2022-07-12 03:20:43,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:43,832 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-07-12 03:20:43,832 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-12 03:20:43,832 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-07-12 03:20:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:20:43,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:43,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:43,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:20:43,833 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-12 03:20:43,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:43,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2022-07-12 03:20:43,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:43,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094184323] [2022-07-12 03:20:43,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:43,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:43,881 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-12 03:20:43,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:43,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094184323] [2022-07-12 03:20:43,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094184323] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:43,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:43,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:43,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18578549] [2022-07-12 03:20:43,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:43,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:43,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:43,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:43,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:43,886 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-12 03:20:43,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:43,923 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2022-07-12 03:20:43,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:43,923 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-12 03:20:43,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:43,924 INFO L225 Difference]: With dead ends: 79 [2022-07-12 03:20:43,924 INFO L226 Difference]: Without dead ends: 75 [2022-07-12 03:20:43,924 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-12 03:20:43,925 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-12 03:20:43,925 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-12 03:20:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-12 03:20:43,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-07-12 03:20:43,929 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-12 03:20:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2022-07-12 03:20:43,929 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 15 [2022-07-12 03:20:43,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:43,929 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2022-07-12 03:20:43,929 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-12 03:20:43,930 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2022-07-12 03:20:43,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 03:20:43,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:43,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:43,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 03:20:43,931 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-12 03:20:43,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:43,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1551589151, now seen corresponding path program 1 times [2022-07-12 03:20:43,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:43,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92925573] [2022-07-12 03:20:43,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:43,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:43,981 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-12 03:20:43,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:43,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92925573] [2022-07-12 03:20:43,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92925573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:43,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:43,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:43,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011138866] [2022-07-12 03:20:43,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:43,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:43,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:43,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:43,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:43,982 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-12 03:20:44,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:44,052 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2022-07-12 03:20:44,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:20:44,053 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-12 03:20:44,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:44,053 INFO L225 Difference]: With dead ends: 190 [2022-07-12 03:20:44,053 INFO L226 Difference]: Without dead ends: 126 [2022-07-12 03:20:44,054 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-12 03:20:44,055 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 57 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12 03:20:44,055 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-12 03:20:44,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-12 03:20:44,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 74. [2022-07-12 03:20:44,059 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-12 03:20:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2022-07-12 03:20:44,059 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 16 [2022-07-12 03:20:44,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:44,059 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2022-07-12 03:20:44,060 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-12 03:20:44,060 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2022-07-12 03:20:44,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 03:20:44,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:44,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:44,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 03:20:44,061 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-12 03:20:44,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:44,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2022-07-12 03:20:44,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:44,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829743880] [2022-07-12 03:20:44,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:44,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:44,120 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-12 03:20:44,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:44,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829743880] [2022-07-12 03:20:44,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829743880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:44,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:44,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:44,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387659475] [2022-07-12 03:20:44,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:44,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:44,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:44,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:44,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:44,122 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-12 03:20:44,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:44,169 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2022-07-12 03:20:44,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:20:44,170 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-12 03:20:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:44,170 INFO L225 Difference]: With dead ends: 134 [2022-07-12 03:20:44,170 INFO L226 Difference]: Without dead ends: 114 [2022-07-12 03:20:44,171 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-12 03:20:44,171 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-12 03:20:44,171 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-12 03:20:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-12 03:20:44,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 73. [2022-07-12 03:20:44,175 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-12 03:20:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-07-12 03:20:44,175 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 16 [2022-07-12 03:20:44,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:44,175 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-07-12 03:20:44,176 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-12 03:20:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-07-12 03:20:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:20:44,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:44,177 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-12 03:20:44,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 03:20:44,177 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-12 03:20:44,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:44,178 INFO L85 PathProgramCache]: Analyzing trace with hash -940628020, now seen corresponding path program 1 times [2022-07-12 03:20:44,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:44,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618477357] [2022-07-12 03:20:44,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:44,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:44,209 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-12 03:20:44,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:44,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618477357] [2022-07-12 03:20:44,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618477357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:44,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:44,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:44,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792709148] [2022-07-12 03:20:44,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:44,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:44,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:44,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:44,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:44,211 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-12 03:20:44,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:44,226 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2022-07-12 03:20:44,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:44,226 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-12 03:20:44,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:44,227 INFO L225 Difference]: With dead ends: 139 [2022-07-12 03:20:44,227 INFO L226 Difference]: Without dead ends: 97 [2022-07-12 03:20:44,227 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-12 03:20:44,228 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-12 03:20:44,228 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-12 03:20:44,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-12 03:20:44,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2022-07-12 03:20:44,231 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-12 03:20:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2022-07-12 03:20:44,232 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 20 [2022-07-12 03:20:44,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:44,232 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2022-07-12 03:20:44,232 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-12 03:20:44,232 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2022-07-12 03:20:44,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 03:20:44,232 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:44,232 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-12 03:20:44,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 03:20:44,232 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-12 03:20:44,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:44,233 INFO L85 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2022-07-12 03:20:44,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:44,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43540224] [2022-07-12 03:20:44,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:44,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:44,270 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-12 03:20:44,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:44,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43540224] [2022-07-12 03:20:44,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43540224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:44,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:44,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:44,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694074833] [2022-07-12 03:20:44,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:44,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:44,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:44,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:44,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:44,272 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-12 03:20:44,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:44,281 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2022-07-12 03:20:44,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:44,281 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-12 03:20:44,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:44,281 INFO L225 Difference]: With dead ends: 76 [2022-07-12 03:20:44,281 INFO L226 Difference]: Without dead ends: 74 [2022-07-12 03:20:44,282 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-12 03:20:44,282 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-12 03:20:44,282 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-12 03:20:44,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-12 03:20:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-07-12 03:20:44,285 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-12 03:20:44,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2022-07-12 03:20:44,286 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 21 [2022-07-12 03:20:44,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:44,286 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2022-07-12 03:20:44,286 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-12 03:20:44,286 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-07-12 03:20:44,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 03:20:44,287 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:44,287 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-12 03:20:44,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 03:20:44,287 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-12 03:20:44,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:44,287 INFO L85 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2022-07-12 03:20:44,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:44,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530643023] [2022-07-12 03:20:44,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:44,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:44,359 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-12 03:20:44,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:44,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530643023] [2022-07-12 03:20:44,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530643023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:44,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:44,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:44,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819926756] [2022-07-12 03:20:44,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:44,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:44,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:44,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:44,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:44,361 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-12 03:20:44,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:44,411 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2022-07-12 03:20:44,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:20:44,411 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-12 03:20:44,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:44,412 INFO L225 Difference]: With dead ends: 75 [2022-07-12 03:20:44,412 INFO L226 Difference]: Without dead ends: 73 [2022-07-12 03:20:44,412 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-12 03:20:44,415 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-12 03:20:44,415 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-12 03:20:44,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-12 03:20:44,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2022-07-12 03:20:44,425 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-12 03:20:44,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2022-07-12 03:20:44,425 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 23 [2022-07-12 03:20:44,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:44,425 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2022-07-12 03:20:44,425 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-12 03:20:44,425 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-07-12 03:20:44,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 03:20:44,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:44,426 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-12 03:20:44,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 03:20:44,426 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-12 03:20:44,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:44,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2022-07-12 03:20:44,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:44,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312318831] [2022-07-12 03:20:44,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:44,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:44,514 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-12 03:20:44,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:44,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312318831] [2022-07-12 03:20:44,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312318831] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:44,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:44,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:20:44,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668852824] [2022-07-12 03:20:44,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:44,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:20:44,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:44,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:20:44,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:20:44,516 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-12 03:20:44,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:44,722 INFO L93 Difference]: Finished difference Result 202 states and 231 transitions. [2022-07-12 03:20:44,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 03:20:44,722 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-12 03:20:44,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:44,724 INFO L225 Difference]: With dead ends: 202 [2022-07-12 03:20:44,724 INFO L226 Difference]: Without dead ends: 159 [2022-07-12 03:20:44,726 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-12 03:20:44,726 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-12 03:20:44,726 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-12 03:20:44,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-12 03:20:44,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 94. [2022-07-12 03:20:44,730 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-12 03:20:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2022-07-12 03:20:44,731 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 24 [2022-07-12 03:20:44,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:44,731 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2022-07-12 03:20:44,731 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-12 03:20:44,731 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2022-07-12 03:20:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 03:20:44,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:44,731 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-12 03:20:44,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 03:20:44,732 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-12 03:20:44,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:44,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2022-07-12 03:20:44,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:44,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895718599] [2022-07-12 03:20:44,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:44,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:44,934 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-12 03:20:44,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:44,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895718599] [2022-07-12 03:20:44,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895718599] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:44,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:44,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:20:44,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104021272] [2022-07-12 03:20:44,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:44,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:20:44,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:44,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:20:44,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:20:44,937 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-12 03:20:45,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:45,217 INFO L93 Difference]: Finished difference Result 249 states and 280 transitions. [2022-07-12 03:20:45,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:20:45,218 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-12 03:20:45,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:45,220 INFO L225 Difference]: With dead ends: 249 [2022-07-12 03:20:45,220 INFO L226 Difference]: Without dead ends: 247 [2022-07-12 03:20:45,220 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-12 03:20:45,221 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 253 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 03:20:45,221 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-12 03:20:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-12 03:20:45,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 106. [2022-07-12 03:20:45,227 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-12 03:20:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2022-07-12 03:20:45,227 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 24 [2022-07-12 03:20:45,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:45,227 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2022-07-12 03:20:45,227 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-12 03:20:45,228 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2022-07-12 03:20:45,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 03:20:45,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:45,228 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-12 03:20:45,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 03:20:45,229 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-12 03:20:45,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:45,229 INFO L85 PathProgramCache]: Analyzing trace with hash -545310703, now seen corresponding path program 1 times [2022-07-12 03:20:45,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:45,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773143716] [2022-07-12 03:20:45,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:45,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:45,286 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-12 03:20:45,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:45,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773143716] [2022-07-12 03:20:45,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773143716] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:45,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:45,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:20:45,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094194711] [2022-07-12 03:20:45,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:45,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:20:45,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:45,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:20:45,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:45,288 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-12 03:20:45,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:45,353 INFO L93 Difference]: Finished difference Result 158 states and 182 transitions. [2022-07-12 03:20:45,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:20:45,353 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-12 03:20:45,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:45,354 INFO L225 Difference]: With dead ends: 158 [2022-07-12 03:20:45,354 INFO L226 Difference]: Without dead ends: 140 [2022-07-12 03:20:45,354 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-12 03:20:45,355 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-12 03:20:45,355 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-12 03:20:45,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-12 03:20:45,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2022-07-12 03:20:45,360 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-12 03:20:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 157 transitions. [2022-07-12 03:20:45,360 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 157 transitions. Word has length 26 [2022-07-12 03:20:45,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:45,360 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 157 transitions. [2022-07-12 03:20:45,360 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-12 03:20:45,360 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 157 transitions. [2022-07-12 03:20:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 03:20:45,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:45,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, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:45,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 03:20:45,361 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-12 03:20:45,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:45,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1566334865, now seen corresponding path program 1 times [2022-07-12 03:20:45,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:45,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758376733] [2022-07-12 03:20:45,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:45,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:45,441 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-12 03:20:45,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:45,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758376733] [2022-07-12 03:20:45,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758376733] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:45,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:45,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:45,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388876661] [2022-07-12 03:20:45,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:45,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:45,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:45,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:45,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:45,443 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-12 03:20:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:45,482 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2022-07-12 03:20:45,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:45,483 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-12 03:20:45,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:45,483 INFO L225 Difference]: With dead ends: 132 [2022-07-12 03:20:45,483 INFO L226 Difference]: Without dead ends: 130 [2022-07-12 03:20:45,484 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-12 03:20:45,484 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-12 03:20:45,485 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-12 03:20:45,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-12 03:20:45,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-12 03:20:45,490 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-12 03:20:45,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2022-07-12 03:20:45,490 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 26 [2022-07-12 03:20:45,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:45,491 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2022-07-12 03:20:45,491 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-12 03:20:45,491 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2022-07-12 03:20:45,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 03:20:45,494 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:45,494 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-12 03:20:45,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 03:20:45,497 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-12 03:20:45,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:45,497 INFO L85 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2022-07-12 03:20:45,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:45,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484840482] [2022-07-12 03:20:45,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:45,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:45,680 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-12 03:20:45,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:45,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484840482] [2022-07-12 03:20:45,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484840482] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:45,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:45,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:20:45,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248171030] [2022-07-12 03:20:45,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:45,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:20:45,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:45,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:20:45,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:20:45,682 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-12 03:20:45,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:45,927 INFO L93 Difference]: Finished difference Result 290 states and 338 transitions. [2022-07-12 03:20:45,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:20:45,927 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-12 03:20:45,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:45,928 INFO L225 Difference]: With dead ends: 290 [2022-07-12 03:20:45,928 INFO L226 Difference]: Without dead ends: 288 [2022-07-12 03:20:45,929 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-12 03:20:45,929 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:45,929 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.1s Time] [2022-07-12 03:20:45,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-07-12 03:20:45,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 133. [2022-07-12 03:20:45,935 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-12 03:20:45,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 158 transitions. [2022-07-12 03:20:45,935 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 158 transitions. Word has length 27 [2022-07-12 03:20:45,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:45,935 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 158 transitions. [2022-07-12 03:20:45,935 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-12 03:20:45,936 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 158 transitions. [2022-07-12 03:20:45,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 03:20:45,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:45,936 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-12 03:20:45,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 03:20:45,936 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-12 03:20:45,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:45,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2026653164, now seen corresponding path program 1 times [2022-07-12 03:20:45,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:45,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359993601] [2022-07-12 03:20:45,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:45,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:46,005 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-12 03:20:46,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:46,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359993601] [2022-07-12 03:20:46,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359993601] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:20:46,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628958223] [2022-07-12 03:20:46,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:46,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:20:46,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:46,008 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-12 03:20:46,044 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-12 03:20:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:46,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 03:20:46,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:46,159 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-12 03:20:46,217 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-12 03:20:46,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:46,258 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-12 03:20:46,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:46,264 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-12 03:20:46,354 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-12 03:20:46,356 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-12 03:20:46,360 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-12 03:20:46,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:20:46,427 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-12 03:20:46,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628958223] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:20:46,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:20:46,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-07-12 03:20:46,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704829993] [2022-07-12 03:20:46,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:20:46,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:20:46,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:46,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:20:46,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:20:46,428 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-12 03:20:46,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:46,552 INFO L93 Difference]: Finished difference Result 220 states and 257 transitions. [2022-07-12 03:20:46,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:20:46,553 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-12 03:20:46,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:46,553 INFO L225 Difference]: With dead ends: 220 [2022-07-12 03:20:46,553 INFO L226 Difference]: Without dead ends: 158 [2022-07-12 03:20:46,554 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-12 03:20:46,554 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-12 03:20:46,554 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-12 03:20:46,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-12 03:20:46,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 135. [2022-07-12 03:20:46,560 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-12 03:20:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2022-07-12 03:20:46,560 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 29 [2022-07-12 03:20:46,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:46,560 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2022-07-12 03:20:46,561 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-12 03:20:46,561 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2022-07-12 03:20:46,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 03:20:46,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:46,561 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-12 03:20:46,585 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-12 03:20:46,770 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-12 03:20:46,771 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-12 03:20:46,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:46,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2133518130, now seen corresponding path program 1 times [2022-07-12 03:20:46,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:46,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001121786] [2022-07-12 03:20:46,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:46,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:46,888 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-12 03:20:46,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:46,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001121786] [2022-07-12 03:20:46,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001121786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:46,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:46,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:20:46,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267220124] [2022-07-12 03:20:46,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:46,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:20:46,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:46,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:20:46,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:20:46,891 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-12 03:20:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:47,002 INFO L93 Difference]: Finished difference Result 178 states and 200 transitions. [2022-07-12 03:20:47,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:20:47,002 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-12 03:20:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:47,003 INFO L225 Difference]: With dead ends: 178 [2022-07-12 03:20:47,003 INFO L226 Difference]: Without dead ends: 158 [2022-07-12 03:20:47,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:20:47,004 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-12 03:20:47,004 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-12 03:20:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-12 03:20:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 134. [2022-07-12 03:20:47,010 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-12 03:20:47,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2022-07-12 03:20:47,011 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 29 [2022-07-12 03:20:47,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:47,011 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2022-07-12 03:20:47,011 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-12 03:20:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2022-07-12 03:20:47,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 03:20:47,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:47,012 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-12 03:20:47,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 03:20:47,012 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-12 03:20:47,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:47,013 INFO L85 PathProgramCache]: Analyzing trace with hash 830518973, now seen corresponding path program 1 times [2022-07-12 03:20:47,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:47,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192809538] [2022-07-12 03:20:47,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:47,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:47,073 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-12 03:20:47,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:47,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192809538] [2022-07-12 03:20:47,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192809538] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:20:47,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107276654] [2022-07-12 03:20:47,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:47,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:20:47,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:47,075 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-12 03:20:47,095 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-12 03:20:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:47,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 03:20:47,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:47,178 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-12 03:20:47,181 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-12 03:20:47,209 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 03:20:47,209 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-12 03:20:47,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:47,214 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-12 03:20:47,260 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-12 03:20:47,262 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-12 03:20:47,264 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-12 03:20:47,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:20:47,314 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-12 03:20:47,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107276654] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:20:47,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:20:47,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2022-07-12 03:20:47,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791999607] [2022-07-12 03:20:47,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:20:47,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:20:47,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:47,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:20:47,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:20:47,315 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-12 03:20:47,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:47,487 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2022-07-12 03:20:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:20:47,488 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-12 03:20:47,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:47,488 INFO L225 Difference]: With dead ends: 223 [2022-07-12 03:20:47,488 INFO L226 Difference]: Without dead ends: 192 [2022-07-12 03:20:47,489 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-12 03:20:47,489 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-12 03:20:47,489 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-12 03:20:47,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-12 03:20:47,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 151. [2022-07-12 03:20:47,495 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-12 03:20:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 181 transitions. [2022-07-12 03:20:47,495 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 181 transitions. Word has length 32 [2022-07-12 03:20:47,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:47,495 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 181 transitions. [2022-07-12 03:20:47,496 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-12 03:20:47,496 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 181 transitions. [2022-07-12 03:20:47,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 03:20:47,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:47,496 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-12 03:20:47,541 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-12 03:20:47,696 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-12 03:20:47,697 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-12 03:20:47,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:47,697 INFO L85 PathProgramCache]: Analyzing trace with hash -60835504, now seen corresponding path program 1 times [2022-07-12 03:20:47,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:47,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116602557] [2022-07-12 03:20:47,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:47,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:47,743 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-12 03:20:47,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:47,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116602557] [2022-07-12 03:20:47,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116602557] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:47,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:47,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:47,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399560906] [2022-07-12 03:20:47,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:47,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:47,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:47,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:47,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:47,744 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-12 03:20:47,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:47,759 INFO L93 Difference]: Finished difference Result 310 states and 380 transitions. [2022-07-12 03:20:47,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:47,760 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-12 03:20:47,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:47,761 INFO L225 Difference]: With dead ends: 310 [2022-07-12 03:20:47,761 INFO L226 Difference]: Without dead ends: 228 [2022-07-12 03:20:47,761 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-12 03:20:47,762 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-12 03:20:47,762 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-12 03:20:47,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-12 03:20:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 188. [2022-07-12 03:20:47,769 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-12 03:20:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 227 transitions. [2022-07-12 03:20:47,770 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 227 transitions. Word has length 32 [2022-07-12 03:20:47,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:47,770 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 227 transitions. [2022-07-12 03:20:47,770 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-12 03:20:47,771 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 227 transitions. [2022-07-12 03:20:47,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 03:20:47,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:47,771 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-12 03:20:47,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 03:20:47,771 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-12 03:20:47,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:47,772 INFO L85 PathProgramCache]: Analyzing trace with hash -431498650, now seen corresponding path program 1 times [2022-07-12 03:20:47,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:47,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739015324] [2022-07-12 03:20:47,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:47,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:47,840 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-12 03:20:47,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:47,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739015324] [2022-07-12 03:20:47,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739015324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:47,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:47,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:20:47,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178854463] [2022-07-12 03:20:47,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:47,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:20:47,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:47,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:20:47,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:47,841 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-12 03:20:47,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:47,921 INFO L93 Difference]: Finished difference Result 306 states and 371 transitions. [2022-07-12 03:20:47,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:20:47,921 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-12 03:20:47,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:47,922 INFO L225 Difference]: With dead ends: 306 [2022-07-12 03:20:47,922 INFO L226 Difference]: Without dead ends: 197 [2022-07-12 03:20:47,922 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-12 03:20:47,923 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 13 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 03:20:47,923 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-12 03:20:47,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-12 03:20:47,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 190. [2022-07-12 03:20:47,928 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-12 03:20:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 229 transitions. [2022-07-12 03:20:47,929 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 229 transitions. Word has length 36 [2022-07-12 03:20:47,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:47,929 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 229 transitions. [2022-07-12 03:20:47,929 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-12 03:20:47,929 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 229 transitions. [2022-07-12 03:20:47,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 03:20:47,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:47,929 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-12 03:20:47,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 03:20:47,930 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-12 03:20:47,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:47,930 INFO L85 PathProgramCache]: Analyzing trace with hash 589569704, now seen corresponding path program 1 times [2022-07-12 03:20:47,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:47,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570669652] [2022-07-12 03:20:47,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:47,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:48,095 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-12 03:20:48,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:48,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570669652] [2022-07-12 03:20:48,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570669652] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:20:48,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068569439] [2022-07-12 03:20:48,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:48,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:20:48,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:48,097 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-12 03:20:48,099 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-12 03:20:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:48,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-12 03:20:48,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:48,245 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-12 03:20:48,257 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-12 03:20:48,260 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-12 03:20:48,328 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:20:48,328 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-12 03:20:48,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:48,337 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-12 03:20:48,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:48,343 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-12 03:20:48,352 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-12 03:20:48,357 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-12 03:20:48,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:48,536 INFO L356 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-07-12 03:20:48,537 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-12 03:20:48,591 INFO L356 Elim1Store]: treesize reduction 118, result has 29.8 percent of original size [2022-07-12 03:20:48,593 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 03:20:48,613 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-12 03:20:48,793 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-12 03:20:48,794 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 87 context size 87 output size 87 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:180) 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:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) 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-12 03:20:48,797 INFO L158 Benchmark]: Toolchain (without parser) took 6594.92ms. Allocated memory was 102.8MB in the beginning and 161.5MB in the end (delta: 58.7MB). Free memory was 63.4MB in the beginning and 58.9MB in the end (delta: 4.5MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. [2022-07-12 03:20:48,797 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:20:48,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.67ms. Allocated memory is still 102.8MB. Free memory was 63.2MB in the beginning and 68.2MB in the end (delta: -5.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 03:20:48,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.94ms. Allocated memory is still 102.8MB. Free memory was 68.2MB in the beginning and 66.1MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 03:20:48,798 INFO L158 Benchmark]: Boogie Preprocessor took 21.89ms. Allocated memory is still 102.8MB. Free memory was 65.8MB in the beginning and 64.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:20:48,798 INFO L158 Benchmark]: RCFGBuilder took 492.98ms. Allocated memory is still 102.8MB. Free memory was 63.7MB in the beginning and 44.2MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-12 03:20:48,798 INFO L158 Benchmark]: TraceAbstraction took 5614.25ms. Allocated memory was 102.8MB in the beginning and 161.5MB in the end (delta: 58.7MB). Free memory was 43.6MB in the beginning and 58.9MB in the end (delta: -15.3MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. [2022-07-12 03:20:48,799 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.17ms. Allocated memory is still 102.8MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.67ms. Allocated memory is still 102.8MB. Free memory was 63.2MB in the beginning and 68.2MB in the end (delta: -5.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.94ms. Allocated memory is still 102.8MB. Free memory was 68.2MB in the beginning and 66.1MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.89ms. Allocated memory is still 102.8MB. Free memory was 65.8MB in the beginning and 64.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 492.98ms. Allocated memory is still 102.8MB. Free memory was 63.7MB in the beginning and 44.2MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5614.25ms. Allocated memory was 102.8MB in the beginning and 161.5MB in the end (delta: 58.7MB). Free memory was 43.6MB in the beginning and 58.9MB in the end (delta: -15.3MB). Peak memory consumption was 44.9MB. 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 87 context size 87 output size 87 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_3 input size 87 context size 87 output size 87: 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-12 03:20:48,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-?-6c24879 [2022-07-12 03:20:50,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:20:50,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:20:50,500 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:20:50,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:20:50,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:20:50,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:20:50,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:20:50,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:20:50,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:20:50,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:20:50,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:20:50,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:20:50,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:20:50,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:20:50,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:20:50,517 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:20:50,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:20:50,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:20:50,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:20:50,522 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:20:50,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:20:50,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:20:50,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:20:50,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:20:50,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:20:50,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:20:50,534 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:20:50,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:20:50,535 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:20:50,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:20:50,536 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:20:50,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:20:50,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:20:50,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:20:50,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:20:50,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:20:50,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:20:50,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:20:50,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:20:50,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:20:50,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:20:50,544 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 03:20:50,561 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:20:50,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:20:50,561 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:20:50,562 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:20:50,562 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:20:50,562 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:20:50,563 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:20:50,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:20:50,563 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:20:50,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:20:50,563 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:20:50,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:20:50,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:20:50,563 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:20:50,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:20:50,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:20:50,564 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 03:20:50,564 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 03:20:50,564 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 03:20:50,564 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:20:50,564 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:20:50,564 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:20:50,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:20:50,565 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:20:50,565 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:20:50,565 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:20:50,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:20:50,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:20:50,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:20:50,565 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:20:50,565 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 03:20:50,565 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 03:20:50,565 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:20:50,565 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:20:50,566 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:20:50,566 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 03:20:50,566 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-12 03:20:50,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:20:50,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:20:50,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:20:50,858 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:20:50,858 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:20:50,860 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-12 03:20:50,922 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/191f42a3b/4b380b7090b74e23a53bc31dca98054e/FLAG7bebb003a [2022-07-12 03:20:51,327 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:20:51,328 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2022-07-12 03:20:51,341 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/191f42a3b/4b380b7090b74e23a53bc31dca98054e/FLAG7bebb003a [2022-07-12 03:20:51,350 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/191f42a3b/4b380b7090b74e23a53bc31dca98054e [2022-07-12 03:20:51,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:20:51,360 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:20:51,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:20:51,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:20:51,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:20:51,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:20:51" (1/1) ... [2022-07-12 03:20:51,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ef777bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:51, skipping insertion in model container [2022-07-12 03:20:51,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:20:51" (1/1) ... [2022-07-12 03:20:51,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:20:51,405 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:20:51,622 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-12 03:20:51,631 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-12 03:20:51,633 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-12 03:20:51,633 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-12 03:20:51,635 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-12 03:20:51,636 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-12 03:20:51,637 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-12 03:20:51,638 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-12 03:20:51,638 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-12 03:20:51,639 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-12 03:20:51,640 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-12 03:20:51,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[23740,23753] [2022-07-12 03:20:51,642 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-12 03:20:51,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:20:51,655 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:20:51,693 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-12 03:20:51,701 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-12 03:20:51,703 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-12 03:20:51,703 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-12 03:20:51,709 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-12 03:20:51,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[22961,22974] [2022-07-12 03:20:51,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[23192,23205] [2022-07-12 03:20:51,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[23272,23285] [2022-07-12 03:20:51,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[23351,23364] [2022-07-12 03:20:51,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[23484,23497] [2022-07-12 03:20:51,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[23662,23675] [2022-07-12 03:20:51,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[23740,23753] [2022-07-12 03:20:51,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[23817,23830] [2022-07-12 03:20:51,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:20:51,744 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:20:51,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:51 WrapperNode [2022-07-12 03:20:51,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:20:51,745 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:20:51,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:20:51,745 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:20:51,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:51" (1/1) ... [2022-07-12 03:20:51,761 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:51" (1/1) ... [2022-07-12 03:20:51,778 INFO L137 Inliner]: procedures = 120, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 223 [2022-07-12 03:20:51,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:20:51,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:20:51,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:20:51,779 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:20:51,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:51" (1/1) ... [2022-07-12 03:20:51,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:51" (1/1) ... [2022-07-12 03:20:51,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:51" (1/1) ... [2022-07-12 03:20:51,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:51" (1/1) ... [2022-07-12 03:20:51,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:51" (1/1) ... [2022-07-12 03:20:51,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:51" (1/1) ... [2022-07-12 03:20:51,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:51" (1/1) ... [2022-07-12 03:20:51,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:20:51,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:20:51,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:20:51,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:20:51,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:51" (1/1) ... [2022-07-12 03:20:51,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:20:51,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:51,851 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-12 03:20:51,862 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-12 03:20:51,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:20:51,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:20:51,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:20:51,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:20:51,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:20:51,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 03:20:51,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:20:51,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:20:52,024 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:20:52,025 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:20:52,445 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:20:52,450 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:20:52,451 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-12 03:20:52,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:20:52 BoogieIcfgContainer [2022-07-12 03:20:52,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:20:52,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:20:52,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:20:52,455 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:20:52,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:20:51" (1/3) ... [2022-07-12 03:20:52,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d403b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:20:52, skipping insertion in model container [2022-07-12 03:20:52,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:51" (2/3) ... [2022-07-12 03:20:52,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d403b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:20:52, skipping insertion in model container [2022-07-12 03:20:52,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:20:52" (3/3) ... [2022-07-12 03:20:52,457 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2022-07-12 03:20:52,468 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:20:52,468 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-07-12 03:20:52,502 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:20:52,507 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@639f6628, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3dfe06a8 [2022-07-12 03:20:52,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-07-12 03:20:52,516 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-12 03:20:52,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-12 03:20:52,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:52,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-12 03:20:52,522 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-12 03:20:52,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:52,525 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2022-07-12 03:20:52,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:52,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280672718] [2022-07-12 03:20:52,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:52,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:52,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:52,536 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-12 03:20:52,537 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-12 03:20:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:52,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 03:20:52,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:52,625 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-12 03:20:52,625 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:52,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:52,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280672718] [2022-07-12 03:20:52,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280672718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:52,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:52,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:52,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329264003] [2022-07-12 03:20:52,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:52,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:52,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:52,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:52,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:52,654 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-12 03:20:52,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:52,731 INFO L93 Difference]: Finished difference Result 176 states and 294 transitions. [2022-07-12 03:20:52,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:52,734 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-12 03:20:52,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:52,744 INFO L225 Difference]: With dead ends: 176 [2022-07-12 03:20:52,744 INFO L226 Difference]: Without dead ends: 93 [2022-07-12 03:20:52,747 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-12 03:20:52,750 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-12 03:20:52,755 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-12 03:20:52,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-12 03:20:52,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2022-07-12 03:20:52,798 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-12 03:20:52,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2022-07-12 03:20:52,803 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 4 [2022-07-12 03:20:52,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:52,803 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2022-07-12 03:20:52,804 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-12 03:20:52,804 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2022-07-12 03:20:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 03:20:52,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:52,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:52,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:20:53,015 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-12 03:20:53,016 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-12 03:20:53,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:53,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1534452756, now seen corresponding path program 1 times [2022-07-12 03:20:53,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:53,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [12205541] [2022-07-12 03:20:53,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:53,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:53,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:53,021 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-12 03:20:53,024 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-12 03:20:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:53,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:20:53,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:53,133 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-12 03:20:53,145 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-12 03:20:53,200 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-12 03:20:53,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:53,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:53,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [12205541] [2022-07-12 03:20:53,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [12205541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:53,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:53,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:53,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117592328] [2022-07-12 03:20:53,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:53,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:53,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:53,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:53,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:53,204 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-12 03:20:53,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:53,455 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2022-07-12 03:20:53,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:20:53,456 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-12 03:20:53,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:53,457 INFO L225 Difference]: With dead ends: 198 [2022-07-12 03:20:53,457 INFO L226 Difference]: Without dead ends: 130 [2022-07-12 03:20:53,457 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-12 03:20:53,458 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-12 03:20:53,458 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-12 03:20:53,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-12 03:20:53,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2022-07-12 03:20:53,468 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-12 03:20:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2022-07-12 03:20:53,469 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 9 [2022-07-12 03:20:53,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:53,469 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2022-07-12 03:20:53,469 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-12 03:20:53,469 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2022-07-12 03:20:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 03:20:53,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:53,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:53,482 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-12 03:20:53,677 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-12 03:20:53,678 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-12 03:20:53,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:53,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1534454678, now seen corresponding path program 1 times [2022-07-12 03:20:53,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:53,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800183855] [2022-07-12 03:20:53,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:53,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:53,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:53,682 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-12 03:20:53,684 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-12 03:20:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:53,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:20:53,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:53,752 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-12 03:20:53,758 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-12 03:20:53,796 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-12 03:20:53,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:53,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:53,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800183855] [2022-07-12 03:20:53,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800183855] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:53,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:53,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:53,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585064550] [2022-07-12 03:20:53,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:53,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:53,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:53,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:53,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:53,798 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-12 03:20:54,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:54,060 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2022-07-12 03:20:54,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:20:54,061 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-12 03:20:54,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:54,062 INFO L225 Difference]: With dead ends: 131 [2022-07-12 03:20:54,062 INFO L226 Difference]: Without dead ends: 129 [2022-07-12 03:20:54,062 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-12 03:20:54,063 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-12 03:20:54,063 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-12 03:20:54,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-12 03:20:54,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 78. [2022-07-12 03:20:54,068 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-12 03:20:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2022-07-12 03:20:54,069 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 9 [2022-07-12 03:20:54,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:54,069 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2022-07-12 03:20:54,069 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-12 03:20:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2022-07-12 03:20:54,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 03:20:54,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:54,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:54,094 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-12 03:20:54,270 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-12 03:20:54,271 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-12 03:20:54,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:54,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1536301720, now seen corresponding path program 1 times [2022-07-12 03:20:54,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:54,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081601625] [2022-07-12 03:20:54,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:54,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:54,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:54,274 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-12 03:20:54,276 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-12 03:20:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:54,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 03:20:54,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:54,450 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-12 03:20:54,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:54,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:54,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081601625] [2022-07-12 03:20:54,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081601625] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:54,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:54,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:54,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104395510] [2022-07-12 03:20:54,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:54,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:54,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:54,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:54,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:54,456 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-12 03:20:54,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:54,662 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2022-07-12 03:20:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:20:54,662 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-12 03:20:54,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:54,663 INFO L225 Difference]: With dead ends: 79 [2022-07-12 03:20:54,663 INFO L226 Difference]: Without dead ends: 77 [2022-07-12 03:20:54,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:54,664 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-12 03:20:54,664 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-12 03:20:54,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-12 03:20:54,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-07-12 03:20:54,669 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-12 03:20:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2022-07-12 03:20:54,669 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 9 [2022-07-12 03:20:54,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:54,670 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2022-07-12 03:20:54,670 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-12 03:20:54,670 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2022-07-12 03:20:54,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 03:20:54,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:54,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:54,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-12 03:20:54,882 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-12 03:20:54,882 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-12 03:20:54,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:54,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1743237117, now seen corresponding path program 1 times [2022-07-12 03:20:54,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:54,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271522853] [2022-07-12 03:20:54,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:54,883 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:54,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:54,884 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-12 03:20:54,886 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-12 03:20:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:54,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 03:20:54,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:54,994 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-12 03:20:54,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:54,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:54,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271522853] [2022-07-12 03:20:54,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271522853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:54,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:54,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:54,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116038282] [2022-07-12 03:20:54,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:54,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:54,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:54,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:54,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:54,996 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-12 03:20:55,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:55,077 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-07-12 03:20:55,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:55,078 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-12 03:20:55,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:55,078 INFO L225 Difference]: With dead ends: 77 [2022-07-12 03:20:55,078 INFO L226 Difference]: Without dead ends: 73 [2022-07-12 03:20:55,078 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-12 03:20:55,079 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-12 03:20:55,079 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-12 03:20:55,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-12 03:20:55,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-07-12 03:20:55,083 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-12 03:20:55,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-07-12 03:20:55,084 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 13 [2022-07-12 03:20:55,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:55,084 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-07-12 03:20:55,084 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-12 03:20:55,084 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-07-12 03:20:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 03:20:55,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:55,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:55,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 03:20:55,308 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-12 03:20:55,310 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-12 03:20:55,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:55,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1794227426, now seen corresponding path program 1 times [2022-07-12 03:20:55,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:55,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494168769] [2022-07-12 03:20:55,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:55,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:55,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:55,312 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-12 03:20:55,313 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-12 03:20:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:55,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:20:55,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:55,387 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-12 03:20:55,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:55,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:55,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494168769] [2022-07-12 03:20:55,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494168769] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:55,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:55,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:55,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678895673] [2022-07-12 03:20:55,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:55,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:55,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:55,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:55,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:55,388 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-12 03:20:55,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:55,564 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2022-07-12 03:20:55,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:20:55,564 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-12 03:20:55,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:55,565 INFO L225 Difference]: With dead ends: 131 [2022-07-12 03:20:55,565 INFO L226 Difference]: Without dead ends: 111 [2022-07-12 03:20:55,565 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-12 03:20:55,566 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 131 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 03:20:55,566 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-12 03:20:55,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-12 03:20:55,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 70. [2022-07-12 03:20:55,570 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-12 03:20:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-07-12 03:20:55,570 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 14 [2022-07-12 03:20:55,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:55,570 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-07-12 03:20:55,570 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-12 03:20:55,571 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-07-12 03:20:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:20:55,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:55,571 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-12 03:20:55,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 03:20:55,771 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-12 03:20:55,772 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-12 03:20:55,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:55,772 INFO L85 PathProgramCache]: Analyzing trace with hash -140282291, now seen corresponding path program 1 times [2022-07-12 03:20:55,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:55,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935803594] [2022-07-12 03:20:55,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:55,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:55,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:55,774 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-12 03:20:55,775 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-12 03:20:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:55,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 03:20:55,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:55,836 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-12 03:20:55,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:55,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:55,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935803594] [2022-07-12 03:20:55,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935803594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:55,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:55,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:55,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805213290] [2022-07-12 03:20:55,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:55,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:55,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:55,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:55,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:55,837 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-12 03:20:55,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:55,855 INFO L93 Difference]: Finished difference Result 136 states and 156 transitions. [2022-07-12 03:20:55,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:55,857 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-12 03:20:55,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:55,858 INFO L225 Difference]: With dead ends: 136 [2022-07-12 03:20:55,858 INFO L226 Difference]: Without dead ends: 94 [2022-07-12 03:20:55,858 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-12 03:20:55,859 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-12 03:20:55,859 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-12 03:20:55,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-12 03:20:55,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2022-07-12 03:20:55,862 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-12 03:20:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2022-07-12 03:20:55,862 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 18 [2022-07-12 03:20:55,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:55,863 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2022-07-12 03:20:55,863 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-12 03:20:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2022-07-12 03:20:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 03:20:55,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:55,863 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-12 03:20:55,873 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-12 03:20:56,073 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-12 03:20:56,074 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-12 03:20:56,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:56,074 INFO L85 PathProgramCache]: Analyzing trace with hash -53794182, now seen corresponding path program 1 times [2022-07-12 03:20:56,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:56,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181014554] [2022-07-12 03:20:56,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:56,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:56,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:56,076 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-12 03:20:56,077 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-12 03:20:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:56,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 03:20:56,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:56,160 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-12 03:20:56,165 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-12 03:20:56,247 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-12 03:20:56,250 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-12 03:20:56,261 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-12 03:20:56,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:56,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:56,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181014554] [2022-07-12 03:20:56,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181014554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:56,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:56,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:20:56,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981007128] [2022-07-12 03:20:56,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:56,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:20:56,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:56,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:20:56,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:56,262 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-12 03:20:56,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:56,640 INFO L93 Difference]: Finished difference Result 183 states and 210 transitions. [2022-07-12 03:20:56,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:20:56,641 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-12 03:20:56,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:56,642 INFO L225 Difference]: With dead ends: 183 [2022-07-12 03:20:56,642 INFO L226 Difference]: Without dead ends: 138 [2022-07-12 03:20:56,642 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-12 03:20:56,643 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 112 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-12 03:20:56,643 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-12 03:20:56,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-12 03:20:56,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 82. [2022-07-12 03:20:56,656 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-12 03:20:56,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2022-07-12 03:20:56,656 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 19 [2022-07-12 03:20:56,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:56,656 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2022-07-12 03:20:56,657 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-12 03:20:56,657 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2022-07-12 03:20:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 03:20:56,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:56,657 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-12 03:20:56,665 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-12 03:20:56,863 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-12 03:20:56,864 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-12 03:20:56,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:56,865 INFO L85 PathProgramCache]: Analyzing trace with hash -746851846, now seen corresponding path program 1 times [2022-07-12 03:20:56,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:56,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411061833] [2022-07-12 03:20:56,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:56,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:56,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:56,866 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-12 03:20:56,867 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-12 03:20:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:56,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:20:56,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:56,976 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-12 03:20:56,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:56,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:56,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411061833] [2022-07-12 03:20:56,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411061833] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:56,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:56,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:56,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540488382] [2022-07-12 03:20:56,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:56,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:56,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:56,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:56,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:56,977 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-12 03:20:56,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:56,992 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2022-07-12 03:20:56,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:56,993 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-12 03:20:56,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:56,993 INFO L225 Difference]: With dead ends: 82 [2022-07-12 03:20:56,993 INFO L226 Difference]: Without dead ends: 80 [2022-07-12 03:20:56,994 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-12 03:20:56,994 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-12 03:20:56,994 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-12 03:20:56,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-12 03:20:56,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-12 03:20:56,998 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-12 03:20:56,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2022-07-12 03:20:56,998 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 19 [2022-07-12 03:20:56,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:56,998 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2022-07-12 03:20:56,998 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-12 03:20:56,998 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2022-07-12 03:20:56,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:20:56,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:56,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] [2022-07-12 03:20:57,010 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-12 03:20:57,199 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-12 03:20:57,199 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-12 03:20:57,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:57,200 INFO L85 PathProgramCache]: Analyzing trace with hash -169331172, now seen corresponding path program 1 times [2022-07-12 03:20:57,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:57,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231496125] [2022-07-12 03:20:57,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:57,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:57,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:57,201 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-12 03:20:57,202 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-12 03:20:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:57,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:20:57,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:57,280 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-12 03:20:57,286 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-12 03:20:57,322 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-12 03:20:57,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:57,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:57,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231496125] [2022-07-12 03:20:57,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231496125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:57,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:57,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:57,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355639993] [2022-07-12 03:20:57,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:57,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:57,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:57,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:57,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:57,324 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-12 03:20:57,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:57,542 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2022-07-12 03:20:57,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:20:57,543 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-12 03:20:57,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:57,543 INFO L225 Difference]: With dead ends: 147 [2022-07-12 03:20:57,543 INFO L226 Difference]: Without dead ends: 88 [2022-07-12 03:20:57,544 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-12 03:20:57,544 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-12 03:20:57,544 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-12 03:20:57,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-12 03:20:57,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2022-07-12 03:20:57,548 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-12 03:20:57,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2022-07-12 03:20:57,549 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 20 [2022-07-12 03:20:57,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:57,549 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2022-07-12 03:20:57,549 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-12 03:20:57,549 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2022-07-12 03:20:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:20:57,550 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:57,550 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-12 03:20:57,560 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-12 03:20:57,759 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-12 03:20:57,760 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-12 03:20:57,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:57,760 INFO L85 PathProgramCache]: Analyzing trace with hash -169329250, now seen corresponding path program 1 times [2022-07-12 03:20:57,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:57,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493201557] [2022-07-12 03:20:57,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:57,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:57,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:57,762 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-12 03:20:57,764 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-12 03:20:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:57,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:20:57,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:57,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-12 03:20:57,886 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-12 03:20:57,929 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-12 03:20:57,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:57,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:57,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493201557] [2022-07-12 03:20:57,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493201557] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:57,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:57,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:57,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651167709] [2022-07-12 03:20:57,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:57,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:57,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:57,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:57,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:57,930 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-12 03:20:58,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:58,119 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2022-07-12 03:20:58,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:20:58,119 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-12 03:20:58,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:58,120 INFO L225 Difference]: With dead ends: 89 [2022-07-12 03:20:58,120 INFO L226 Difference]: Without dead ends: 87 [2022-07-12 03:20:58,120 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-12 03:20:58,120 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-12 03:20:58,121 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-12 03:20:58,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-12 03:20:58,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2022-07-12 03:20:58,123 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-12 03:20:58,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2022-07-12 03:20:58,124 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 20 [2022-07-12 03:20:58,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:58,124 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2022-07-12 03:20:58,124 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-12 03:20:58,124 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2022-07-12 03:20:58,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:20:58,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:58,124 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-12 03:20:58,134 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-12 03:20:58,325 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-12 03:20:58,325 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-12 03:20:58,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:58,325 INFO L85 PathProgramCache]: Analyzing trace with hash -167482208, now seen corresponding path program 1 times [2022-07-12 03:20:58,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:58,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670114013] [2022-07-12 03:20:58,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:58,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:58,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:58,327 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-12 03:20:58,328 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-12 03:20:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:58,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 03:20:58,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:58,489 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-12 03:20:58,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:58,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:58,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670114013] [2022-07-12 03:20:58,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670114013] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:58,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:58,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:58,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289179405] [2022-07-12 03:20:58,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:58,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:58,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:58,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:58,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:58,490 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-12 03:20:58,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:58,784 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2022-07-12 03:20:58,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:20:58,784 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-12 03:20:58,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:58,785 INFO L225 Difference]: With dead ends: 84 [2022-07-12 03:20:58,785 INFO L226 Difference]: Without dead ends: 82 [2022-07-12 03:20:58,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:58,785 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:58,785 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.3s Time] [2022-07-12 03:20:58,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-12 03:20:58,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2022-07-12 03:20:58,788 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-12 03:20:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2022-07-12 03:20:58,788 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 20 [2022-07-12 03:20:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:58,788 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2022-07-12 03:20:58,788 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-12 03:20:58,788 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2022-07-12 03:20:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 03:20:58,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:58,789 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-12 03:20:58,804 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-12 03:20:58,998 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-12 03:20:58,998 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-12 03:20:58,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:58,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1528659518, now seen corresponding path program 1 times [2022-07-12 03:20:58,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:58,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441243506] [2022-07-12 03:20:58,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:58,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:58,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:59,000 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-12 03:20:59,002 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-12 03:20:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:59,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-12 03:20:59,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:59,137 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-12 03:20:59,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:59,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:59,233 INFO L356 Elim1Store]: treesize reduction 89, result has 7.3 percent of original size [2022-07-12 03:20:59,233 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-12 03:20:59,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:59,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:59,247 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-12 03:20:59,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:59,255 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 58 [2022-07-12 03:20:59,261 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-12 03:20:59,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:59,302 INFO L356 Elim1Store]: treesize reduction 45, result has 47.7 percent of original size [2022-07-12 03:20:59,303 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 67 [2022-07-12 03:20:59,317 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-12 03:20:59,317 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-12 03:20:59,349 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-12 03:20:59,403 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2022-07-12 03:20:59,425 INFO L356 Elim1Store]: treesize reduction 29, result has 34.1 percent of original size [2022-07-12 03:20:59,426 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 1 case distinctions, treesize of input 22 treesize of output 32 [2022-07-12 03:21:28,697 WARN L233 SmtUtils]: Spent 29.25s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:21:55,005 WARN L233 SmtUtils]: Spent 26.03s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:22:01,224 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:22:02,341 INFO L356 Elim1Store]: treesize reduction 32, result has 90.9 percent of original size [2022-07-12 03:22:02,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 283 treesize of output 545 [2022-07-12 03:22:03,777 INFO L356 Elim1Store]: treesize reduction 138, result has 71.3 percent of original size [2022-07-12 03:22:03,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 13 new quantified variables, introduced 45 case distinctions, treesize of input 554 treesize of output 671 [2022-07-12 03:23:30,443 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 19 treesize of output 11 [2022-07-12 03:23:30,636 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 19 treesize of output 11 [2022-07-12 03:23:34,614 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 19 treesize of output 11 [2022-07-12 03:23:38,094 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 19 treesize of output 11 [2022-07-12 03:23:40,633 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 19 treesize of output 11 [2022-07-12 03:23:41,028 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 19 treesize of output 11 [2022-07-12 03:23:46,765 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 19 treesize of output 11 [2022-07-12 03:23:47,073 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 19 treesize of output 11 [2022-07-12 03:23:49,186 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 19 treesize of output 11 [2022-07-12 03:23:49,345 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 19 treesize of output 11 [2022-07-12 03:23:51,228 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 22 treesize of output 14 [2022-07-12 03:23:51,509 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 22 treesize of output 14 [2022-07-12 03:24:42,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:24:42,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:24:42,286 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 22 treesize of output 10 [2022-07-12 03:24:42,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:24:42,469 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:24:42,472 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 22 treesize of output 10 [2022-07-12 03:24:42,891 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 19 treesize of output 11 [2022-07-12 03:24:43,229 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 03:24:45,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:24:45,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:24:45,995 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 22 treesize of output 10 [2022-07-12 03:24:46,316 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 22 treesize of output 14 [2022-07-12 03:24:46,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:24:46,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:24:46,645 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 22 treesize of output 10 [2022-07-12 03:24:46,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:24:46,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:24:46,807 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 22 treesize of output 10 [2022-07-12 03:24:50,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:24:50,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:24:50,158 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 22 treesize of output 10 [2022-07-12 03:24:50,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:24:50,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:24:50,416 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 22 treesize of output 10 [2022-07-12 03:24:50,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:24:50,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:24:50,615 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 22 treesize of output 10 [2022-07-12 03:24:51,040 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 19 treesize of output 11 [2022-07-12 03:24:51,378 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 19 treesize of output 11