./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-queue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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/dll-queue-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 338b6951ab628b0237aa41c64d1786e44f90130a76a8fd0978f750b3fe39d026 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:37:54,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:37:54,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:37:54,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:37:54,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:37:54,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:37:54,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:37:54,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:37:54,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:37:54,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:37:54,696 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:37:54,697 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:37:54,697 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:37:54,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:37:54,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:37:54,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:37:54,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:37:54,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:37:54,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:37:54,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:37:54,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:37:54,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:37:54,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:37:54,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:37:54,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:37:54,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:37:54,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:37:54,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:37:54,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:37:54,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:37:54,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:37:54,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:37:54,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:37:54,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:37:54,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:37:54,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:37:54,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:37:54,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:37:54,733 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:37:54,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:37:54,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:37:54,735 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 13:37:54,761 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:37:54,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:37:54,765 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:37:54,765 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:37:54,765 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:37:54,766 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:37:54,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:37:54,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:37:54,770 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:37:54,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:37:54,771 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:37:54,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 13:37:54,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:37:54,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:37:54,771 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:37:54,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:37:54,772 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:37:54,772 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:37:54,772 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:37:54,772 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:37:54,772 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:37:54,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:37:54,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:37:54,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:37:54,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:37:54,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:37:54,773 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:37:54,774 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:37:54,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 13:37:54,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 13:37:54,774 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:37:54,774 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:37:54,775 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:37:54,775 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:37:54,775 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 338b6951ab628b0237aa41c64d1786e44f90130a76a8fd0978f750b3fe39d026 [2021-12-14 13:37:54,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:37:54,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:37:54,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:37:54,962 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:37:54,963 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:37:54,964 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-queue-2.i [2021-12-14 13:37:55,013 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842d965d3/d01e022a045749a095fdf63c093ad16e/FLAG84d456564 [2021-12-14 13:37:55,505 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:37:55,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i [2021-12-14 13:37:55,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842d965d3/d01e022a045749a095fdf63c093ad16e/FLAG84d456564 [2021-12-14 13:37:56,011 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842d965d3/d01e022a045749a095fdf63c093ad16e [2021-12-14 13:37:56,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:37:56,014 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:37:56,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:37:56,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:37:56,017 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:37:56,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:37:56" (1/1) ... [2021-12-14 13:37:56,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c24d8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:37:56, skipping insertion in model container [2021-12-14 13:37:56,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:37:56" (1/1) ... [2021-12-14 13:37:56,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:37:56,080 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:37:56,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22460,22473] [2021-12-14 13:37:56,456 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22531,22544] [2021-12-14 13:37:56,457 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22605,22618] [2021-12-14 13:37:56,457 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22697,22710] [2021-12-14 13:37:56,458 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22774,22787] [2021-12-14 13:37:56,458 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22869,22882] [2021-12-14 13:37:56,459 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22946,22959] [2021-12-14 13:37:56,459 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23029,23042] [2021-12-14 13:37:56,460 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23124,23137] [2021-12-14 13:37:56,460 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23201,23214] [2021-12-14 13:37:56,461 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23284,23297] [2021-12-14 13:37:56,461 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23373,23386] [2021-12-14 13:37:56,462 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23459,23472] [2021-12-14 13:37:56,463 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23604,23617] [2021-12-14 13:37:56,465 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:37:56,503 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:37:56,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22460,22473] [2021-12-14 13:37:56,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22531,22544] [2021-12-14 13:37:56,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22605,22618] [2021-12-14 13:37:56,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22697,22710] [2021-12-14 13:37:56,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22774,22787] [2021-12-14 13:37:56,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22869,22882] [2021-12-14 13:37:56,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22946,22959] [2021-12-14 13:37:56,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23029,23042] [2021-12-14 13:37:56,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23124,23137] [2021-12-14 13:37:56,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23201,23214] [2021-12-14 13:37:56,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23284,23297] [2021-12-14 13:37:56,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23373,23386] [2021-12-14 13:37:56,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23459,23472] [2021-12-14 13:37:56,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23604,23617] [2021-12-14 13:37:56,585 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:37:56,622 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:37:56,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:37:56 WrapperNode [2021-12-14 13:37:56,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:37:56,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:37:56,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:37:56,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:37:56,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:37:56" (1/1) ... [2021-12-14 13:37:56,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:37:56" (1/1) ... [2021-12-14 13:37:56,696 INFO L137 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 223 [2021-12-14 13:37:56,696 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:37:56,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:37:56,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:37:56,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:37:56,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:37:56" (1/1) ... [2021-12-14 13:37:56,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:37:56" (1/1) ... [2021-12-14 13:37:56,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:37:56" (1/1) ... [2021-12-14 13:37:56,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:37:56" (1/1) ... [2021-12-14 13:37:56,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:37:56" (1/1) ... [2021-12-14 13:37:56,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:37:56" (1/1) ... [2021-12-14 13:37:56,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:37:56" (1/1) ... [2021-12-14 13:37:56,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:37:56,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:37:56,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:37:56,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:37:56,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:37:56" (1/1) ... [2021-12-14 13:37:56,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:37:56,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:37:56,838 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 13:37:56,856 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 [2021-12-14 13:37:56,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 13:37:56,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 13:37:56,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 13:37:56,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:37:56,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 13:37:56,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 13:37:56,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 13:37:56,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 13:37:56,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:37:56,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:37:56,931 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:37:56,932 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:37:57,125 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:37:57,129 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:37:57,130 INFO L301 CfgBuilder]: Removed 31 assume(true) statements. [2021-12-14 13:37:57,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:37:57 BoogieIcfgContainer [2021-12-14 13:37:57,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:37:57,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:37:57,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:37:57,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:37:57,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:37:56" (1/3) ... [2021-12-14 13:37:57,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516b47c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:37:57, skipping insertion in model container [2021-12-14 13:37:57,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:37:56" (2/3) ... [2021-12-14 13:37:57,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516b47c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:37:57, skipping insertion in model container [2021-12-14 13:37:57,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:37:57" (3/3) ... [2021-12-14 13:37:57,142 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-queue-2.i [2021-12-14 13:37:57,145 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:37:57,146 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2021-12-14 13:37:57,190 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:37:57,201 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 13:37:57,201 INFO L340 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-12-14 13:37:57,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 70 states have (on average 2.0) internal successors, (140), 84 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:37:57,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-14 13:37:57,230 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:37:57,230 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-14 13:37:57,235 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-12-14 13:37:57,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:37:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash 28752478, now seen corresponding path program 1 times [2021-12-14 13:37:57,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:37:57,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593500391] [2021-12-14 13:37:57,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:37:57,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:37:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:37:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:37:57,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:37:57,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593500391] [2021-12-14 13:37:57,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593500391] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:37:57,536 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:37:57,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 13:37:57,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147110425] [2021-12-14 13:37:57,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:37:57,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 13:37:57,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:37:57,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 13:37:57,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 13:37:57,591 INFO L87 Difference]: Start difference. First operand has 85 states, 70 states have (on average 2.0) internal successors, (140), 84 states have internal predecessors, (140), 0 states have call successors, (0), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:37:57,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:37:57,606 INFO L93 Difference]: Finished difference Result 168 states and 278 transitions. [2021-12-14 13:37:57,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 13:37:57,608 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-14 13:37:57,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:37:57,613 INFO L225 Difference]: With dead ends: 168 [2021-12-14 13:37:57,614 INFO L226 Difference]: Without dead ends: 80 [2021-12-14 13:37:57,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 13:37:57,618 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:37:57,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:37:57,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-14 13:37:57,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-12-14 13:37:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 79 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:37:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2021-12-14 13:37:57,642 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 5 [2021-12-14 13:37:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:37:57,642 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2021-12-14 13:37:57,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:37:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2021-12-14 13:37:57,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 13:37:57,644 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:37:57,644 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 13:37:57,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 13:37:57,644 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-12-14 13:37:57,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:37:57,647 INFO L85 PathProgramCache]: Analyzing trace with hash 889571111, now seen corresponding path program 1 times [2021-12-14 13:37:57,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:37:57,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229617267] [2021-12-14 13:37:57,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:37:57,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:37:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:37:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:37:57,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:37:57,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229617267] [2021-12-14 13:37:57,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229617267] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:37:57,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:37:57,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:37:57,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152599522] [2021-12-14 13:37:57,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:37:57,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:37:57,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:37:57,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:37:57,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:37:57,720 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:37:57,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:37:57,757 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2021-12-14 13:37:57,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:37:57,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-12-14 13:37:57,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:37:57,760 INFO L225 Difference]: With dead ends: 80 [2021-12-14 13:37:57,761 INFO L226 Difference]: Without dead ends: 70 [2021-12-14 13:37:57,761 INFO L932 BasicCegarLoop]: 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 [2021-12-14 13:37:57,763 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 75 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:37:57,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 67 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:37:57,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-14 13:37:57,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-12-14 13:37:57,773 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) [2021-12-14 13:37:57,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2021-12-14 13:37:57,773 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 6 [2021-12-14 13:37:57,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:37:57,773 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2021-12-14 13:37:57,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:37:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2021-12-14 13:37:57,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 13:37:57,774 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:37:57,774 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:37:57,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 13:37:57,774 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-12-14 13:37:57,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:37:57,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1270244236, now seen corresponding path program 1 times [2021-12-14 13:37:57,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:37:57,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281319595] [2021-12-14 13:37:57,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:37:57,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:37:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:37:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:37:57,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:37:57,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281319595] [2021-12-14 13:37:57,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281319595] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:37:57,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:37:57,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:37:57,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987293398] [2021-12-14 13:37:57,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:37:57,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:37:57,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:37:57,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:37:57,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:37:57,923 INFO L87 Difference]: Start difference. First operand 70 states and 79 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) [2021-12-14 13:37:58,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:37:58,026 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2021-12-14 13:37:58,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:37:58,027 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 [2021-12-14 13:37:58,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:37:58,028 INFO L225 Difference]: With dead ends: 119 [2021-12-14 13:37:58,028 INFO L226 Difference]: Without dead ends: 117 [2021-12-14 13:37:58,028 INFO L932 BasicCegarLoop]: 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 [2021-12-14 13:37:58,029 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 159 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:37:58,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 124 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:37:58,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-14 13:37:58,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 68. [2021-12-14 13:37:58,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:37:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2021-12-14 13:37:58,034 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 9 [2021-12-14 13:37:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:37:58,034 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2021-12-14 13:37:58,034 INFO L471 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) [2021-12-14 13:37:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2021-12-14 13:37:58,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 13:37:58,034 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:37:58,034 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:37:58,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 13:37:58,035 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-12-14 13:37:58,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:37:58,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1286414876, now seen corresponding path program 1 times [2021-12-14 13:37:58,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:37:58,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245565719] [2021-12-14 13:37:58,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:37:58,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:37:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:37:58,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:37:58,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:37:58,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245565719] [2021-12-14 13:37:58,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245565719] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:37:58,078 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:37:58,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:37:58,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344258009] [2021-12-14 13:37:58,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:37:58,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:37:58,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:37:58,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:37:58,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:37:58,079 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:37:58,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:37:58,098 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2021-12-14 13:37:58,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:37:58,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-14 13:37:58,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:37:58,099 INFO L225 Difference]: With dead ends: 153 [2021-12-14 13:37:58,099 INFO L226 Difference]: Without dead ends: 87 [2021-12-14 13:37:58,100 INFO L932 BasicCegarLoop]: 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 [2021-12-14 13:37:58,100 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 17 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:37:58,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 135 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:37:58,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-14 13:37:58,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2021-12-14 13:37:58,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 75 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:37:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2021-12-14 13:37:58,106 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 12 [2021-12-14 13:37:58,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:37:58,106 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2021-12-14 13:37:58,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:37:58,106 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2021-12-14 13:37:58,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 13:37:58,107 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:37:58,107 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:37:58,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 13:37:58,107 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-12-14 13:37:58,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:37:58,107 INFO L85 PathProgramCache]: Analyzing trace with hash -138012862, now seen corresponding path program 1 times [2021-12-14 13:37:58,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:37:58,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371745755] [2021-12-14 13:37:58,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:37:58,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:37:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:37:58,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:37:58,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:37:58,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371745755] [2021-12-14 13:37:58,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371745755] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:37:58,148 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:37:58,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:37:58,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502647209] [2021-12-14 13:37:58,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:37:58,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:37:58,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:37:58,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:37:58,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:37:58,149 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:37:58,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:37:58,208 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2021-12-14 13:37:58,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:37:58,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-14 13:37:58,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:37:58,209 INFO L225 Difference]: With dead ends: 91 [2021-12-14 13:37:58,210 INFO L226 Difference]: Without dead ends: 71 [2021-12-14 13:37:58,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:37:58,211 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 6 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:37:58,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 265 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:37:58,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-14 13:37:58,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-14 13:37:58,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 63 states have (on average 1.253968253968254) internal successors, (79), 70 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) [2021-12-14 13:37:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2021-12-14 13:37:58,215 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 17 [2021-12-14 13:37:58,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:37:58,215 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2021-12-14 13:37:58,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:37:58,215 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2021-12-14 13:37:58,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 13:37:58,215 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:37:58,216 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:37:58,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 13:37:58,216 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-12-14 13:37:58,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:37:58,216 INFO L85 PathProgramCache]: Analyzing trace with hash -472870040, now seen corresponding path program 1 times [2021-12-14 13:37:58,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:37:58,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459160919] [2021-12-14 13:37:58,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:37:58,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:37:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:37:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:37:58,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:37:58,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459160919] [2021-12-14 13:37:58,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459160919] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:37:58,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248861168] [2021-12-14 13:37:58,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:37:58,284 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:37:58,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:37:58,285 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) [2021-12-14 13:37:58,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 13:37:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:37:58,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-14 13:37:58,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:37:58,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 13:37:58,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2021-12-14 13:37:58,498 INFO L354 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2021-12-14 13:37:58,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 53 [2021-12-14 13:37:58,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2021-12-14 13:37:58,510 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-14 13:37:58,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 15 [2021-12-14 13:37:58,542 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:37:58,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-14 13:37:58,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2021-12-14 13:37:58,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:37:58,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:37:58,665 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_285 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2021-12-14 13:37:58,678 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:37:58,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2021-12-14 13:37:58,686 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:37:58,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 334 treesize of output 225 [2021-12-14 13:37:58,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 192 [2021-12-14 13:37:58,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 188 [2021-12-14 13:37:58,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 180 [2021-12-14 13:37:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:37:58,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248861168] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:37:58,830 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:37:58,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-12-14 13:37:58,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828149579] [2021-12-14 13:37:58,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:37:58,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 13:37:58,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:37:58,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 13:37:58,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2021-12-14 13:37:58,831 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:37:58,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:37:58,940 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2021-12-14 13:37:58,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:37:58,940 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 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 [2021-12-14 13:37:58,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:37:58,941 INFO L225 Difference]: With dead ends: 144 [2021-12-14 13:37:58,941 INFO L226 Difference]: Without dead ends: 142 [2021-12-14 13:37:58,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=79, Unknown=1, NotChecked=18, Total=132 [2021-12-14 13:37:58,942 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 186 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:37:58,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 400 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 95 Unchecked, 0.1s Time] [2021-12-14 13:37:58,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-14 13:37:58,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 84. [2021-12-14 13:37:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.236842105263158) internal successors, (94), 83 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:37:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2021-12-14 13:37:58,946 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 19 [2021-12-14 13:37:58,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:37:58,946 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2021-12-14 13:37:58,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:37:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2021-12-14 13:37:58,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-14 13:37:58,947 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:37:58,947 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:37:58,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 13:37:59,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-14 13:37:59,165 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-12-14 13:37:59,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:37:59,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1456359625, now seen corresponding path program 1 times [2021-12-14 13:37:59,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:37:59,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275583552] [2021-12-14 13:37:59,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:37:59,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:37:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:37:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:37:59,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:37:59,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275583552] [2021-12-14 13:37:59,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275583552] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:37:59,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:37:59,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:37:59,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134649187] [2021-12-14 13:37:59,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:37:59,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:37:59,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:37:59,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:37:59,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:37:59,213 INFO L87 Difference]: Start difference. First operand 84 states and 94 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) [2021-12-14 13:37:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:37:59,233 INFO L93 Difference]: Finished difference Result 174 states and 199 transitions. [2021-12-14 13:37:59,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:37:59,234 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 [2021-12-14 13:37:59,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:37:59,234 INFO L225 Difference]: With dead ends: 174 [2021-12-14 13:37:59,234 INFO L226 Difference]: Without dead ends: 108 [2021-12-14 13:37:59,235 INFO L932 BasicCegarLoop]: 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 [2021-12-14 13:37:59,235 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 24 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:37:59,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 127 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:37:59,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-14 13:37:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2021-12-14 13:37:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 89 states have (on average 1.202247191011236) internal successors, (107), 96 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:37:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2021-12-14 13:37:59,239 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 20 [2021-12-14 13:37:59,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:37:59,240 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2021-12-14 13:37:59,240 INFO L471 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) [2021-12-14 13:37:59,240 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2021-12-14 13:37:59,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 13:37:59,241 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:37:59,241 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:37:59,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 13:37:59,241 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-12-14 13:37:59,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:37:59,242 INFO L85 PathProgramCache]: Analyzing trace with hash 886899864, now seen corresponding path program 1 times [2021-12-14 13:37:59,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:37:59,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248611806] [2021-12-14 13:37:59,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:37:59,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:37:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:37:59,275 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 13:37:59,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:37:59,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248611806] [2021-12-14 13:37:59,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248611806] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:37:59,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:37:59,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:37:59,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104542498] [2021-12-14 13:37:59,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:37:59,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:37:59,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:37:59,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:37:59,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:37:59,277 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:37:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:37:59,298 INFO L93 Difference]: Finished difference Result 201 states and 228 transitions. [2021-12-14 13:37:59,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:37:59,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-14 13:37:59,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:37:59,299 INFO L225 Difference]: With dead ends: 201 [2021-12-14 13:37:59,299 INFO L226 Difference]: Without dead ends: 122 [2021-12-14 13:37:59,300 INFO L932 BasicCegarLoop]: 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 [2021-12-14 13:37:59,300 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 30 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:37:59,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 142 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:37:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-14 13:37:59,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2021-12-14 13:37:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 109 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:37:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2021-12-14 13:37:59,304 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 27 [2021-12-14 13:37:59,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:37:59,313 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2021-12-14 13:37:59,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:37:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2021-12-14 13:37:59,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 13:37:59,314 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:37:59,314 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:37:59,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 13:37:59,315 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-12-14 13:37:59,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:37:59,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2041801735, now seen corresponding path program 1 times [2021-12-14 13:37:59,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:37:59,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895378038] [2021-12-14 13:37:59,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:37:59,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:37:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:37:59,465 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:37:59,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:37:59,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895378038] [2021-12-14 13:37:59,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895378038] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:37:59,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092236188] [2021-12-14 13:37:59,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:37:59,466 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:37:59,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:37:59,467 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) [2021-12-14 13:37:59,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 13:37:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:37:59,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-14 13:37:59,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:37:59,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 13:37:59,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2021-12-14 13:37:59,643 INFO L354 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2021-12-14 13:37:59,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 61 [2021-12-14 13:37:59,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2021-12-14 13:37:59,659 INFO L354 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2021-12-14 13:37:59,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2021-12-14 13:37:59,715 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:37:59,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2021-12-14 13:37:59,810 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-14 13:37:59,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 50 [2021-12-14 13:37:59,832 INFO L354 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2021-12-14 13:37:59,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 106 treesize of output 80 [2021-12-14 13:37:59,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2021-12-14 13:37:59,849 INFO L354 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2021-12-14 13:37:59,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2021-12-14 13:37:59,915 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-14 13:37:59,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 52 [2021-12-14 13:38:00,097 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-14 13:38:00,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2021-12-14 13:38:00,101 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:38:00,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:38:00,130 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_751 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2021-12-14 13:38:00,145 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_746 (Array Int Int)) (v_ArrVal_749 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_743 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_743)))) (store (store .cse0 v_ArrVal_743 v_ArrVal_746) (select (select (store .cse0 v_ArrVal_743 v_ArrVal_749) |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_751)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= (select |c_#valid| v_ArrVal_743) 0)))) is different from false [2021-12-14 13:38:00,202 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:38:00,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2021-12-14 13:38:00,212 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_746 (Array Int Int)) (v_ArrVal_749 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int) (v_ArrVal_751 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_5 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_5))) (store (store .cse0 .cse1 v_ArrVal_746) (select (select (store .cse0 .cse1 v_ArrVal_749) |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_751)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= (select |c_#valid| .cse1) 0))))) is different from false [2021-12-14 13:38:00,228 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:38:00,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 67 [2021-12-14 13:38:00,240 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:38:00,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9187 treesize of output 6554 [2021-12-14 13:38:00,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6522 treesize of output 6090 [2021-12-14 13:38:00,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6090 treesize of output 5962 [2021-12-14 13:38:00,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5962 treesize of output 5946 [2021-12-14 13:38:00,446 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:38:00,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5958 treesize of output 5332 [2021-12-14 13:38:00,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5314 treesize of output 5250 [2021-12-14 13:38:00,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5250 treesize of output 5162 [2021-12-14 13:38:01,262 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-14 13:38:01,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092236188] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:38:01,263 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:38:01,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 18 [2021-12-14 13:38:01,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210670319] [2021-12-14 13:38:01,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:38:01,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-14 13:38:01,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:38:01,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-14 13:38:01,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=172, Unknown=3, NotChecked=84, Total=306 [2021-12-14 13:38:01,264 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:38:01,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:38:01,541 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2021-12-14 13:38:01,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 13:38:01,541 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 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 28 [2021-12-14 13:38:01,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:38:01,542 INFO L225 Difference]: With dead ends: 152 [2021-12-14 13:38:01,542 INFO L226 Difference]: Without dead ends: 150 [2021-12-14 13:38:01,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=242, Unknown=4, NotChecked=102, Total=420 [2021-12-14 13:38:01,543 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 108 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 317 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:38:01,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 697 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 183 Invalid, 0 Unknown, 317 Unchecked, 0.1s Time] [2021-12-14 13:38:01,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-14 13:38:01,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 126. [2021-12-14 13:38:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:38:01,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2021-12-14 13:38:01,548 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 28 [2021-12-14 13:38:01,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:38:01,548 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2021-12-14 13:38:01,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:38:01,548 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2021-12-14 13:38:01,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 13:38:01,549 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:38:01,549 INFO L514 BasicCegarLoop]: 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] [2021-12-14 13:38:01,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 13:38:01,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-12-14 13:38:01,769 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-12-14 13:38:01,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:38:01,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1259768676, now seen corresponding path program 1 times [2021-12-14 13:38:01,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:38:01,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734304669] [2021-12-14 13:38:01,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:38:01,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:38:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:38:01,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:38:01,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:38:01,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734304669] [2021-12-14 13:38:01,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734304669] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:38:01,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:38:01,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:38:01,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076792715] [2021-12-14 13:38:01,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:38:01,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:38:01,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:38:01,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:38:01,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:38:01,817 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:38:01,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:38:01,824 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2021-12-14 13:38:01,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:38:01,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 [2021-12-14 13:38:01,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:38:01,826 INFO L225 Difference]: With dead ends: 129 [2021-12-14 13:38:01,826 INFO L226 Difference]: Without dead ends: 127 [2021-12-14 13:38:01,826 INFO L932 BasicCegarLoop]: 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 [2021-12-14 13:38:01,827 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 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 [2021-12-14 13:38:01,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:38:01,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-14 13:38:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-12-14 13:38:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 119 states have (on average 1.1680672268907564) internal successors, (139), 126 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:38:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2021-12-14 13:38:01,832 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 29 [2021-12-14 13:38:01,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:38:01,832 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2021-12-14 13:38:01,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:38:01,833 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2021-12-14 13:38:01,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 13:38:01,836 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:38:01,837 INFO L514 BasicCegarLoop]: 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] [2021-12-14 13:38:01,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 13:38:01,837 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-12-14 13:38:01,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:38:01,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1259766754, now seen corresponding path program 1 times [2021-12-14 13:38:01,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:38:01,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319679933] [2021-12-14 13:38:01,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:38:01,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:38:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:38:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:38:02,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:38:02,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319679933] [2021-12-14 13:38:02,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319679933] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:38:02,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927990720] [2021-12-14 13:38:02,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:38:02,070 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:38:02,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:38:02,080 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) [2021-12-14 13:38:02,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 13:38:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:38:02,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-14 13:38:02,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:38:02,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 13:38:02,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2021-12-14 13:38:02,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2021-12-14 13:38:02,245 INFO L354 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2021-12-14 13:38:02,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 70 [2021-12-14 13:38:02,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:38:02,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:38:02,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:38:02,256 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:38:02,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2021-12-14 13:38:02,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2021-12-14 13:38:02,268 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-14 13:38:02,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-14 13:38:02,305 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:38:02,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2021-12-14 13:38:02,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 13:38:02,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-12-14 13:38:02,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2021-12-14 13:38:02,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2021-12-14 13:38:02,615 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:38:02,617 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:38:02,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2021-12-14 13:38:02,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:38:02,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:38:02,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2021-12-14 13:38:02,707 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_981 (Array Int Int))) (= |c_ULTIMATE.start_main_~item~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_981) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_984 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_984) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.offset|))) is different from false [2021-12-14 13:38:02,720 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:38:02,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 96 [2021-12-14 13:38:02,725 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:38:02,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 72 [2021-12-14 13:38:02,732 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:38:02,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 199 [2021-12-14 13:38:02,742 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:38:02,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 449 treesize of output 408 [2021-12-14 13:38:02,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 408 treesize of output 392 [2021-12-14 13:38:02,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 392 treesize of output 360 [2021-12-14 13:38:02,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 360 treesize of output 352 [2021-12-14 13:38:02,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 352 treesize of output 348 [2021-12-14 13:38:02,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 317 treesize of output 301 [2021-12-14 13:38:02,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 293 [2021-12-14 13:38:02,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:38:02,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927990720] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:38:02,935 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:38:02,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2021-12-14 13:38:02,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895869067] [2021-12-14 13:38:02,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:38:02,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 13:38:02,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:38:02,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 13:38:02,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=152, Unknown=1, NotChecked=24, Total=210 [2021-12-14 13:38:02,936 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 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) [2021-12-14 13:38:03,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:38:03,325 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2021-12-14 13:38:03,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 13:38:03,326 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 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) Word has length 29 [2021-12-14 13:38:03,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:38:03,326 INFO L225 Difference]: With dead ends: 163 [2021-12-14 13:38:03,326 INFO L226 Difference]: Without dead ends: 161 [2021-12-14 13:38:03,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=324, Unknown=1, NotChecked=38, Total=462 [2021-12-14 13:38:03,327 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 166 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:38:03,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 661 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 187 Invalid, 0 Unknown, 140 Unchecked, 0.1s Time] [2021-12-14 13:38:03,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-14 13:38:03,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 136. [2021-12-14 13:38:03,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 128 states have (on average 1.1640625) internal successors, (149), 135 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:38:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2021-12-14 13:38:03,331 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 29 [2021-12-14 13:38:03,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:38:03,331 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2021-12-14 13:38:03,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 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) [2021-12-14 13:38:03,331 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2021-12-14 13:38:03,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 13:38:03,331 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:38:03,331 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:38:03,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 13:38:03,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:38:03,539 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-12-14 13:38:03,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:38:03,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1992708989, now seen corresponding path program 1 times [2021-12-14 13:38:03,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:38:03,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639193966] [2021-12-14 13:38:03,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:38:03,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:38:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:38:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:38:03,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:38:03,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639193966] [2021-12-14 13:38:03,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639193966] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:38:03,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023049043] [2021-12-14 13:38:03,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:38:03,714 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:38:03,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:38:03,715 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) [2021-12-14 13:38:03,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 13:38:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:38:03,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 80 conjunts are in the unsatisfiable core [2021-12-14 13:38:03,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:38:03,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 13:38:03,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2021-12-14 13:38:03,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2021-12-14 13:38:03,934 INFO L354 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2021-12-14 13:38:03,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 78 [2021-12-14 13:38:03,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:38:03,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:38:03,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:38:03,950 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:38:03,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2021-12-14 13:38:03,966 INFO L354 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2021-12-14 13:38:03,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2021-12-14 13:38:03,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2021-12-14 13:38:04,017 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 13:38:04,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2021-12-14 13:38:04,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 13:38:04,052 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:38:04,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-14 13:38:04,160 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-14 13:38:04,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 75 [2021-12-14 13:38:04,186 INFO L354 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2021-12-14 13:38:04,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 179 treesize of output 139 [2021-12-14 13:38:04,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 117 [2021-12-14 13:38:04,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:38:04,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:38:04,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:38:04,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:38:04,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:38:04,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2021-12-14 13:38:04,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2021-12-14 13:38:04,218 INFO L354 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2021-12-14 13:38:04,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2021-12-14 13:38:04,287 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-14 13:38:04,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 63 [2021-12-14 13:38:04,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:38:04,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2021-12-14 13:38:04,542 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-14 13:38:04,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 33 [2021-12-14 13:38:04,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 13:38:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:38:04,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:38:04,586 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1274))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1275) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))) is different from false [2021-12-14 13:38:04,620 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1271 Int) (v_ArrVal_1257 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1274 (Array Int Int))) (or (not (= (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_1271)))) (let ((.cse2 (select (select (store .cse1 v_ArrVal_1271 v_ArrVal_1263) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (select (let ((.cse0 (store (store .cse1 v_ArrVal_1271 v_ArrVal_1257) .cse2 v_ArrVal_1274))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| 0)) v_ArrVal_1271 v_ArrVal_1264) .cse2 v_ArrVal_1275) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) 0)) (= v_ArrVal_1271 0) (not (= (select |c_#valid| v_ArrVal_1271) 0)))) is different from false [2021-12-14 13:38:04,698 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:38:04,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2021-12-14 13:38:04,704 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:38:04,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 80 [2021-12-14 13:38:04,747 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_1257 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1274 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_16 |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (= .cse0 0) (not (= (select v_arrayElimArr_15 |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (not (= (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_16))) (let ((.cse3 (select (select (store .cse2 .cse0 v_ArrVal_1263) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (select (let ((.cse1 (store (store .cse2 .cse0 v_ArrVal_1257) .cse3 v_ArrVal_1274))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_15) .cse0 v_ArrVal_1264) .cse3 v_ArrVal_1275) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) 0))))) is different from false [2021-12-14 13:38:04,764 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:38:04,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 489 treesize of output 393 [2021-12-14 13:38:04,770 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:38:04,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 341 treesize of output 238 [2021-12-14 13:38:07,127 INFO L354 Elim1Store]: treesize reduction 1192, result has 37.3 percent of original size [2021-12-14 13:38:07,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 23 new quantified variables, introduced 153 case distinctions, treesize of input 79809359 treesize of output 54414285