./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/sll-01-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 14:09:29,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 14:09:29,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 14:09:29,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 14:09:29,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 14:09:29,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 14:09:29,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 14:09:29,503 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 14:09:29,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 14:09:29,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 14:09:29,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 14:09:29,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 14:09:29,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 14:09:29,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 14:09:29,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 14:09:29,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 14:09:29,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 14:09:29,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 14:09:29,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 14:09:29,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 14:09:29,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 14:09:29,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 14:09:29,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 14:09:29,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 14:09:29,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 14:09:29,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 14:09:29,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 14:09:29,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 14:09:29,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 14:09:29,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 14:09:29,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 14:09:29,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 14:09:29,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 14:09:29,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 14:09:29,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 14:09:29,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 14:09:29,547 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 14:09:29,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 14:09:29,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 14:09:29,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 14:09:29,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 14:09:29,551 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 14:09:29,566 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 14:09:29,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 14:09:29,568 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 14:09:29,568 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 14:09:29,569 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 14:09:29,569 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 14:09:29,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 14:09:29,570 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 14:09:29,570 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 14:09:29,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 14:09:29,571 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 14:09:29,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 14:09:29,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 14:09:29,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 14:09:29,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 14:09:29,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 14:09:29,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 14:09:29,572 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 14:09:29,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 14:09:29,573 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 14:09:29,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 14:09:29,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 14:09:29,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 14:09:29,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 14:09:29,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 14:09:29,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 14:09:29,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 14:09:29,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 14:09:29,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 14:09:29,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 14:09:29,574 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 14:09:29,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 14:09:29,575 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 14:09:29,575 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 14:09:29,575 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 14:09:29,575 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d [2023-02-18 14:09:29,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 14:09:29,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 14:09:29,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 14:09:29,825 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 14:09:29,825 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 14:09:29,826 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-1.i [2023-02-18 14:09:30,998 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 14:09:31,233 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 14:09:31,233 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i [2023-02-18 14:09:31,244 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/718cf9fe1/c9518262bfe34cc194c036ddfccaf0e1/FLAG1bf565e4c [2023-02-18 14:09:31,265 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/718cf9fe1/c9518262bfe34cc194c036ddfccaf0e1 [2023-02-18 14:09:31,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 14:09:31,268 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 14:09:31,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 14:09:31,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 14:09:31,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 14:09:31,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 02:09:31" (1/1) ... [2023-02-18 14:09:31,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77d7ee28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:31, skipping insertion in model container [2023-02-18 14:09:31,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 02:09:31" (1/1) ... [2023-02-18 14:09:31,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 14:09:31,321 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 14:09:31,611 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2023-02-18 14:09:31,625 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2023-02-18 14:09:31,630 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2023-02-18 14:09:31,634 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2023-02-18 14:09:31,639 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2023-02-18 14:09:31,641 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2023-02-18 14:09:31,644 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2023-02-18 14:09:31,647 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2023-02-18 14:09:31,648 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2023-02-18 14:09:31,650 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2023-02-18 14:09:31,653 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2023-02-18 14:09:31,654 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2023-02-18 14:09:31,655 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2023-02-18 14:09:31,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 14:09:31,671 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 14:09:31,705 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2023-02-18 14:09:31,710 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2023-02-18 14:09:31,712 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2023-02-18 14:09:31,715 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2023-02-18 14:09:31,716 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2023-02-18 14:09:31,719 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2023-02-18 14:09:31,720 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2023-02-18 14:09:31,722 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2023-02-18 14:09:31,724 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2023-02-18 14:09:31,725 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2023-02-18 14:09:31,726 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2023-02-18 14:09:31,727 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2023-02-18 14:09:31,728 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2023-02-18 14:09:31,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 14:09:31,750 INFO L208 MainTranslator]: Completed translation [2023-02-18 14:09:31,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:31 WrapperNode [2023-02-18 14:09:31,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 14:09:31,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 14:09:31,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 14:09:31,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 14:09:31,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:31" (1/1) ... [2023-02-18 14:09:31,773 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:31" (1/1) ... [2023-02-18 14:09:31,795 INFO L138 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 221 [2023-02-18 14:09:31,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 14:09:31,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 14:09:31,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 14:09:31,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 14:09:31,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:31" (1/1) ... [2023-02-18 14:09:31,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:31" (1/1) ... [2023-02-18 14:09:31,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:31" (1/1) ... [2023-02-18 14:09:31,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:31" (1/1) ... [2023-02-18 14:09:31,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:31" (1/1) ... [2023-02-18 14:09:31,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:31" (1/1) ... [2023-02-18 14:09:31,822 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:31" (1/1) ... [2023-02-18 14:09:31,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:31" (1/1) ... [2023-02-18 14:09:31,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 14:09:31,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 14:09:31,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 14:09:31,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 14:09:31,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:31" (1/1) ... [2023-02-18 14:09:31,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 14:09:31,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 14:09:31,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 14:09:31,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 14:09:31,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-18 14:09:31,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 14:09:31,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-18 14:09:31,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-18 14:09:31,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-18 14:09:31,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 14:09:31,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 14:09:31,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 14:09:32,070 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 14:09:32,072 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 14:09:32,436 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 14:09:32,442 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 14:09:32,443 INFO L300 CfgBuilder]: Removed 30 assume(true) statements. [2023-02-18 14:09:32,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 02:09:32 BoogieIcfgContainer [2023-02-18 14:09:32,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 14:09:32,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 14:09:32,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 14:09:32,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 14:09:32,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 02:09:31" (1/3) ... [2023-02-18 14:09:32,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6054b5bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 02:09:32, skipping insertion in model container [2023-02-18 14:09:32,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:31" (2/3) ... [2023-02-18 14:09:32,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6054b5bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 02:09:32, skipping insertion in model container [2023-02-18 14:09:32,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 02:09:32" (3/3) ... [2023-02-18 14:09:32,457 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2023-02-18 14:09:32,471 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 14:09:32,471 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2023-02-18 14:09:32,515 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 14:09:32,521 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b02b541, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 14:09:32,521 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-02-18 14:09:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:32,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-18 14:09:32,535 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:32,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-18 14:09:32,536 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:32,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:32,540 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2023-02-18 14:09:32,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:09:32,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258116953] [2023-02-18 14:09:32,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:32,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:09:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:32,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:09:32,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258116953] [2023-02-18 14:09:32,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258116953] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:32,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:32,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 14:09:32,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800571442] [2023-02-18 14:09:32,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:32,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 14:09:32,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:09:32,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 14:09:32,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 14:09:32,767 INFO L87 Difference]: Start difference. First operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:32,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:32,821 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2023-02-18 14:09:32,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 14:09:32,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-18 14:09:32,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:32,830 INFO L225 Difference]: With dead ends: 180 [2023-02-18 14:09:32,831 INFO L226 Difference]: Without dead ends: 95 [2023-02-18 14:09:32,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 14:09:32,838 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 83 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:32,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 102 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 14:09:32,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-02-18 14:09:32,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2023-02-18 14:09:32,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.323076923076923) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2023-02-18 14:09:32,874 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 4 [2023-02-18 14:09:32,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:32,875 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2023-02-18 14:09:32,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2023-02-18 14:09:32,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-18 14:09:32,876 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:32,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:32,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 14:09:32,877 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:32,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:32,877 INFO L85 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2023-02-18 14:09:32,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:09:32,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332604246] [2023-02-18 14:09:32,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:32,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:09:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:32,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:32,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:09:32,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332604246] [2023-02-18 14:09:32,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332604246] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:32,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:32,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 14:09:32,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753482845] [2023-02-18 14:09:32,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:32,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 14:09:32,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:09:32,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 14:09:32,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 14:09:32,936 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:32,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:32,956 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2023-02-18 14:09:32,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 14:09:32,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-18 14:09:32,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:32,961 INFO L225 Difference]: With dead ends: 80 [2023-02-18 14:09:32,962 INFO L226 Difference]: Without dead ends: 78 [2023-02-18 14:09:32,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 14:09:32,963 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:32,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 14:09:32,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-18 14:09:32,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-02-18 14:09:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 77 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:32,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2023-02-18 14:09:32,976 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 10 [2023-02-18 14:09:32,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:32,977 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2023-02-18 14:09:32,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:32,977 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2023-02-18 14:09:32,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-18 14:09:32,978 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:32,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:32,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 14:09:32,978 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:32,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:32,979 INFO L85 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2023-02-18 14:09:32,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:09:32,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966653602] [2023-02-18 14:09:32,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:32,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:09:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:33,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:09:33,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966653602] [2023-02-18 14:09:33,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966653602] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:33,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:33,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 14:09:33,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798563976] [2023-02-18 14:09:33,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:33,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 14:09:33,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:09:33,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 14:09:33,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 14:09:33,144 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:33,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:33,263 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2023-02-18 14:09:33,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 14:09:33,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-18 14:09:33,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:33,265 INFO L225 Difference]: With dead ends: 79 [2023-02-18 14:09:33,265 INFO L226 Difference]: Without dead ends: 77 [2023-02-18 14:09:33,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 14:09:33,267 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:33,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 14:09:33,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-18 14:09:33,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2023-02-18 14:09:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.3125) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:33,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2023-02-18 14:09:33,275 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2023-02-18 14:09:33,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:33,275 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2023-02-18 14:09:33,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:33,275 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2023-02-18 14:09:33,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-18 14:09:33,276 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:33,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:33,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 14:09:33,277 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:33,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:33,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2023-02-18 14:09:33,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:09:33,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148671825] [2023-02-18 14:09:33,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:33,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:09:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:33,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:09:33,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148671825] [2023-02-18 14:09:33,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148671825] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:33,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:33,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 14:09:33,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335023473] [2023-02-18 14:09:33,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:33,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 14:09:33,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:09:33,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 14:09:33,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 14:09:33,336 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:33,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:33,397 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2023-02-18 14:09:33,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 14:09:33,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-18 14:09:33,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:33,398 INFO L225 Difference]: With dead ends: 78 [2023-02-18 14:09:33,399 INFO L226 Difference]: Without dead ends: 74 [2023-02-18 14:09:33,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 14:09:33,400 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 16 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:33,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 125 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 14:09:33,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-18 14:09:33,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2023-02-18 14:09:33,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 70 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2023-02-18 14:09:33,415 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 15 [2023-02-18 14:09:33,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:33,415 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2023-02-18 14:09:33,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:33,416 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2023-02-18 14:09:33,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 14:09:33,416 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:33,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:33,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-18 14:09:33,417 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:33,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:33,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1551589151, now seen corresponding path program 1 times [2023-02-18 14:09:33,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:09:33,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077710168] [2023-02-18 14:09:33,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:33,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:09:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:33,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:33,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:09:33,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077710168] [2023-02-18 14:09:33,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077710168] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:33,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:33,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 14:09:33,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931819542] [2023-02-18 14:09:33,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:33,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 14:09:33,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:09:33,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 14:09:33,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 14:09:33,584 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:33,650 INFO L93 Difference]: Finished difference Result 187 states and 209 transitions. [2023-02-18 14:09:33,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 14:09:33,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-18 14:09:33,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:33,651 INFO L225 Difference]: With dead ends: 187 [2023-02-18 14:09:33,652 INFO L226 Difference]: Without dead ends: 124 [2023-02-18 14:09:33,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 14:09:33,653 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 56 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:33,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 187 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 14:09:33,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-18 14:09:33,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 73. [2023-02-18 14:09:33,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.28125) internal successors, (82), 72 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:33,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2023-02-18 14:09:33,663 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 16 [2023-02-18 14:09:33,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:33,664 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2023-02-18 14:09:33,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:33,664 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2023-02-18 14:09:33,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 14:09:33,664 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:33,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:33,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-18 14:09:33,665 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:33,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:33,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2023-02-18 14:09:33,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:09:33,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856860307] [2023-02-18 14:09:33,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:33,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:09:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:33,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:33,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:09:33,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856860307] [2023-02-18 14:09:33,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856860307] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:33,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:33,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 14:09:33,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578262592] [2023-02-18 14:09:33,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:33,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 14:09:33,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:09:33,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 14:09:33,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 14:09:33,711 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:33,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:33,773 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2023-02-18 14:09:33,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 14:09:33,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-18 14:09:33,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:33,775 INFO L225 Difference]: With dead ends: 132 [2023-02-18 14:09:33,775 INFO L226 Difference]: Without dead ends: 112 [2023-02-18 14:09:33,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 14:09:33,776 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 131 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:33,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 116 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 14:09:33,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-18 14:09:33,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 72. [2023-02-18 14:09:33,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.265625) internal successors, (81), 71 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:33,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2023-02-18 14:09:33,784 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2023-02-18 14:09:33,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:33,784 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2023-02-18 14:09:33,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:33,785 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2023-02-18 14:09:33,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-18 14:09:33,785 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:33,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:33,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-18 14:09:33,786 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:33,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:33,786 INFO L85 PathProgramCache]: Analyzing trace with hash -940628212, now seen corresponding path program 1 times [2023-02-18 14:09:33,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:09:33,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349135941] [2023-02-18 14:09:33,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:33,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:09:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:33,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:09:33,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349135941] [2023-02-18 14:09:33,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349135941] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:33,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:33,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 14:09:33,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667869715] [2023-02-18 14:09:33,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:33,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 14:09:33,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:09:33,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 14:09:33,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 14:09:33,832 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:33,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:33,844 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2023-02-18 14:09:33,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 14:09:33,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-18 14:09:33,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:33,846 INFO L225 Difference]: With dead ends: 137 [2023-02-18 14:09:33,846 INFO L226 Difference]: Without dead ends: 96 [2023-02-18 14:09:33,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 14:09:33,847 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 24 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:33,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 149 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 14:09:33,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-18 14:09:33,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2023-02-18 14:09:33,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2023-02-18 14:09:33,866 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2023-02-18 14:09:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:33,866 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2023-02-18 14:09:33,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2023-02-18 14:09:33,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-18 14:09:33,867 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:33,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:33,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-18 14:09:33,868 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:33,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:33,869 INFO L85 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2023-02-18 14:09:33,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:09:33,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052952821] [2023-02-18 14:09:33,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:33,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:09:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:33,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:33,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:09:33,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052952821] [2023-02-18 14:09:33,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052952821] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:33,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:33,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 14:09:33,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765264275] [2023-02-18 14:09:33,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:33,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 14:09:33,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:09:33,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 14:09:33,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 14:09:33,936 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:33,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:33,954 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2023-02-18 14:09:33,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 14:09:33,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-18 14:09:33,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:33,957 INFO L225 Difference]: With dead ends: 75 [2023-02-18 14:09:33,957 INFO L226 Difference]: Without dead ends: 73 [2023-02-18 14:09:33,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 14:09:33,962 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 13 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:33,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 129 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 14:09:33,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-18 14:09:33,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-02-18 14:09:33,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:33,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2023-02-18 14:09:33,972 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 21 [2023-02-18 14:09:33,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:33,973 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2023-02-18 14:09:33,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:33,973 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2023-02-18 14:09:33,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-18 14:09:33,977 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:33,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:33,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-18 14:09:33,978 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:33,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:33,979 INFO L85 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2023-02-18 14:09:33,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:09:33,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999025553] [2023-02-18 14:09:33,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:33,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:09:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:34,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:09:34,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999025553] [2023-02-18 14:09:34,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999025553] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:34,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:34,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 14:09:34,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791460367] [2023-02-18 14:09:34,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:34,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 14:09:34,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:09:34,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 14:09:34,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 14:09:34,124 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:34,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:34,188 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2023-02-18 14:09:34,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 14:09:34,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-18 14:09:34,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:34,190 INFO L225 Difference]: With dead ends: 74 [2023-02-18 14:09:34,190 INFO L226 Difference]: Without dead ends: 72 [2023-02-18 14:09:34,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 14:09:34,192 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:34,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 14:09:34,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-18 14:09:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2023-02-18 14:09:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 70 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2023-02-18 14:09:34,201 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 23 [2023-02-18 14:09:34,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:34,202 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2023-02-18 14:09:34,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:34,202 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2023-02-18 14:09:34,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 14:09:34,204 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:34,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:34,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-18 14:09:34,205 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:34,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:34,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2023-02-18 14:09:34,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:09:34,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335083712] [2023-02-18 14:09:34,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:34,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:09:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:34,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:34,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:09:34,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335083712] [2023-02-18 14:09:34,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335083712] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:34,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:34,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 14:09:34,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833479609] [2023-02-18 14:09:34,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:34,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 14:09:34,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:09:34,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 14:09:34,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-18 14:09:34,324 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:34,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:34,472 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2023-02-18 14:09:34,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 14:09:34,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-18 14:09:34,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:34,474 INFO L225 Difference]: With dead ends: 175 [2023-02-18 14:09:34,474 INFO L226 Difference]: Without dead ends: 133 [2023-02-18 14:09:34,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-02-18 14:09:34,477 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 114 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:34,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 281 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 14:09:34,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-18 14:09:34,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 81. [2023-02-18 14:09:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:34,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2023-02-18 14:09:34,484 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 24 [2023-02-18 14:09:34,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:34,485 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2023-02-18 14:09:34,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2023-02-18 14:09:34,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 14:09:34,488 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:34,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:34,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-18 14:09:34,492 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:34,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:34,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2023-02-18 14:09:34,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:09:34,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811482595] [2023-02-18 14:09:34,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:34,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:09:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:36,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:36,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:09:36,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811482595] [2023-02-18 14:09:36,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811482595] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:36,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:36,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 14:09:36,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85124774] [2023-02-18 14:09:36,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:36,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 14:09:36,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:09:36,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 14:09:36,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-18 14:09:36,578 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:36,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:36,867 INFO L93 Difference]: Finished difference Result 234 states and 259 transitions. [2023-02-18 14:09:36,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 14:09:36,867 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-18 14:09:36,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:36,870 INFO L225 Difference]: With dead ends: 234 [2023-02-18 14:09:36,870 INFO L226 Difference]: Without dead ends: 232 [2023-02-18 14:09:36,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-02-18 14:09:36,871 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 258 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:36,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 420 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 14:09:36,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-02-18 14:09:36,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 93. [2023-02-18 14:09:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 92 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2023-02-18 14:09:36,885 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 24 [2023-02-18 14:09:36,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:36,885 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2023-02-18 14:09:36,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:36,885 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2023-02-18 14:09:36,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 14:09:36,886 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:36,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:36,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-18 14:09:36,886 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:36,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:36,887 INFO L85 PathProgramCache]: Analyzing trace with hash 680714775, now seen corresponding path program 1 times [2023-02-18 14:09:36,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:09:36,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242951837] [2023-02-18 14:09:36,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:36,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:09:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:36,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 14:09:36,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:09:36,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242951837] [2023-02-18 14:09:36,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242951837] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:36,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:36,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 14:09:36,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028266899] [2023-02-18 14:09:36,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:36,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 14:09:36,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:09:36,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 14:09:36,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-18 14:09:36,939 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:37,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:37,034 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2023-02-18 14:09:37,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 14:09:37,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-18 14:09:37,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:37,035 INFO L225 Difference]: With dead ends: 139 [2023-02-18 14:09:37,035 INFO L226 Difference]: Without dead ends: 121 [2023-02-18 14:09:37,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-18 14:09:37,036 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 44 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:37,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 186 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 14:09:37,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-18 14:09:37,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2023-02-18 14:09:37,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 112 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:37,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2023-02-18 14:09:37,053 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 26 [2023-02-18 14:09:37,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:37,053 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2023-02-18 14:09:37,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:37,053 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2023-02-18 14:09:37,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 14:09:37,054 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:37,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:37,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-18 14:09:37,054 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:37,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:37,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1502606953, now seen corresponding path program 1 times [2023-02-18 14:09:37,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:09:37,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839220120] [2023-02-18 14:09:37,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:37,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:09:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 14:09:37,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:09:37,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839220120] [2023-02-18 14:09:37,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839220120] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:37,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:37,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 14:09:37,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350150932] [2023-02-18 14:09:37,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:37,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 14:09:37,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:09:37,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 14:09:37,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 14:09:37,109 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:37,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:37,169 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2023-02-18 14:09:37,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 14:09:37,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-18 14:09:37,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:37,171 INFO L225 Difference]: With dead ends: 113 [2023-02-18 14:09:37,171 INFO L226 Difference]: Without dead ends: 111 [2023-02-18 14:09:37,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 14:09:37,172 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 49 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:37,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 76 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 14:09:37,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-18 14:09:37,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-02-18 14:09:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 110 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2023-02-18 14:09:37,188 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 26 [2023-02-18 14:09:37,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:37,189 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2023-02-18 14:09:37,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:37,189 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2023-02-18 14:09:37,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-18 14:09:37,191 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:37,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:37,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-18 14:09:37,191 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:37,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:37,192 INFO L85 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2023-02-18 14:09:37,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:09:37,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253927919] [2023-02-18 14:09:37,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:37,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:09:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:38,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:09:38,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253927919] [2023-02-18 14:09:38,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253927919] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:38,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:38,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 14:09:38,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388885529] [2023-02-18 14:09:38,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:38,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 14:09:38,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:09:38,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 14:09:38,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-18 14:09:38,923 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:39,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:39,218 INFO L93 Difference]: Finished difference Result 268 states and 308 transitions. [2023-02-18 14:09:39,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 14:09:39,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-18 14:09:39,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:39,220 INFO L225 Difference]: With dead ends: 268 [2023-02-18 14:09:39,220 INFO L226 Difference]: Without dead ends: 266 [2023-02-18 14:09:39,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-02-18 14:09:39,221 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 263 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:39,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 384 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 14:09:39,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-02-18 14:09:39,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 114. [2023-02-18 14:09:39,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.2293577981651376) internal successors, (134), 113 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:39,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2023-02-18 14:09:39,244 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 27 [2023-02-18 14:09:39,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:39,244 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2023-02-18 14:09:39,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2023-02-18 14:09:39,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 14:09:39,247 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:39,247 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:39,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-18 14:09:39,248 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:39,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:39,248 INFO L85 PathProgramCache]: Analyzing trace with hash -937634650, now seen corresponding path program 1 times [2023-02-18 14:09:39,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:09:39,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108305910] [2023-02-18 14:09:39,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:39,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:09:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:39,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:09:39,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108305910] [2023-02-18 14:09:39,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108305910] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 14:09:39,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611015890] [2023-02-18 14:09:39,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:39,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 14:09:39,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 14:09:39,356 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 14:09:39,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 14:09:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:39,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 14:09:39,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 14:09:39,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-18 14:09:39,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-18 14:09:39,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 14:09:39,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-18 14:09:39,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 14:09:39,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-18 14:09:39,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-18 14:09:39,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-18 14:09:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:39,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 14:09:39,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:39,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611015890] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 14:09:39,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 14:09:39,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-02-18 14:09:39,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513355397] [2023-02-18 14:09:39,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 14:09:39,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 14:09:39,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:09:39,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 14:09:39,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-18 14:09:39,624 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:39,777 INFO L93 Difference]: Finished difference Result 199 states and 229 transitions. [2023-02-18 14:09:39,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 14:09:39,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-18 14:09:39,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:39,779 INFO L225 Difference]: With dead ends: 199 [2023-02-18 14:09:39,779 INFO L226 Difference]: Without dead ends: 139 [2023-02-18 14:09:39,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-02-18 14:09:39,781 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 109 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:39,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 209 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 14:09:39,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-02-18 14:09:39,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 116. [2023-02-18 14:09:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.2072072072072073) internal successors, (134), 115 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2023-02-18 14:09:39,807 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 29 [2023-02-18 14:09:39,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:39,808 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2023-02-18 14:09:39,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:39,808 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2023-02-18 14:09:39,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 14:09:39,809 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:39,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:39,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 14:09:40,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-18 14:09:40,028 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:40,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:40,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2010394174, now seen corresponding path program 1 times [2023-02-18 14:09:40,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:09:40,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942379939] [2023-02-18 14:09:40,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:40,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:09:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:40,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:09:40,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942379939] [2023-02-18 14:09:40,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942379939] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:40,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:40,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 14:09:40,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050180331] [2023-02-18 14:09:40,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:40,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 14:09:40,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:09:40,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 14:09:40,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-18 14:09:40,202 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:40,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:40,427 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2023-02-18 14:09:40,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 14:09:40,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-18 14:09:40,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:40,428 INFO L225 Difference]: With dead ends: 159 [2023-02-18 14:09:40,429 INFO L226 Difference]: Without dead ends: 139 [2023-02-18 14:09:40,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-18 14:09:40,430 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 63 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:40,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 290 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 14:09:40,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-02-18 14:09:40,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 115. [2023-02-18 14:09:40,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.2) internal successors, (132), 114 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2023-02-18 14:09:40,457 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 29 [2023-02-18 14:09:40,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:40,457 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2023-02-18 14:09:40,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:40,457 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2023-02-18 14:09:40,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-18 14:09:40,458 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:40,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:40,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-18 14:09:40,458 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:40,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:40,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1521997910, now seen corresponding path program 1 times [2023-02-18 14:09:40,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:09:40,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925860800] [2023-02-18 14:09:40,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:40,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:09:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:40,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:09:40,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925860800] [2023-02-18 14:09:40,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925860800] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:40,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:40,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 14:09:40,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158214580] [2023-02-18 14:09:40,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:40,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 14:09:40,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:09:40,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 14:09:40,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 14:09:40,527 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:40,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:40,573 INFO L93 Difference]: Finished difference Result 220 states and 257 transitions. [2023-02-18 14:09:40,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 14:09:40,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-18 14:09:40,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:40,575 INFO L225 Difference]: With dead ends: 220 [2023-02-18 14:09:40,575 INFO L226 Difference]: Without dead ends: 165 [2023-02-18 14:09:40,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 14:09:40,577 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 26 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:40,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 164 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 14:09:40,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-18 14:09:40,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 138. [2023-02-18 14:09:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 133 states have (on average 1.2105263157894737) internal successors, (161), 137 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:40,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 161 transitions. [2023-02-18 14:09:40,609 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 161 transitions. Word has length 31 [2023-02-18 14:09:40,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:40,609 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 161 transitions. [2023-02-18 14:09:40,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:40,609 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 161 transitions. [2023-02-18 14:09:40,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-18 14:09:40,610 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:40,611 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:40,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-18 14:09:40,611 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:40,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:40,612 INFO L85 PathProgramCache]: Analyzing trace with hash 914215427, now seen corresponding path program 1 times [2023-02-18 14:09:40,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:09:40,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633771314] [2023-02-18 14:09:40,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:40,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:09:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:40,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:40,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:09:40,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633771314] [2023-02-18 14:09:40,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633771314] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 14:09:40,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66787260] [2023-02-18 14:09:40,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:40,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 14:09:40,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 14:09:40,698 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 14:09:40,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 14:09:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:40,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-18 14:09:40,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 14:09:40,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-18 14:09:40,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-18 14:09:40,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-18 14:09:40,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-18 14:09:40,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-18 14:09:40,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-18 14:09:40,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 14:09:40,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 14:09:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 14:09:40,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66787260] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 14:09:40,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 14:09:40,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2023-02-18 14:09:40,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416021392] [2023-02-18 14:09:40,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 14:09:40,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 14:09:40,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:09:40,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 14:09:40,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 14:09:40,926 INFO L87 Difference]: Start difference. First operand 138 states and 161 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:41,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:41,133 INFO L93 Difference]: Finished difference Result 247 states and 282 transitions. [2023-02-18 14:09:41,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 14:09:41,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-18 14:09:41,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:41,135 INFO L225 Difference]: With dead ends: 247 [2023-02-18 14:09:41,135 INFO L226 Difference]: Without dead ends: 216 [2023-02-18 14:09:41,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-18 14:09:41,135 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 95 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:41,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 286 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 14:09:41,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-02-18 14:09:41,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 165. [2023-02-18 14:09:41,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 160 states have (on average 1.2375) internal successors, (198), 164 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:41,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 198 transitions. [2023-02-18 14:09:41,172 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 198 transitions. Word has length 32 [2023-02-18 14:09:41,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:41,172 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 198 transitions. [2023-02-18 14:09:41,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:41,172 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 198 transitions. [2023-02-18 14:09:41,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-18 14:09:41,173 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:41,173 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:41,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 14:09:41,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-18 14:09:41,380 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:41,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:41,381 INFO L85 PathProgramCache]: Analyzing trace with hash 191981961, now seen corresponding path program 1 times [2023-02-18 14:09:41,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:09:41,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236728029] [2023-02-18 14:09:41,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:41,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:09:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:41,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:41,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:09:41,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236728029] [2023-02-18 14:09:41,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236728029] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:41,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:41,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 14:09:41,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490535524] [2023-02-18 14:09:41,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:41,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 14:09:41,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:09:41,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 14:09:41,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 14:09:41,468 INFO L87 Difference]: Start difference. First operand 165 states and 198 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:41,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:41,561 INFO L93 Difference]: Finished difference Result 231 states and 274 transitions. [2023-02-18 14:09:41,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 14:09:41,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-18 14:09:41,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:41,563 INFO L225 Difference]: With dead ends: 231 [2023-02-18 14:09:41,563 INFO L226 Difference]: Without dead ends: 117 [2023-02-18 14:09:41,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 14:09:41,564 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 24 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:41,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 188 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 14:09:41,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-18 14:09:41,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-02-18 14:09:41,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 113 states have (on average 1.1592920353982301) internal successors, (131), 116 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2023-02-18 14:09:41,590 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 35 [2023-02-18 14:09:41,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:41,590 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2023-02-18 14:09:41,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:41,591 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2023-02-18 14:09:41,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 14:09:41,591 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:41,591 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:41,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-18 14:09:41,592 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:41,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:41,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1562646056, now seen corresponding path program 1 times [2023-02-18 14:09:41,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:09:41,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012567519] [2023-02-18 14:09:41,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:41,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:09:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:41,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:41,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:09:41,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012567519] [2023-02-18 14:09:41,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012567519] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 14:09:41,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678648372] [2023-02-18 14:09:41,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:41,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 14:09:41,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 14:09:41,977 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 14:09:41,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 14:09:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:42,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-18 14:09:42,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 14:09:42,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 14:09:42,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-18 14:09:42,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-18 14:09:42,164 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:09:42,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-18 14:09:42,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 14:09:42,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-02-18 14:09:42,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 14:09:42,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-02-18 14:09:42,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-18 14:09:42,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-18 14:09:42,233 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:09:42,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 51 [2023-02-18 14:09:42,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-18 14:09:42,376 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:09:42,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 77 [2023-02-18 14:09:42,381 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:09:42,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 58 [2023-02-18 14:09:42,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-18 14:09:42,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:42,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 14:09:44,669 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 14:09:44,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:09:44,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2023-02-18 14:09:44,675 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 14:09:44,676 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:09:44,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 30 [2023-02-18 14:09:44,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-18 14:09:44,685 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 14:09:44,686 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:09:44,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2023-02-18 14:09:44,693 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 14:09:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:44,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678648372] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 14:09:44,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 14:09:44,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2023-02-18 14:09:44,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165600988] [2023-02-18 14:09:44,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 14:09:44,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-18 14:09:44,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 14:09:44,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-18 14:09:44,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=396, Unknown=13, NotChecked=0, Total=506 [2023-02-18 14:09:44,725 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 23 states, 23 states have (on average 4.0) internal successors, (92), 23 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:46,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:46,190 INFO L93 Difference]: Finished difference Result 318 states and 359 transitions. [2023-02-18 14:09:46,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 14:09:46,191 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.0) internal successors, (92), 23 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-18 14:09:46,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:46,192 INFO L225 Difference]: With dead ends: 318 [2023-02-18 14:09:46,192 INFO L226 Difference]: Without dead ends: 258 [2023-02-18 14:09:46,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=347, Invalid=969, Unknown=16, NotChecked=0, Total=1332 [2023-02-18 14:09:46,193 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 713 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:46,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 699 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-18 14:09:46,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-02-18 14:09:46,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 138. [2023-02-18 14:09:46,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 134 states have (on average 1.1567164179104477) internal successors, (155), 137 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 155 transitions. [2023-02-18 14:09:46,229 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 155 transitions. Word has length 36 [2023-02-18 14:09:46,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:46,229 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 155 transitions. [2023-02-18 14:09:46,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.0) internal successors, (92), 23 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:46,230 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2023-02-18 14:09:46,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 14:09:46,230 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:46,231 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:46,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 14:09:46,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 14:09:46,441 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:46,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:46,442 INFO L85 PathProgramCache]: Analyzing trace with hash 878042536, now seen corresponding path program 1 times [2023-02-18 14:09:46,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 14:09:46,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31936077] [2023-02-18 14:09:46,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:46,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 14:09:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:48,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:48,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 14:09:48,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31936077] [2023-02-18 14:09:48,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31936077] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 14:09:48,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005427584] [2023-02-18 14:09:48,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:48,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 14:09:48,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 14:09:48,608 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 14:09:48,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 14:09:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:48,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 82 conjunts are in the unsatisfiable core [2023-02-18 14:09:48,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 14:09:48,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 14:09:48,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 14:09:48,828 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:09:48,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 383 treesize of output 349 [2023-02-18 14:09:48,835 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:09:48,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 777 treesize of output 627 [2023-02-18 14:09:48,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 14:09:48,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 14:09:48,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:09:48,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 579 treesize of output 1192 [2023-02-18 14:09:48,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 14:09:48,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 14:09:48,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:09:48,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 875 treesize of output 1247 [2023-02-18 14:09:48,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 328 treesize of output 208 [2023-02-18 14:09:48,900 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 14:09:48,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 252 treesize of output 161 [2023-02-18 14:09:48,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-02-18 14:09:48,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-02-18 14:09:48,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-02-18 14:09:48,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:09:48,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2023-02-18 14:09:49,031 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:09:49,034 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:09:49,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-02-18 14:09:49,055 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:09:49,080 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:09:49,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 14:09:49,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 1 [2023-02-18 14:09:49,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 568 treesize of output 548 [2023-02-18 14:09:49,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 568 treesize of output 538 [2023-02-18 14:09:50,119 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:09:50,125 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2023-02-18 14:09:50,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-18 14:09:50,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 14:09:50,333 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) 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:122) 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:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) 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:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) 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:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) 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:337) 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:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2023-02-18 14:09:50,338 INFO L158 Benchmark]: Toolchain (without parser) took 19069.38ms. Allocated memory was 157.3MB in the beginning and 440.4MB in the end (delta: 283.1MB). Free memory was 120.5MB in the beginning and 363.9MB in the end (delta: -243.4MB). Peak memory consumption was 262.5MB. Max. memory is 16.1GB. [2023-02-18 14:09:50,339 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 115.3MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 14:09:50,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.61ms. Allocated memory is still 157.3MB. Free memory was 120.5MB in the beginning and 116.6MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-18 14:09:50,340 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.86ms. Allocated memory is still 157.3MB. Free memory was 116.6MB in the beginning and 114.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 14:09:50,341 INFO L158 Benchmark]: Boogie Preprocessor took 30.89ms. Allocated memory is still 157.3MB. Free memory was 114.5MB in the beginning and 112.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 14:09:50,341 INFO L158 Benchmark]: RCFGBuilder took 617.56ms. Allocated memory is still 157.3MB. Free memory was 112.4MB in the beginning and 90.5MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-02-18 14:09:50,341 INFO L158 Benchmark]: TraceAbstraction took 17890.02ms. Allocated memory was 157.3MB in the beginning and 440.4MB in the end (delta: 283.1MB). Free memory was 90.3MB in the beginning and 363.9MB in the end (delta: -273.5MB). Peak memory consumption was 234.6MB. Max. memory is 16.1GB. [2023-02-18 14:09:50,343 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 115.3MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.61ms. Allocated memory is still 157.3MB. Free memory was 120.5MB in the beginning and 116.6MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.86ms. Allocated memory is still 157.3MB. Free memory was 116.6MB in the beginning and 114.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.89ms. Allocated memory is still 157.3MB. Free memory was 114.5MB in the beginning and 112.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 617.56ms. Allocated memory is still 157.3MB. Free memory was 112.4MB in the beginning and 90.5MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 17890.02ms. Allocated memory was 157.3MB in the beginning and 440.4MB in the end (delta: 283.1MB). Free memory was 90.3MB in the beginning and 363.9MB in the end (delta: -273.5MB). Peak memory consumption was 234.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:333) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-02-18 14:09:50,374 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-1.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 ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 14:09:52,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 14:09:52,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 14:09:52,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 14:09:52,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 14:09:52,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 14:09:52,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 14:09:52,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 14:09:52,597 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 14:09:52,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 14:09:52,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 14:09:52,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 14:09:52,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 14:09:52,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 14:09:52,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 14:09:52,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 14:09:52,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 14:09:52,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 14:09:52,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 14:09:52,610 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 14:09:52,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 14:09:52,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 14:09:52,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 14:09:52,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 14:09:52,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 14:09:52,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 14:09:52,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 14:09:52,624 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 14:09:52,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 14:09:52,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 14:09:52,625 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 14:09:52,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 14:09:52,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 14:09:52,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 14:09:52,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 14:09:52,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 14:09:52,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 14:09:52,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 14:09:52,631 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 14:09:52,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 14:09:52,632 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 14:09:52,636 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-18 14:09:52,670 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 14:09:52,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 14:09:52,671 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 14:09:52,671 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 14:09:52,672 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 14:09:52,672 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 14:09:52,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 14:09:52,673 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 14:09:52,673 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 14:09:52,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 14:09:52,674 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 14:09:52,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 14:09:52,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 14:09:52,674 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 14:09:52,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 14:09:52,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 14:09:52,675 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 14:09:52,675 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-18 14:09:52,675 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-18 14:09:52,675 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 14:09:52,675 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 14:09:52,675 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 14:09:52,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 14:09:52,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 14:09:52,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 14:09:52,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 14:09:52,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 14:09:52,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 14:09:52,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 14:09:52,684 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 14:09:52,684 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-18 14:09:52,684 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-18 14:09:52,685 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 14:09:52,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 14:09:52,685 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 14:09:52,685 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 14:09:52,685 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-18 14:09:52,686 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 14:09:52,686 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d [2023-02-18 14:09:53,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 14:09:53,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 14:09:53,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 14:09:53,043 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 14:09:53,045 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 14:09:53,047 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-1.i [2023-02-18 14:09:54,357 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 14:09:54,642 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 14:09:54,643 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i [2023-02-18 14:09:54,656 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa6d4ce4e/dc51900fd700448c92e07ce98b71a444/FLAG5da8214da [2023-02-18 14:09:54,675 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa6d4ce4e/dc51900fd700448c92e07ce98b71a444 [2023-02-18 14:09:54,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 14:09:54,678 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 14:09:54,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 14:09:54,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 14:09:54,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 14:09:54,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 02:09:54" (1/1) ... [2023-02-18 14:09:54,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c7d3713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:54, skipping insertion in model container [2023-02-18 14:09:54,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 02:09:54" (1/1) ... [2023-02-18 14:09:54,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 14:09:54,737 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 14:09:55,008 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2023-02-18 14:09:55,022 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2023-02-18 14:09:55,024 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2023-02-18 14:09:55,026 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2023-02-18 14:09:55,031 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2023-02-18 14:09:55,033 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2023-02-18 14:09:55,035 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2023-02-18 14:09:55,035 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2023-02-18 14:09:55,036 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2023-02-18 14:09:55,037 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2023-02-18 14:09:55,038 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2023-02-18 14:09:55,039 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2023-02-18 14:09:55,040 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2023-02-18 14:09:55,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 14:09:55,061 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 14:09:55,087 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2023-02-18 14:09:55,089 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2023-02-18 14:09:55,091 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2023-02-18 14:09:55,091 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2023-02-18 14:09:55,093 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2023-02-18 14:09:55,094 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2023-02-18 14:09:55,095 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2023-02-18 14:09:55,096 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2023-02-18 14:09:55,106 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2023-02-18 14:09:55,107 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2023-02-18 14:09:55,109 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2023-02-18 14:09:55,109 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2023-02-18 14:09:55,110 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2023-02-18 14:09:55,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 14:09:55,143 INFO L208 MainTranslator]: Completed translation [2023-02-18 14:09:55,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:55 WrapperNode [2023-02-18 14:09:55,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 14:09:55,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 14:09:55,145 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 14:09:55,145 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 14:09:55,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:55" (1/1) ... [2023-02-18 14:09:55,164 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:55" (1/1) ... [2023-02-18 14:09:55,187 INFO L138 Inliner]: procedures = 120, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 219 [2023-02-18 14:09:55,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 14:09:55,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 14:09:55,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 14:09:55,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 14:09:55,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:55" (1/1) ... [2023-02-18 14:09:55,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:55" (1/1) ... [2023-02-18 14:09:55,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:55" (1/1) ... [2023-02-18 14:09:55,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:55" (1/1) ... [2023-02-18 14:09:55,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:55" (1/1) ... [2023-02-18 14:09:55,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:55" (1/1) ... [2023-02-18 14:09:55,219 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:55" (1/1) ... [2023-02-18 14:09:55,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:55" (1/1) ... [2023-02-18 14:09:55,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 14:09:55,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 14:09:55,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 14:09:55,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 14:09:55,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:55" (1/1) ... [2023-02-18 14:09:55,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 14:09:55,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 14:09:55,252 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 14:09:55,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 14:09:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-18 14:09:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 14:09:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-18 14:09:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-18 14:09:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-18 14:09:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-18 14:09:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 14:09:55,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 14:09:55,392 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 14:09:55,395 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 14:09:56,156 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 14:09:56,162 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 14:09:56,162 INFO L300 CfgBuilder]: Removed 30 assume(true) statements. [2023-02-18 14:09:56,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 02:09:56 BoogieIcfgContainer [2023-02-18 14:09:56,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 14:09:56,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 14:09:56,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 14:09:56,168 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 14:09:56,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 02:09:54" (1/3) ... [2023-02-18 14:09:56,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3339ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 02:09:56, skipping insertion in model container [2023-02-18 14:09:56,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:09:55" (2/3) ... [2023-02-18 14:09:56,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3339ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 02:09:56, skipping insertion in model container [2023-02-18 14:09:56,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 02:09:56" (3/3) ... [2023-02-18 14:09:56,171 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2023-02-18 14:09:56,184 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 14:09:56,185 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2023-02-18 14:09:56,234 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 14:09:56,240 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3ae906c5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 14:09:56,241 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-02-18 14:09:56,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 66 states have (on average 2.0) internal successors, (132), 79 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:56,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-18 14:09:56,250 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:56,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-18 14:09:56,251 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:56,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:56,256 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2023-02-18 14:09:56,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 14:09:56,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274578483] [2023-02-18 14:09:56,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:56,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:09:56,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 14:09:56,269 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 14:09:56,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-18 14:09:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:56,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 14:09:56,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 14:09:56,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:56,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 14:09:56,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 14:09:56,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274578483] [2023-02-18 14:09:56,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274578483] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:56,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:56,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 14:09:56,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120211739] [2023-02-18 14:09:56,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:56,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 14:09:56,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 14:09:56,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 14:09:56,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 14:09:56,548 INFO L87 Difference]: Start difference. First operand has 80 states, 66 states have (on average 2.0) internal successors, (132), 79 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:56,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:56,649 INFO L93 Difference]: Finished difference Result 174 states and 290 transitions. [2023-02-18 14:09:56,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 14:09:56,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-18 14:09:56,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:56,665 INFO L225 Difference]: With dead ends: 174 [2023-02-18 14:09:56,665 INFO L226 Difference]: Without dead ends: 92 [2023-02-18 14:09:56,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 14:09:56,671 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 80 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 99 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.1s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:56,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 99 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 14:09:56,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-18 14:09:56,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2023-02-18 14:09:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 73 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2023-02-18 14:09:56,703 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 4 [2023-02-18 14:09:56,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:56,703 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2023-02-18 14:09:56,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2023-02-18 14:09:56,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 14:09:56,704 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:56,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:56,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-18 14:09:56,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:09:56,914 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:56,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:56,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1534452756, now seen corresponding path program 1 times [2023-02-18 14:09:56,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 14:09:56,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454411697] [2023-02-18 14:09:56,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:56,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:09:56,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 14:09:56,917 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 14:09:56,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-18 14:09:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:56,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 14:09:56,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 14:09:57,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-18 14:09:57,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-18 14:09:57,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 37 [2023-02-18 14:09:57,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2023-02-18 14:09:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:57,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 14:09:57,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 14:09:57,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454411697] [2023-02-18 14:09:57,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454411697] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:57,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:57,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 14:09:57,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458141902] [2023-02-18 14:09:57,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:57,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 14:09:57,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 14:09:57,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 14:09:57,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 14:09:57,042 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:57,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:57,654 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2023-02-18 14:09:57,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 14:09:57,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 14:09:57,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:57,656 INFO L225 Difference]: With dead ends: 195 [2023-02-18 14:09:57,657 INFO L226 Difference]: Without dead ends: 128 [2023-02-18 14:09:57,657 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 [2023-02-18 14:09:57,658 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 57 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:57,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 195 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 14:09:57,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-18 14:09:57,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 76. [2023-02-18 14:09:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.328125) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:57,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2023-02-18 14:09:57,674 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 9 [2023-02-18 14:09:57,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:57,674 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2023-02-18 14:09:57,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:57,674 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2023-02-18 14:09:57,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 14:09:57,675 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:57,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:57,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-18 14:09:57,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:09:57,876 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:57,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:57,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1534454678, now seen corresponding path program 1 times [2023-02-18 14:09:57,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 14:09:57,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532851931] [2023-02-18 14:09:57,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:57,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:09:57,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 14:09:57,881 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 14:09:57,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-18 14:09:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:57,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 14:09:57,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 14:09:57,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-18 14:09:57,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-18 14:09:57,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 37 [2023-02-18 14:09:58,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2023-02-18 14:09:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:58,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 14:09:58,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 14:09:58,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532851931] [2023-02-18 14:09:58,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532851931] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:58,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:58,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 14:09:58,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51100964] [2023-02-18 14:09:58,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:58,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 14:09:58,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 14:09:58,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 14:09:58,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 14:09:58,017 INFO L87 Difference]: Start difference. First operand 76 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) [2023-02-18 14:09:58,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:58,475 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2023-02-18 14:09:58,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 14:09:58,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 14:09:58,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:58,477 INFO L225 Difference]: With dead ends: 129 [2023-02-18 14:09:58,477 INFO L226 Difference]: Without dead ends: 127 [2023-02-18 14:09:58,477 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 [2023-02-18 14:09:58,478 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 54 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:58,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 193 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 14:09:58,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-18 14:09:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 77. [2023-02-18 14:09:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.323076923076923) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:58,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2023-02-18 14:09:58,490 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 9 [2023-02-18 14:09:58,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:58,490 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2023-02-18 14:09:58,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:58,491 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2023-02-18 14:09:58,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 14:09:58,491 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:58,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:58,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-18 14:09:58,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:09:58,702 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)] === [2023-02-18 14:09:58,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:58,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1536301720, now seen corresponding path program 1 times [2023-02-18 14:09:58,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 14:09:58,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418955008] [2023-02-18 14:09:58,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:58,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:09:58,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 14:09:58,705 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 14:09:58,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-18 14:09:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:58,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 14:09:58,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 14:09:58,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 37 [2023-02-18 14:09:58,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2023-02-18 14:09:58,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:58,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 14:09:58,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 14:09:58,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418955008] [2023-02-18 14:09:58,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418955008] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:58,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:58,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 14:09:58,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674287062] [2023-02-18 14:09:58,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:58,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 14:09:58,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 14:09:58,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 14:09:58,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 14:09:58,868 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:59,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:59,160 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2023-02-18 14:09:59,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 14:09:59,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 14:09:59,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:59,165 INFO L225 Difference]: With dead ends: 78 [2023-02-18 14:09:59,165 INFO L226 Difference]: Without dead ends: 76 [2023-02-18 14:09:59,166 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 [2023-02-18 14:09:59,166 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 14:09:59,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 211 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 14:09:59,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-18 14:09:59,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2023-02-18 14:09:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 73 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:59,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2023-02-18 14:09:59,179 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 9 [2023-02-18 14:09:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:59,179 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2023-02-18 14:09:59,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2023-02-18 14:09:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-18 14:09:59,180 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:59,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:59,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-18 14:09:59,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:09:59,392 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)] === [2023-02-18 14:09:59,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:59,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1743237117, now seen corresponding path program 1 times [2023-02-18 14:09:59,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 14:09:59,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758657767] [2023-02-18 14:09:59,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:59,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:09:59,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 14:09:59,395 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 14:09:59,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-18 14:09:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:59,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 14:09:59,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 14:09:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:59,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 14:09:59,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 14:09:59,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758657767] [2023-02-18 14:09:59,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758657767] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:59,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:59,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 14:09:59,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244025708] [2023-02-18 14:09:59,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:59,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 14:09:59,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 14:09:59,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 14:09:59,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 14:09:59,476 INFO L87 Difference]: Start difference. First operand 74 states and 83 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) [2023-02-18 14:09:59,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:09:59,605 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2023-02-18 14:09:59,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 14:09:59,605 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 [2023-02-18 14:09:59,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:09:59,606 INFO L225 Difference]: With dead ends: 76 [2023-02-18 14:09:59,606 INFO L226 Difference]: Without dead ends: 72 [2023-02-18 14:09:59,606 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 [2023-02-18 14:09:59,607 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 14 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 119 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 [2023-02-18 14:09:59,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 119 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 14:09:59,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-18 14:09:59,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2023-02-18 14:09:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 69 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:09:59,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2023-02-18 14:09:59,614 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 13 [2023-02-18 14:09:59,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:09:59,615 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2023-02-18 14:09:59,615 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) [2023-02-18 14:09:59,615 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2023-02-18 14:09:59,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 14:09:59,615 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:09:59,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:09:59,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-18 14:09:59,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:09:59,832 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:09:59,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:09:59,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1794227426, now seen corresponding path program 1 times [2023-02-18 14:09:59,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 14:09:59,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369340504] [2023-02-18 14:09:59,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:09:59,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:09:59,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 14:09:59,834 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 14:09:59,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-18 14:09:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:09:59,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 14:09:59,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 14:09:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:09:59,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 14:09:59,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 14:09:59,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369340504] [2023-02-18 14:09:59,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369340504] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:09:59,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:09:59,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 14:09:59,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663642813] [2023-02-18 14:09:59,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:09:59,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 14:09:59,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 14:09:59,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 14:09:59,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 14:09:59,954 INFO L87 Difference]: Start difference. First operand 70 states and 79 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) [2023-02-18 14:10:00,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:10:00,243 INFO L93 Difference]: Finished difference Result 129 states and 143 transitions. [2023-02-18 14:10:00,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 14:10:00,244 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 [2023-02-18 14:10:00,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:10:00,245 INFO L225 Difference]: With dead ends: 129 [2023-02-18 14:10:00,245 INFO L226 Difference]: Without dead ends: 109 [2023-02-18 14:10:00,245 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 [2023-02-18 14:10:00,246 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 128 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 14:10:00,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 112 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 14:10:00,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-18 14:10:00,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 69. [2023-02-18 14:10:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.278688524590164) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:10:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2023-02-18 14:10:00,257 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 14 [2023-02-18 14:10:00,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:10:00,258 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2023-02-18 14:10:00,258 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) [2023-02-18 14:10:00,258 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2023-02-18 14:10:00,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-18 14:10:00,258 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:10:00,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:10:00,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-18 14:10:00,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:10:00,470 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:10:00,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:10:00,471 INFO L85 PathProgramCache]: Analyzing trace with hash -140282483, now seen corresponding path program 1 times [2023-02-18 14:10:00,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 14:10:00,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1185673747] [2023-02-18 14:10:00,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:10:00,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:10:00,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 14:10:00,473 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 14:10:00,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-18 14:10:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:10:00,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 14:10:00,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 14:10:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:10:00,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 14:10:00,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 14:10:00,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1185673747] [2023-02-18 14:10:00,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1185673747] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:10:00,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:10:00,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 14:10:00,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858367474] [2023-02-18 14:10:00,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:10:00,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 14:10:00,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 14:10:00,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 14:10:00,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 14:10:00,550 INFO L87 Difference]: Start difference. First operand 69 states and 78 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) [2023-02-18 14:10:00,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:10:00,572 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2023-02-18 14:10:00,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 14:10:00,573 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 [2023-02-18 14:10:00,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:10:00,573 INFO L225 Difference]: With dead ends: 134 [2023-02-18 14:10:00,573 INFO L226 Difference]: Without dead ends: 93 [2023-02-18 14:10:00,574 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 [2023-02-18 14:10:00,575 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 24 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 14:10:00,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 143 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 14:10:00,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-18 14:10:00,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2023-02-18 14:10:00,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.28125) 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) [2023-02-18 14:10:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2023-02-18 14:10:00,593 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 18 [2023-02-18 14:10:00,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:10:00,594 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2023-02-18 14:10:00,594 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) [2023-02-18 14:10:00,594 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2023-02-18 14:10:00,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 14:10:00,595 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:10:00,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:10:00,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-18 14:10:00,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:10:00,806 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-18 14:10:00,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:10:00,806 INFO L85 PathProgramCache]: Analyzing trace with hash -53794182, now seen corresponding path program 1 times [2023-02-18 14:10:00,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 14:10:00,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295567308] [2023-02-18 14:10:00,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:10:00,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:10:00,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 14:10:00,808 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 14:10:00,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-18 14:10:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:10:00,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 14:10:00,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 14:10:00,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-18 14:10:00,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-18 14:10:00,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-18 14:10:00,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-18 14:10:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:10:00,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 14:10:00,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 14:10:00,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295567308] [2023-02-18 14:10:00,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295567308] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:10:00,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:10:00,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 14:10:00,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799281012] [2023-02-18 14:10:00,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:10:00,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 14:10:00,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 14:10:00,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 14:10:00,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 14:10:00,930 INFO L87 Difference]: Start difference. First operand 72 states and 82 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) [2023-02-18 14:10:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:10:01,650 INFO L93 Difference]: Finished difference Result 180 states and 204 transitions. [2023-02-18 14:10:01,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 14:10:01,651 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 [2023-02-18 14:10:01,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:10:01,652 INFO L225 Difference]: With dead ends: 180 [2023-02-18 14:10:01,652 INFO L226 Difference]: Without dead ends: 136 [2023-02-18 14:10:01,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-18 14:10:01,653 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 115 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-18 14:10:01,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 239 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-18 14:10:01,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-18 14:10:01,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 81. [2023-02-18 14:10:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:10:01,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2023-02-18 14:10:01,663 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 19 [2023-02-18 14:10:01,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:10:01,663 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2023-02-18 14:10:01,663 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) [2023-02-18 14:10:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2023-02-18 14:10:01,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 14:10:01,664 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:10:01,664 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:10:01,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-18 14:10:01,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:10:01,875 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)] === [2023-02-18 14:10:01,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:10:01,876 INFO L85 PathProgramCache]: Analyzing trace with hash -746851846, now seen corresponding path program 1 times [2023-02-18 14:10:01,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 14:10:01,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037879736] [2023-02-18 14:10:01,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:10:01,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:10:01,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 14:10:01,878 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 14:10:01,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-18 14:10:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:10:01,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 14:10:01,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 14:10:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:10:02,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 14:10:02,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 14:10:02,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037879736] [2023-02-18 14:10:02,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037879736] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:10:02,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:10:02,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 14:10:02,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262304949] [2023-02-18 14:10:02,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:10:02,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 14:10:02,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 14:10:02,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 14:10:02,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 14:10:02,002 INFO L87 Difference]: Start difference. First operand 81 states and 92 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) [2023-02-18 14:10:02,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:10:02,027 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2023-02-18 14:10:02,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 14:10:02,027 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 [2023-02-18 14:10:02,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:10:02,028 INFO L225 Difference]: With dead ends: 81 [2023-02-18 14:10:02,028 INFO L226 Difference]: Without dead ends: 79 [2023-02-18 14:10:02,029 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 [2023-02-18 14:10:02,029 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 13 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 14:10:02,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 123 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 14:10:02,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-18 14:10:02,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-02-18 14:10:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.25) internal successors, (90), 78 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:10:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2023-02-18 14:10:02,038 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 19 [2023-02-18 14:10:02,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:10:02,038 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2023-02-18 14:10:02,038 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) [2023-02-18 14:10:02,038 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2023-02-18 14:10:02,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-18 14:10:02,039 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:10:02,039 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:10:02,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-18 14:10:02,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:10:02,251 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)] === [2023-02-18 14:10:02,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:10:02,251 INFO L85 PathProgramCache]: Analyzing trace with hash -169331172, now seen corresponding path program 1 times [2023-02-18 14:10:02,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 14:10:02,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368361076] [2023-02-18 14:10:02,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:10:02,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:10:02,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 14:10:02,253 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 14:10:02,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-18 14:10:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:10:02,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 14:10:02,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 14:10:02,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-18 14:10:02,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-18 14:10:02,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 37 [2023-02-18 14:10:02,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2023-02-18 14:10:02,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:10:02,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 14:10:02,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 14:10:02,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368361076] [2023-02-18 14:10:02,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368361076] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:10:02,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:10:02,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 14:10:02,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084897223] [2023-02-18 14:10:02,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:10:02,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 14:10:02,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 14:10:02,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 14:10:02,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 14:10:02,366 INFO L87 Difference]: Start difference. First operand 79 states and 90 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) [2023-02-18 14:10:02,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:10:02,711 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2023-02-18 14:10:02,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 14:10:02,711 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 [2023-02-18 14:10:02,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:10:02,712 INFO L225 Difference]: With dead ends: 145 [2023-02-18 14:10:02,712 INFO L226 Difference]: Without dead ends: 87 [2023-02-18 14:10:02,712 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 [2023-02-18 14:10:02,713 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 7 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 14:10:02,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 185 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 14:10:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-18 14:10:02,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2023-02-18 14:10:02,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:10:02,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2023-02-18 14:10:02,721 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 20 [2023-02-18 14:10:02,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:10:02,721 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2023-02-18 14:10:02,721 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) [2023-02-18 14:10:02,722 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2023-02-18 14:10:02,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-18 14:10:02,722 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:10:02,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:10:02,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-18 14:10:02,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:10:02,923 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)] === [2023-02-18 14:10:02,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:10:02,924 INFO L85 PathProgramCache]: Analyzing trace with hash -169329250, now seen corresponding path program 1 times [2023-02-18 14:10:02,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 14:10:02,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002021196] [2023-02-18 14:10:02,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:10:02,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:10:02,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 14:10:02,928 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 14:10:02,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-18 14:10:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:10:03,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 14:10:03,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 14:10:03,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-18 14:10:03,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-18 14:10:03,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 37 [2023-02-18 14:10:03,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2023-02-18 14:10:03,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:10:03,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 14:10:03,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 14:10:03,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002021196] [2023-02-18 14:10:03,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002021196] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:10:03,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:10:03,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 14:10:03,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839324645] [2023-02-18 14:10:03,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:10:03,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 14:10:03,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 14:10:03,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 14:10:03,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 14:10:03,055 INFO L87 Difference]: Start difference. First operand 81 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) [2023-02-18 14:10:03,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:10:03,523 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2023-02-18 14:10:03,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 14:10:03,523 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 [2023-02-18 14:10:03,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:10:03,524 INFO L225 Difference]: With dead ends: 88 [2023-02-18 14:10:03,524 INFO L226 Difference]: Without dead ends: 86 [2023-02-18 14:10:03,524 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 [2023-02-18 14:10:03,524 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 4 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 183 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.5s IncrementalHoareTripleChecker+Time [2023-02-18 14:10:03,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 183 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 14:10:03,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-18 14:10:03,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2023-02-18 14:10:03,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 75 states have (on average 1.24) internal successors, (93), 81 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:10:03,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2023-02-18 14:10:03,532 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 20 [2023-02-18 14:10:03,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:10:03,532 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2023-02-18 14:10:03,532 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) [2023-02-18 14:10:03,532 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2023-02-18 14:10:03,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-18 14:10:03,533 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:10:03,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 14:10:03,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-18 14:10:03,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:10:03,744 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)] === [2023-02-18 14:10:03,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:10:03,745 INFO L85 PathProgramCache]: Analyzing trace with hash -167482208, now seen corresponding path program 1 times [2023-02-18 14:10:03,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 14:10:03,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659111350] [2023-02-18 14:10:03,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:10:03,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:10:03,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 14:10:03,747 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 14:10:03,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-18 14:10:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:10:03,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 14:10:03,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 14:10:03,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 37 [2023-02-18 14:10:03,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2023-02-18 14:10:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 14:10:03,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 14:10:03,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 14:10:03,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659111350] [2023-02-18 14:10:03,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659111350] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 14:10:03,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 14:10:03,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 14:10:03,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82161795] [2023-02-18 14:10:03,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 14:10:03,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 14:10:03,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 14:10:03,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 14:10:03,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 14:10:03,913 INFO L87 Difference]: Start difference. First operand 82 states and 93 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) [2023-02-18 14:10:04,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 14:10:04,225 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2023-02-18 14:10:04,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 14:10:04,225 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 [2023-02-18 14:10:04,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 14:10:04,226 INFO L225 Difference]: With dead ends: 83 [2023-02-18 14:10:04,226 INFO L226 Difference]: Without dead ends: 81 [2023-02-18 14:10:04,226 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 [2023-02-18 14:10:04,227 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 14:10:04,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 173 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 14:10:04,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-18 14:10:04,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2023-02-18 14:10:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 78 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 14:10:04,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2023-02-18 14:10:04,233 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 20 [2023-02-18 14:10:04,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 14:10:04,233 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2023-02-18 14:10:04,233 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) [2023-02-18 14:10:04,240 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2023-02-18 14:10:04,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-18 14:10:04,240 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 14:10:04,241 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] [2023-02-18 14:10:04,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-18 14:10:04,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:10:04,449 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)] === [2023-02-18 14:10:04,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 14:10:04,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1528659518, now seen corresponding path program 1 times [2023-02-18 14:10:04,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 14:10:04,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879177112] [2023-02-18 14:10:04,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 14:10:04,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:10:04,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 14:10:04,477 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 14:10:04,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-18 14:10:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 14:10:04,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 70 conjunts are in the unsatisfiable core [2023-02-18 14:10:04,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 14:10:04,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 14:10:04,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 14:10:04,724 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:10:04,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 348 treesize of output 364 [2023-02-18 14:10:04,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 14:10:04,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:10:04,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 243 treesize of output 259 [2023-02-18 14:10:04,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 14:10:04,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:10:04,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 149 treesize of output 304 [2023-02-18 14:10:04,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 153 [2023-02-18 14:10:04,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 14:10:04,893 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:10:04,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 149 treesize of output 304 [2023-02-18 14:10:04,965 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:10:04,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 251 treesize of output 194 [2023-02-18 14:10:05,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-02-18 14:10:05,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-02-18 14:10:05,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:10:05,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-18 14:10:05,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-02-18 14:10:05,236 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:10:05,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 14:10:05,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2023-02-18 14:10:05,307 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:10:05,312 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:10:05,341 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:10:05,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 14:10:05,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2023-02-18 14:10:05,411 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:10:05,594 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:10:05,715 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:10:05,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 48 treesize of output 103 [2023-02-18 14:10:05,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 72 [2023-02-18 14:10:05,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 14:10:05,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 310 treesize of output 326 [2023-02-18 14:10:06,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1192 treesize of output 1170 [2023-02-18 14:10:06,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 1192 treesize of output 1160 [2023-02-18 14:10:06,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 34 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 35 new quantified variables, introduced 0 case distinctions, treesize of input 2684 treesize of output 7238 [2023-02-18 14:10:15,217 WARN L193 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:10:15,285 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:10:17,598 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 14:11:13,084 INFO L217 Elim1Store]: Index analysis took 57673 ms [2023-02-18 14:11:15,025 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 14:11:15,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 33 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 287 treesize of output 3501 [2023-02-18 14:11:15,479 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:11:15,488 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:11:15,506 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:11:15,509 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 14:11:16,023 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 14:11:19,809 INFO L217 Elim1Store]: Index analysis took 4215 ms [2023-02-18 14:11:20,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 42 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 19 new quantified variables, introduced 0 case distinctions, treesize of input 3732 treesize of output 10653 [2023-02-18 14:12:24,138 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 14:12:26,249 INFO L217 Elim1Store]: Index analysis took 65390 ms [2023-02-18 14:12:31,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 41 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 637 treesize of output 6708 [2023-02-18 14:13:02,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 14:13:02,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879177112] [2023-02-18 14:13:02,629 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2023-02-18 14:13:02,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-18 14:13:02,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 14:13:02,841 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Probably an infinite loop! at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtils.preprocessDualFiniteJunction(QuantifierPushUtils.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:323) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) 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:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) 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:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) 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:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) 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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) 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:337) 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:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2023-02-18 14:13:02,845 INFO L158 Benchmark]: Toolchain (without parser) took 188167.44ms. Allocated memory was 88.1MB in the beginning and 427.8MB in the end (delta: 339.7MB). Free memory was 63.5MB in the beginning and 315.5MB in the end (delta: -252.0MB). Peak memory consumption was 221.9MB. Max. memory is 16.1GB. [2023-02-18 14:13:02,846 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 71.3MB. Free memory is still 49.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 14:13:02,846 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.05ms. Allocated memory is still 88.1MB. Free memory was 63.3MB in the beginning and 63.0MB in the end (delta: 275.9kB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2023-02-18 14:13:02,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.32ms. Allocated memory is still 88.1MB. Free memory was 63.0MB in the beginning and 60.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 14:13:02,846 INFO L158 Benchmark]: Boogie Preprocessor took 36.71ms. Allocated memory is still 88.1MB. Free memory was 60.6MB in the beginning and 58.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-18 14:13:02,846 INFO L158 Benchmark]: RCFGBuilder took 938.75ms. Allocated memory is still 88.1MB. Free memory was 58.2MB in the beginning and 58.8MB in the end (delta: -641.8kB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2023-02-18 14:13:02,846 INFO L158 Benchmark]: TraceAbstraction took 186679.63ms. Allocated memory was 88.1MB in the beginning and 427.8MB in the end (delta: 339.7MB). Free memory was 58.3MB in the beginning and 315.5MB in the end (delta: -257.3MB). Peak memory consumption was 213.3MB. Max. memory is 16.1GB. [2023-02-18 14:13:02,847 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.23ms. Allocated memory is still 71.3MB. Free memory is still 49.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 463.05ms. Allocated memory is still 88.1MB. Free memory was 63.3MB in the beginning and 63.0MB in the end (delta: 275.9kB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.32ms. Allocated memory is still 88.1MB. Free memory was 63.0MB in the beginning and 60.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.71ms. Allocated memory is still 88.1MB. Free memory was 60.6MB in the beginning and 58.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 938.75ms. Allocated memory is still 88.1MB. Free memory was 58.2MB in the beginning and 58.8MB in the end (delta: -641.8kB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * TraceAbstraction took 186679.63ms. Allocated memory was 88.1MB in the beginning and 427.8MB in the end (delta: 339.7MB). Free memory was 58.3MB in the beginning and 315.5MB in the end (delta: -257.3MB). Peak memory consumption was 213.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Probably an infinite loop! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Probably an infinite loop!: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtils.preprocessDualFiniteJunction(QuantifierPushUtils.java:124) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-02-18 14:13:02,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Probably an infinite loop!