./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-buckets-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/sll-buckets-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:02:38,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:02:38,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:02:38,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:02:38,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:02:38,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:02:38,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:02:38,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:02:38,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:02:38,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:02:38,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:02:38,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:02:38,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:02:38,768 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:02:38,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:02:38,770 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:02:38,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:02:38,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:02:38,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:02:38,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:02:38,778 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:02:38,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:02:38,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:02:38,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:02:38,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:02:38,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:02:38,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:02:38,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:02:38,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:02:38,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:02:38,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:02:38,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:02:38,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:02:38,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:02:38,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:02:38,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:02:38,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:02:38,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:02:38,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:02:38,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:02:38,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:02:38,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:02:38,794 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 15:02:38,814 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:02:38,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:02:38,815 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:02:38,815 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:02:38,815 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:02:38,815 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:02:38,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:02:38,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:02:38,816 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:02:38,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:02:38,817 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:02:38,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:02:38,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:02:38,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:02:38,817 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:02:38,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:02:38,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:02:38,818 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:02:38,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:02:38,818 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:02:38,818 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:02:38,818 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:02:38,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:02:38,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:02:38,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:02:38,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:02:38,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:02:38,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:02:38,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:02:38,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:02:38,820 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:02:38,820 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:02:38,820 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:02:38,820 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 -> c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac [2022-07-13 15:02:39,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:02:39,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:02:39,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:02:39,018 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:02:39,018 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:02:39,019 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-buckets-1.i [2022-07-13 15:02:39,083 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e1b6dace/61ffdf2e7ab74233b159da705955ade3/FLAG52bcbdb3e [2022-07-13 15:02:39,524 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:02:39,524 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2022-07-13 15:02:39,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e1b6dace/61ffdf2e7ab74233b159da705955ade3/FLAG52bcbdb3e [2022-07-13 15:02:39,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e1b6dace/61ffdf2e7ab74233b159da705955ade3 [2022-07-13 15:02:39,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:02:39,545 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:02:39,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:02:39,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:02:39,551 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:02:39,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:02:39" (1/1) ... [2022-07-13 15:02:39,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d33e42e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:39, skipping insertion in model container [2022-07-13 15:02:39,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:02:39" (1/1) ... [2022-07-13 15:02:39,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:02:39,584 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:02:39,784 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22663,22676] [2022-07-13 15:02:39,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22734,22747] [2022-07-13 15:02:39,792 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22862,22875] [2022-07-13 15:02:39,795 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23275,23288] [2022-07-13 15:02:39,796 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23364,23377] [2022-07-13 15:02:39,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:02:39,808 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:02:39,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22663,22676] [2022-07-13 15:02:39,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22734,22747] [2022-07-13 15:02:39,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22862,22875] [2022-07-13 15:02:39,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23275,23288] [2022-07-13 15:02:39,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23364,23377] [2022-07-13 15:02:39,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:02:39,864 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:02:39,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:39 WrapperNode [2022-07-13 15:02:39,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:02:39,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:02:39,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:02:39,866 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:02:39,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:39" (1/1) ... [2022-07-13 15:02:39,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:39" (1/1) ... [2022-07-13 15:02:39,908 INFO L137 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 155 [2022-07-13 15:02:39,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:02:39,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:02:39,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:02:39,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:02:39,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:39" (1/1) ... [2022-07-13 15:02:39,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:39" (1/1) ... [2022-07-13 15:02:39,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:39" (1/1) ... [2022-07-13 15:02:39,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:39" (1/1) ... [2022-07-13 15:02:39,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:39" (1/1) ... [2022-07-13 15:02:39,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:39" (1/1) ... [2022-07-13 15:02:39,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:39" (1/1) ... [2022-07-13 15:02:39,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:02:39,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:02:39,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:02:39,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:02:39,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:39" (1/1) ... [2022-07-13 15:02:39,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:02:39,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:39,984 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 15:02:39,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 15:02:40,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 15:02:40,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 15:02:40,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:02:40,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:02:40,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:02:40,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:02:40,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:02:40,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:02:40,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:02:40,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:02:40,086 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:02:40,089 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:02:40,339 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:02:40,343 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:02:40,343 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2022-07-13 15:02:40,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:02:40 BoogieIcfgContainer [2022-07-13 15:02:40,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:02:40,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:02:40,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:02:40,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:02:40,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:02:39" (1/3) ... [2022-07-13 15:02:40,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c66254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:02:40, skipping insertion in model container [2022-07-13 15:02:40,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:39" (2/3) ... [2022-07-13 15:02:40,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c66254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:02:40, skipping insertion in model container [2022-07-13 15:02:40,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:02:40" (3/3) ... [2022-07-13 15:02:40,350 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2022-07-13 15:02:40,358 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:02:40,358 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-07-13 15:02:40,385 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:02:40,389 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@26470ba8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6f87f5ad [2022-07-13 15:02:40,390 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-13 15:02:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.868421052631579) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 15:02:40,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:40,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:40,397 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:02:40,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:40,400 INFO L85 PathProgramCache]: Analyzing trace with hash 179510098, now seen corresponding path program 1 times [2022-07-13 15:02:40,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:40,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212627445] [2022-07-13 15:02:40,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:40,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:40,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:40,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212627445] [2022-07-13 15:02:40,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212627445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:40,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:40,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:40,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759797426] [2022-07-13 15:02:40,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:40,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:40,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:40,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:40,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:40,656 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.868421052631579) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:40,738 INFO L93 Difference]: Finished difference Result 112 states and 188 transitions. [2022-07-13 15:02:40,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:02:40,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-07-13 15:02:40,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:40,746 INFO L225 Difference]: With dead ends: 112 [2022-07-13 15:02:40,747 INFO L226 Difference]: Without dead ends: 66 [2022-07-13 15:02:40,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:40,754 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 91 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:40,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 84 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:40,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-13 15:02:40,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 41. [2022-07-13 15:02:40,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-07-13 15:02:40,784 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 8 [2022-07-13 15:02:40,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:40,784 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-07-13 15:02:40,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,785 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-07-13 15:02:40,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 15:02:40,785 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:40,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:40,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:02:40,786 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:02:40,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:40,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1306111283, now seen corresponding path program 1 times [2022-07-13 15:02:40,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:40,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795054289] [2022-07-13 15:02:40,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:40,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:40,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:40,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:40,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795054289] [2022-07-13 15:02:40,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795054289] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:40,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:40,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:40,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242165858] [2022-07-13 15:02:40,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:40,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:40,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:40,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:40,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:40,886 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:40,918 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-07-13 15:02:40,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:40,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-13 15:02:40,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:40,920 INFO L225 Difference]: With dead ends: 45 [2022-07-13 15:02:40,921 INFO L226 Difference]: Without dead ends: 43 [2022-07-13 15:02:40,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:40,925 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:40,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 68 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:40,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-13 15:02:40,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-07-13 15:02:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-07-13 15:02:40,937 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 9 [2022-07-13 15:02:40,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:40,938 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-07-13 15:02:40,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,942 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-07-13 15:02:40,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 15:02:40,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:40,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:40,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:02:40,944 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:02:40,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:40,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1834780084, now seen corresponding path program 1 times [2022-07-13 15:02:40,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:40,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697467827] [2022-07-13 15:02:40,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:40,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:41,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:41,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697467827] [2022-07-13 15:02:41,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697467827] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:41,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:41,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:02:41,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878234058] [2022-07-13 15:02:41,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:41,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:02:41,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:41,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:02:41,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:41,117 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:41,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:41,220 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-07-13 15:02:41,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 15:02:41,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-13 15:02:41,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:41,229 INFO L225 Difference]: With dead ends: 61 [2022-07-13 15:02:41,229 INFO L226 Difference]: Without dead ends: 50 [2022-07-13 15:02:41,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 15:02:41,232 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 28 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:41,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 94 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:41,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-13 15:02:41,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-07-13 15:02:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 43 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2022-07-13 15:02:41,242 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 10 [2022-07-13 15:02:41,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:41,242 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2022-07-13 15:02:41,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:41,243 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-07-13 15:02:41,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 15:02:41,243 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:41,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:41,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 15:02:41,243 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:02:41,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:41,244 INFO L85 PathProgramCache]: Analyzing trace with hash 710639734, now seen corresponding path program 1 times [2022-07-13 15:02:41,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:41,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942654812] [2022-07-13 15:02:41,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:41,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:41,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:41,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942654812] [2022-07-13 15:02:41,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942654812] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:41,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:41,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:41,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470110466] [2022-07-13 15:02:41,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:41,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:41,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:41,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:41,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:41,275 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:41,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:41,319 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-07-13 15:02:41,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:41,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-13 15:02:41,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:41,320 INFO L225 Difference]: With dead ends: 45 [2022-07-13 15:02:41,320 INFO L226 Difference]: Without dead ends: 43 [2022-07-13 15:02:41,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:41,320 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:41,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 51 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:41,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-13 15:02:41,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-07-13 15:02:41,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.275) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2022-07-13 15:02:41,324 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 10 [2022-07-13 15:02:41,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:41,324 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2022-07-13 15:02:41,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-07-13 15:02:41,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 15:02:41,325 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:41,325 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:41,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 15:02:41,325 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:02:41,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:41,325 INFO L85 PathProgramCache]: Analyzing trace with hash 625501225, now seen corresponding path program 1 times [2022-07-13 15:02:41,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:41,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968276393] [2022-07-13 15:02:41,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:41,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:41,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:41,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:41,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968276393] [2022-07-13 15:02:41,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968276393] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:02:41,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686592474] [2022-07-13 15:02:41,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:41,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:41,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:41,492 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:02:41,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 15:02:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:41,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-13 15:02:41,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:41,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:41,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 32 [2022-07-13 15:02:41,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:41,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2022-07-13 15:02:41,720 INFO L356 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-07-13 15:02:41,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 74 [2022-07-13 15:02:41,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:41,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:41,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:41,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-07-13 15:02:41,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-13 15:02:41,760 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:02:41,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2022-07-13 15:02:41,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-13 15:02:41,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:41,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2022-07-13 15:02:41,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:41,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:02:41,870 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-13 15:02:41,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 51 [2022-07-13 15:02:41,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:41,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:02:41,967 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:02:41,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 44 [2022-07-13 15:02:41,978 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-07-13 15:02:41,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 21 [2022-07-13 15:02:41,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:41,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:02:42,143 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-13 15:02:42,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 1 [2022-07-13 15:02:42,148 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-13 15:02:42,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 1 [2022-07-13 15:02:42,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:42,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686592474] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:02:42,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:02:42,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-07-13 15:02:42,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120881118] [2022-07-13 15:02:42,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:02:42,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 15:02:42,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:42,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 15:02:42,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-07-13 15:02:42,151 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:42,455 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-07-13 15:02:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 15:02:42,456 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-13 15:02:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:42,456 INFO L225 Difference]: With dead ends: 64 [2022-07-13 15:02:42,456 INFO L226 Difference]: Without dead ends: 53 [2022-07-13 15:02:42,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2022-07-13 15:02:42,457 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 41 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:42,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 219 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 187 Invalid, 0 Unknown, 28 Unchecked, 0.2s Time] [2022-07-13 15:02:42,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-13 15:02:42,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2022-07-13 15:02:42,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:42,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-07-13 15:02:42,461 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 15 [2022-07-13 15:02:42,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:42,461 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-07-13 15:02:42,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:42,461 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-07-13 15:02:42,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 15:02:42,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:42,461 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:42,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 15:02:42,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:42,675 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:02:42,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:42,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1157082046, now seen corresponding path program 1 times [2022-07-13 15:02:42,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:42,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529198117] [2022-07-13 15:02:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:42,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:42,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:42,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529198117] [2022-07-13 15:02:42,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529198117] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:02:42,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210291416] [2022-07-13 15:02:42,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:42,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:42,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:42,734 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:02:42,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 15:02:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:42,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-13 15:02:42,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:42,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:42,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-07-13 15:02:42,860 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-07-13 15:02:42,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 71 [2022-07-13 15:02:42,882 INFO L356 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-07-13 15:02:42,883 INFO L390 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 4 case distinctions, treesize of input 51 treesize of output 46 [2022-07-13 15:02:42,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:42,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-07-13 15:02:42,925 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-13 15:02:42,925 INFO L390 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 20 treesize of output 22 [2022-07-13 15:02:42,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2022-07-13 15:02:43,001 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:02:43,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-07-13 15:02:43,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:43,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:02:43,022 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_671 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_671) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0))) is different from false [2022-07-13 15:02:43,029 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_22| Int) (v_ArrVal_671 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_22| v_ArrVal_671) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_22|) 0)))) is different from false [2022-07-13 15:02:43,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:43,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210291416] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:02:43,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:02:43,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2022-07-13 15:02:43,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501272088] [2022-07-13 15:02:43,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:02:43,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 15:02:43,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:43,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 15:02:43,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=83, Unknown=2, NotChecked=38, Total=156 [2022-07-13 15:02:43,070 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:43,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:43,430 INFO L93 Difference]: Finished difference Result 155 states and 194 transitions. [2022-07-13 15:02:43,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 15:02:43,430 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-13 15:02:43,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:43,431 INFO L225 Difference]: With dead ends: 155 [2022-07-13 15:02:43,431 INFO L226 Difference]: Without dead ends: 153 [2022-07-13 15:02:43,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=262, Unknown=2, NotChecked=74, Total=462 [2022-07-13 15:02:43,432 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 283 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:43,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 326 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 264 Invalid, 0 Unknown, 167 Unchecked, 0.2s Time] [2022-07-13 15:02:43,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-13 15:02:43,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 71. [2022-07-13 15:02:43,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 70 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:43,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2022-07-13 15:02:43,437 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 16 [2022-07-13 15:02:43,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:43,437 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2022-07-13 15:02:43,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:43,437 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2022-07-13 15:02:43,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 15:02:43,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:43,446 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:43,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:43,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-13 15:02:43,647 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:02:43,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:43,647 INFO L85 PathProgramCache]: Analyzing trace with hash 442135079, now seen corresponding path program 2 times [2022-07-13 15:02:43,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:43,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684555680] [2022-07-13 15:02:43,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:43,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:43,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:43,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684555680] [2022-07-13 15:02:43,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684555680] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:02:43,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504476596] [2022-07-13 15:02:43,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:02:43,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:43,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:43,756 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:02:43,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 15:02:44,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:02:44,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:02:44,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-13 15:02:44,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:44,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:44,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:44,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:44,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2022-07-13 15:02:44,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:44,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:44,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:44,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 15:02:44,073 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-13 15:02:44,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 34 [2022-07-13 15:02:44,132 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-13 15:02:44,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-07-13 15:02:44,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 15:02:44,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-13 15:02:44,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-07-13 15:02:44,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 15:02:44,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:44,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504476596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:44,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 15:02:44,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-07-13 15:02:44,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944883507] [2022-07-13 15:02:44,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:44,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:02:44,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:44,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:02:44,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-13 15:02:44,248 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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) [2022-07-13 15:02:44,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:44,488 INFO L93 Difference]: Finished difference Result 138 states and 171 transitions. [2022-07-13 15:02:44,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 15:02:44,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 18 [2022-07-13 15:02:44,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:44,489 INFO L225 Difference]: With dead ends: 138 [2022-07-13 15:02:44,489 INFO L226 Difference]: Without dead ends: 103 [2022-07-13 15:02:44,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-13 15:02:44,490 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:44,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 142 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 96 Invalid, 0 Unknown, 30 Unchecked, 0.2s Time] [2022-07-13 15:02:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-13 15:02:44,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 78. [2022-07-13 15:02:44,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:44,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2022-07-13 15:02:44,497 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 18 [2022-07-13 15:02:44,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:44,497 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2022-07-13 15:02:44,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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) [2022-07-13 15:02:44,497 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2022-07-13 15:02:44,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 15:02:44,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:44,498 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:44,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-13 15:02:44,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:44,699 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:02:44,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:44,700 INFO L85 PathProgramCache]: Analyzing trace with hash -482453053, now seen corresponding path program 1 times [2022-07-13 15:02:44,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:44,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782801808] [2022-07-13 15:02:44,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:44,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:44,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:44,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782801808] [2022-07-13 15:02:44,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782801808] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:02:44,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012673144] [2022-07-13 15:02:44,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:44,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:44,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:44,823 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) [2022-07-13 15:02:44,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 15:02:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:44,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-13 15:02:44,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:44,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:44,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-07-13 15:02:44,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:44,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-07-13 15:02:45,008 INFO L356 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-07-13 15:02:45,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 81 [2022-07-13 15:02:45,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:45,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:45,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:45,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-07-13 15:02:45,041 INFO L356 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-07-13 15:02:45,041 INFO L390 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 4 case distinctions, treesize of input 51 treesize of output 46 [2022-07-13 15:02:45,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-13 15:02:45,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-13 15:02:45,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:45,143 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:02:45,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 78 [2022-07-13 15:02:45,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:45,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:45,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:45,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-07-13 15:02:45,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:45,164 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-13 15:02:45,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-07-13 15:02:45,227 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:02:45,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 76 [2022-07-13 15:02:45,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:45,253 INFO L390 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 35 [2022-07-13 15:02:45,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:45,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 37 treesize of output 13 [2022-07-13 15:02:45,431 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:02:45,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 26 [2022-07-13 15:02:45,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:45,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:02:45,477 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1043 (Array Int Int)) (v_ArrVal_1042 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1043))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1042) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 0))) is different from false [2022-07-13 15:02:45,485 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_24| Int) (v_ArrVal_1043 (Array Int Int)) (v_ArrVal_1042 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_24|) 0)) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_24| v_ArrVal_1043))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_24| v_ArrVal_1042) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 0)))) is different from false [2022-07-13 15:02:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:45,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012673144] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:02:45,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:02:45,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-07-13 15:02:45,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606558434] [2022-07-13 15:02:45,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:02:45,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 15:02:45,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:45,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 15:02:45,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=195, Unknown=2, NotChecked=58, Total=306 [2022-07-13 15:02:45,520 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:46,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:46,119 INFO L93 Difference]: Finished difference Result 127 states and 156 transitions. [2022-07-13 15:02:46,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 15:02:46,119 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-13 15:02:46,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:46,121 INFO L225 Difference]: With dead ends: 127 [2022-07-13 15:02:46,121 INFO L226 Difference]: Without dead ends: 125 [2022-07-13 15:02:46,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=454, Unknown=2, NotChecked=94, Total=702 [2022-07-13 15:02:46,121 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 210 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:46,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 255 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 306 Invalid, 0 Unknown, 165 Unchecked, 0.3s Time] [2022-07-13 15:02:46,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-13 15:02:46,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 80. [2022-07-13 15:02:46,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 79 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:46,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2022-07-13 15:02:46,133 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 19 [2022-07-13 15:02:46,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:46,134 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2022-07-13 15:02:46,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:46,134 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2022-07-13 15:02:46,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 15:02:46,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:46,134 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:46,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:46,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:46,349 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:02:46,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:46,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1136543444, now seen corresponding path program 2 times [2022-07-13 15:02:46,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:46,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434521] [2022-07-13 15:02:46,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:46,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:46,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:46,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:46,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434521] [2022-07-13 15:02:46,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434521] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:02:46,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257424112] [2022-07-13 15:02:46,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:02:46,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:46,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:46,584 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:02:46,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 15:02:46,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:02:46,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:02:46,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-13 15:02:46,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:47,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:47,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2022-07-13 15:02:47,029 INFO L356 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-07-13 15:02:47,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 92 [2022-07-13 15:02:47,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:47,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2022-07-13 15:02:47,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:47,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:47,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:47,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2022-07-13 15:02:47,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-13 15:02:47,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 31 [2022-07-13 15:02:47,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 31 [2022-07-13 15:02:47,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-13 15:02:47,061 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-13 15:02:47,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 43 [2022-07-13 15:02:47,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:47,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:02:47,167 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-13 15:02:47,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 94 treesize of output 69 [2022-07-13 15:02:47,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:47,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:47,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 69 [2022-07-13 15:02:47,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:47,279 INFO L356 Elim1Store]: treesize reduction 60, result has 15.5 percent of original size [2022-07-13 15:02:47,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 58 [2022-07-13 15:02:47,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:47,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:02:47,289 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-13 15:02:47,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 65 [2022-07-13 15:02:47,406 INFO L356 Elim1Store]: treesize reduction 33, result has 19.5 percent of original size [2022-07-13 15:02:47,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 64 [2022-07-13 15:02:47,412 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:02:47,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 21 [2022-07-13 15:02:47,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:47,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:02:52,118 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-13 15:02:52,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 522 treesize of output 1 [2022-07-13 15:02:52,125 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-13 15:02:52,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 522 treesize of output 1 [2022-07-13 15:02:52,127 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:52,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257424112] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:02:52,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:02:52,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-07-13 15:02:52,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592182695] [2022-07-13 15:02:52,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:02:52,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 15:02:52,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:52,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 15:02:52,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=279, Unknown=1, NotChecked=0, Total=342 [2022-07-13 15:02:52,130 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:52,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:52,443 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2022-07-13 15:02:52,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 15:02:52,444 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 15:02:52,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:52,444 INFO L225 Difference]: With dead ends: 97 [2022-07-13 15:02:52,444 INFO L226 Difference]: Without dead ends: 86 [2022-07-13 15:02:52,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=117, Invalid=434, Unknown=1, NotChecked=0, Total=552 [2022-07-13 15:02:52,445 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 26 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:52,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 251 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 106 Invalid, 0 Unknown, 135 Unchecked, 0.1s Time] [2022-07-13 15:02:52,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-13 15:02:52,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2022-07-13 15:02:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 84 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2022-07-13 15:02:52,449 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 20 [2022-07-13 15:02:52,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:52,449 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2022-07-13 15:02:52,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-07-13 15:02:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 15:02:52,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:52,450 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:52,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:52,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:52,667 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:02:52,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:52,668 INFO L85 PathProgramCache]: Analyzing trace with hash 220535656, now seen corresponding path program 2 times [2022-07-13 15:02:52,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:52,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314679527] [2022-07-13 15:02:52,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:52,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 15:02:52,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:52,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314679527] [2022-07-13 15:02:52,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314679527] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:02:52,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393476429] [2022-07-13 15:02:52,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:02:52,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:52,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:52,824 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:02:52,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 15:02:53,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:02:53,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:02:53,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-13 15:02:53,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:53,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:53,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 32 [2022-07-13 15:02:53,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:53,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-07-13 15:02:53,188 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-07-13 15:02:53,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 99 [2022-07-13 15:02:53,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2022-07-13 15:02:53,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:53,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:53,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:53,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-07-13 15:02:53,216 INFO L356 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-07-13 15:02:53,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 46 [2022-07-13 15:02:53,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-13 15:02:53,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2022-07-13 15:02:53,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:53,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:53,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-07-13 15:02:53,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:53,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2022-07-13 15:02:53,308 INFO L356 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2022-07-13 15:02:53,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2022-07-13 15:02:53,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2022-07-13 15:02:53,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2022-07-13 15:02:53,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-13 15:02:53,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-07-13 15:02:53,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2022-07-13 15:02:53,505 INFO L390 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 35 treesize of output 19 [2022-07-13 15:02:53,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-07-13 15:02:53,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 15:02:53,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:02:53,575 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) 1)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) 1)) is different from false [2022-07-13 15:02:53,583 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:02:53,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2022-07-13 15:02:53,633 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 15:02:53,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393476429] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:02:53,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:02:53,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-07-13 15:02:53,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593341643] [2022-07-13 15:02:53,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:02:53,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 15:02:53,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:53,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 15:02:53,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=228, Unknown=1, NotChecked=30, Total=306 [2022-07-13 15:02:53,637 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:54,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:54,179 INFO L93 Difference]: Finished difference Result 165 states and 204 transitions. [2022-07-13 15:02:54,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 15:02:54,179 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-13 15:02:54,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:54,180 INFO L225 Difference]: With dead ends: 165 [2022-07-13 15:02:54,180 INFO L226 Difference]: Without dead ends: 130 [2022-07-13 15:02:54,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=406, Unknown=1, NotChecked=42, Total=552 [2022-07-13 15:02:54,180 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 100 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:54,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 309 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 331 Invalid, 0 Unknown, 77 Unchecked, 0.4s Time] [2022-07-13 15:02:54,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-13 15:02:54,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 94. [2022-07-13 15:02:54,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 93 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2022-07-13 15:02:54,185 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 21 [2022-07-13 15:02:54,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:54,185 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2022-07-13 15:02:54,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2022-07-13 15:02:54,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 15:02:54,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:54,186 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:54,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-13 15:02:54,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:54,398 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:02:54,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:54,398 INFO L85 PathProgramCache]: Analyzing trace with hash -800532698, now seen corresponding path program 1 times [2022-07-13 15:02:54,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:54,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456112757] [2022-07-13 15:02:54,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:54,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:54,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:54,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456112757] [2022-07-13 15:02:54,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456112757] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:02:54,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645241390] [2022-07-13 15:02:54,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:54,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:54,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:54,576 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:02:54,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 15:02:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:54,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-13 15:02:54,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:54,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:54,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-07-13 15:02:54,745 INFO L356 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-07-13 15:02:54,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 94 [2022-07-13 15:02:54,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:54,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2022-07-13 15:02:54,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:54,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:54,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:54,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-07-13 15:02:54,783 INFO L356 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-07-13 15:02:54,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 46 [2022-07-13 15:02:54,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-13 15:02:54,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 46 [2022-07-13 15:02:54,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-13 15:02:54,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:54,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:54,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:54,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2022-07-13 15:02:54,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:54,871 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:02:54,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 76 [2022-07-13 15:02:54,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:54,889 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-13 15:02:54,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-07-13 15:02:54,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-13 15:02:54,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:54,967 INFO L390 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 45 treesize of output 42 [2022-07-13 15:02:54,976 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:02:54,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 74 [2022-07-13 15:02:54,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-13 15:02:55,287 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-13 15:02:55,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 62 [2022-07-13 15:02:55,299 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-07-13 15:02:55,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 22 [2022-07-13 15:02:55,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-07-13 15:02:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:55,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:02:55,430 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1655)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1654))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) 2)) (select (select .cse0 .cse1) .cse2)) (+ 8 (select (select .cse3 .cse1) .cse2))))) 2)) is different from false [2022-07-13 15:02:55,441 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:02:55,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 63 [2022-07-13 15:02:55,507 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:55,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645241390] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:02:55,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:02:55,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-07-13 15:02:55,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013726376] [2022-07-13 15:02:55,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:02:55,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 15:02:55,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:55,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 15:02:55,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2022-07-13 15:02:55,509 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:56,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:56,274 INFO L93 Difference]: Finished difference Result 162 states and 199 transitions. [2022-07-13 15:02:56,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 15:02:56,274 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-13 15:02:56,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:56,275 INFO L225 Difference]: With dead ends: 162 [2022-07-13 15:02:56,275 INFO L226 Difference]: Without dead ends: 127 [2022-07-13 15:02:56,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=683, Unknown=1, NotChecked=54, Total=870 [2022-07-13 15:02:56,275 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 125 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:56,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 375 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 492 Invalid, 0 Unknown, 159 Unchecked, 0.5s Time] [2022-07-13 15:02:56,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-13 15:02:56,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2022-07-13 15:02:56,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 94 states have (on average 1.2340425531914894) internal successors, (116), 95 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:56,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2022-07-13 15:02:56,280 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 21 [2022-07-13 15:02:56,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:56,280 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2022-07-13 15:02:56,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:56,280 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-07-13 15:02:56,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 15:02:56,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:56,281 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:56,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:56,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:56,499 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:02:56,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:56,499 INFO L85 PathProgramCache]: Analyzing trace with hash -962615628, now seen corresponding path program 1 times [2022-07-13 15:02:56,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:56,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746868864] [2022-07-13 15:02:56,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:56,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:56,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:56,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:56,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746868864] [2022-07-13 15:02:56,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746868864] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:02:56,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087029347] [2022-07-13 15:02:56,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:56,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:56,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:56,643 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:02:56,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 15:02:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:56,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-13 15:02:56,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:56,821 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-07-13 15:02:56,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 23 [2022-07-13 15:02:56,854 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-13 15:02:56,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 15:02:56,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:02:56,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:02:56,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:56,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2022-07-13 15:02:57,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:02:57,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 15:02:57,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:57,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2022-07-13 15:02:57,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2022-07-13 15:02:57,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-07-13 15:02:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:57,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:02:57,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 168 [2022-07-13 15:02:57,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 298 [2022-07-13 15:03:06,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 115 [2022-07-13 15:03:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:03:06,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087029347] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:03:06,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:03:06,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 29 [2022-07-13 15:03:06,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199998000] [2022-07-13 15:03:06,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:03:06,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-13 15:03:06,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:03:06,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-13 15:03:06,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=695, Unknown=9, NotChecked=0, Total=812 [2022-07-13 15:03:06,656 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 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) [2022-07-13 15:03:07,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:03:07,049 INFO L93 Difference]: Finished difference Result 120 states and 147 transitions. [2022-07-13 15:03:07,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 15:03:07,049 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 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 24 [2022-07-13 15:03:07,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:03:07,050 INFO L225 Difference]: With dead ends: 120 [2022-07-13 15:03:07,050 INFO L226 Difference]: Without dead ends: 118 [2022-07-13 15:03:07,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=156, Invalid=1025, Unknown=9, NotChecked=0, Total=1190 [2022-07-13 15:03:07,051 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 112 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:03:07,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 325 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 212 Invalid, 0 Unknown, 176 Unchecked, 0.3s Time] [2022-07-13 15:03:07,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-13 15:03:07,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 107. [2022-07-13 15:03:07,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 106 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:03:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2022-07-13 15:03:07,056 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 24 [2022-07-13 15:03:07,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:03:07,057 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2022-07-13 15:03:07,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 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) [2022-07-13 15:03:07,057 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2022-07-13 15:03:07,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 15:03:07,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:03:07,057 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:03:07,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 15:03:07,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-13 15:03:07,267 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:03:07,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:03:07,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1317906679, now seen corresponding path program 3 times [2022-07-13 15:03:07,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:03:07,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247675660] [2022-07-13 15:03:07,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:03:07,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:03:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:03:07,439 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:03:07,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:03:07,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247675660] [2022-07-13 15:03:07,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247675660] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:03:07,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194765010] [2022-07-13 15:03:07,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 15:03:07,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:03:07,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:03:07,441 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:03:07,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 15:03:08,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 15:03:08,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:03:08,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-13 15:03:08,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:03:08,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:03:08,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2022-07-13 15:03:08,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:03:08,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2022-07-13 15:03:08,665 INFO L356 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-07-13 15:03:08,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 79 [2022-07-13 15:03:08,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:03:08,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:03:08,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:03:08,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2022-07-13 15:03:08,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-13 15:03:08,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 31 [2022-07-13 15:03:08,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-13 15:03:08,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 31 [2022-07-13 15:03:08,691 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-13 15:03:08,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 43 [2022-07-13 15:03:08,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:03:08,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:03:08,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2022-07-13 15:03:08,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:03:08,769 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-13 15:03:08,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 62 [2022-07-13 15:03:08,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:03:08,896 INFO L356 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2022-07-13 15:03:08,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-07-13 15:03:08,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:03:08,901 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-13 15:03:08,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 65 [2022-07-13 15:03:09,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:03:09,038 INFO L356 Elim1Store]: treesize reduction 168, result has 21.1 percent of original size [2022-07-13 15:03:09,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 80 [2022-07-13 15:03:09,060 INFO L356 Elim1Store]: treesize reduction 108, result has 16.9 percent of original size [2022-07-13 15:03:09,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 72 [2022-07-13 15:03:09,154 INFO L356 Elim1Store]: treesize reduction 85, result has 11.5 percent of original size [2022-07-13 15:03:09,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 74 [2022-07-13 15:03:09,166 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-13 15:03:09,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 25 [2022-07-13 15:03:09,170 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:03:09,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:03:16,884 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-13 15:03:16,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 520 treesize of output 1 [2022-07-13 15:03:16,894 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-13 15:03:16,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 520 treesize of output 1 [2022-07-13 15:03:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:03:16,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194765010] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:03:16,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:03:16,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 18 [2022-07-13 15:03:16,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054746301] [2022-07-13 15:03:16,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:03:16,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 15:03:16,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:03:16,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 15:03:16,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=249, Unknown=3, NotChecked=0, Total=306 [2022-07-13 15:03:16,898 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:03:17,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:03:17,115 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2022-07-13 15:03:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 15:03:17,116 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-13 15:03:17,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:03:17,116 INFO L225 Difference]: With dead ends: 122 [2022-07-13 15:03:17,116 INFO L226 Difference]: Without dead ends: 94 [2022-07-13 15:03:17,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=70, Invalid=307, Unknown=3, NotChecked=0, Total=380 [2022-07-13 15:03:17,117 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:03:17,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 213 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 83 Invalid, 0 Unknown, 75 Unchecked, 0.2s Time] [2022-07-13 15:03:17,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-13 15:03:17,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-13 15:03:17,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 93 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:03:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-07-13 15:03:17,131 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 25 [2022-07-13 15:03:17,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:03:17,132 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-07-13 15:03:17,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:03:17,133 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-07-13 15:03:17,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 15:03:17,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:03:17,134 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:03:17,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 15:03:17,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 15:03:17,347 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:03:17,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:03:17,348 INFO L85 PathProgramCache]: Analyzing trace with hash 352741712, now seen corresponding path program 1 times [2022-07-13 15:03:17,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:03:17,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638092852] [2022-07-13 15:03:17,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:03:17,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:03:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:03:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:03:17,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:03:17,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638092852] [2022-07-13 15:03:17,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638092852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:03:17,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:03:17,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 15:03:17,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006849498] [2022-07-13 15:03:17,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:03:17,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:03:17,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:03:17,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:03:17,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:03:17,421 INFO L87 Difference]: Start difference. First operand 94 states and 116 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:03:17,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:03:17,611 INFO L93 Difference]: Finished difference Result 150 states and 187 transitions. [2022-07-13 15:03:17,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:03:17,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-13 15:03:17,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:03:17,612 INFO L225 Difference]: With dead ends: 150 [2022-07-13 15:03:17,612 INFO L226 Difference]: Without dead ends: 98 [2022-07-13 15:03:17,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-13 15:03:17,613 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 49 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:03:17,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 173 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:03:17,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-13 15:03:17,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2022-07-13 15:03:17,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 87 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:03:17,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2022-07-13 15:03:17,617 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 25 [2022-07-13 15:03:17,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:03:17,617 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2022-07-13 15:03:17,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:03:17,617 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2022-07-13 15:03:17,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 15:03:17,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:03:17,617 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:03:17,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 15:03:17,617 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:03:17,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:03:17,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1702665013, now seen corresponding path program 1 times [2022-07-13 15:03:17,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:03:17,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211516689] [2022-07-13 15:03:17,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:03:17,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:03:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:03:17,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:03:17,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:03:17,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211516689] [2022-07-13 15:03:17,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211516689] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:03:17,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216792246] [2022-07-13 15:03:17,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:03:17,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:03:17,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:03:17,814 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:03:17,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 15:03:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:03:17,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-13 15:03:17,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:03:17,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:03:17,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2022-07-13 15:03:17,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:03:17,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2022-07-13 15:03:18,020 INFO L356 Elim1Store]: treesize reduction 54, result has 31.6 percent of original size [2022-07-13 15:03:18,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 81 [2022-07-13 15:03:18,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:03:18,048 INFO L356 Elim1Store]: treesize reduction 36, result has 44.6 percent of original size [2022-07-13 15:03:18,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 52 [2022-07-13 15:03:18,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2022-07-13 15:03:18,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-13 15:03:18,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 19 [2022-07-13 15:03:18,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-13 15:03:18,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 19 [2022-07-13 15:03:18,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:03:18,094 INFO L390 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 0 case distinctions, treesize of input 13 treesize of output 7 [2022-07-13 15:03:18,107 INFO L390 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 0 case distinctions, treesize of input 65 treesize of output 53 [2022-07-13 15:03:18,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:03:18,184 INFO L390 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 0 case distinctions, treesize of input 76 treesize of output 58 [2022-07-13 15:03:18,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:03:18,219 INFO L390 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 0 case distinctions, treesize of input 76 treesize of output 58 [2022-07-13 15:03:18,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:03:18,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:03:18,559 INFO L356 Elim1Store]: treesize reduction 140, result has 60.7 percent of original size [2022-07-13 15:03:18,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 33 case distinctions, treesize of input 221 treesize of output 387 [2022-07-13 15:03:18,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:03:18,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:03:18,667 INFO L356 Elim1Store]: treesize reduction 92, result has 58.2 percent of original size [2022-07-13 15:03:18,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 33 case distinctions, treesize of input 398 treesize of output 393 [2022-07-13 15:04:09,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:04:09,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:04:09,282 INFO L356 Elim1Store]: treesize reduction 158, result has 27.5 percent of original size [2022-07-13 15:04:09,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 561 treesize of output 499 [2022-07-13 15:04:09,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:04:09,299 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:04:09,354 INFO L356 Elim1Store]: treesize reduction 178, result has 25.2 percent of original size [2022-07-13 15:04:09,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 485 treesize of output 424 [2022-07-13 15:05:26,535 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-07-13 15:05:26,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 171 treesize of output 152 [2022-07-13 15:05:26,540 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-13 15:05:26,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 108 [2022-07-13 15:05:26,542 INFO L390 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 0 case distinctions, treesize of input 111 treesize of output 101 [2022-07-13 15:05:26,544 INFO L390 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 0 case distinctions, treesize of input 92 treesize of output 86 [2022-07-13 15:05:26,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-13 15:05:26,773 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:05:26,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-07-13 15:05:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:05:26,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:05:26,845 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2400 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2400) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2399 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2399) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) is different from false [2022-07-13 15:05:27,214 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2395 Int) (v_ArrVal_2397 Int) (|v_ULTIMATE.start_main_~item~0#1.base_47| Int)) (or (and (forall ((v_ArrVal_2399 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2395)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2397)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2399) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2400 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2397)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2400)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) (and (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2395)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2397)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)))) is different from false [2022-07-13 15:05:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-13 15:05:27,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216792246] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:05:27,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:05:27,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2022-07-13 15:05:27,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483097702] [2022-07-13 15:05:27,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:05:27,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 15:05:27,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:05:27,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 15:05:27,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=462, Unknown=4, NotChecked=90, Total=650 [2022-07-13 15:05:27,270 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:05:29,377 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse13 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse16 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse14 (select .cse15 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse0 (not (= .cse14 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (.cse2 (= (select .cse13 .cse16) 0)) (.cse3 (= (select .cse15 .cse16) 0)) (.cse1 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (and .cse0 (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse1 4) (= (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1) .cse2 (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) .cse3 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse1) 0) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2397 Int) (|v_ULTIMATE.start_main_~item~0#1.base_47| Int)) (or (and (forall ((v_ArrVal_2399 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2395)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2397)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2399) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2400 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2397)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2400)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) (and (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2395)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2397)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)))) (= |c_ULTIMATE.start_main_~item~0#1.base| 0) (not (= |c_ULTIMATE.start_main_~bcki~0#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (let ((.cse12 (select |c_#memory_$Pointer$.offset| .cse14)) (.cse10 (select |c_#memory_$Pointer$.base| .cse14))) (let ((.cse8 (select .cse10 0)) (.cse9 (= (select .cse13 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (.cse11 (= (select .cse12 0) 0))) (or (exists ((v_arrayElimCell_197 Int)) (let ((.cse7 (select |c_#memory_$Pointer$.base| v_arrayElimCell_197))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_197)) (.cse6 (select .cse7 0))) (and (= (select .cse5 0) 0) (= .cse6 |c_ULTIMATE.start_main_~bucket~0#1.base|) (= (select .cse5 4) 0) (= (select (select |c_#memory_$Pointer$.base| .cse6) 0) 0) (not (= v_arrayElimCell_197 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 0) 0) (= (select .cse7 4) 0))))) (and .cse0 (= 0 (select (select |c_#memory_$Pointer$.base| .cse8) 0)) .cse9 .cse2 (= (select .cse10 4) 0) .cse11 (= (select (select |c_#memory_$Pointer$.offset| .cse8) 0) 0) .cse3 (= (select .cse12 4) 0)) (and .cse0 (= .cse8 0) .cse9 .cse2 .cse11 .cse3)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse1) 0))))) is different from false [2022-07-13 15:05:31,384 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse15 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse13 (select .cse14 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse0 (not (= .cse13 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (.cse1 (= (select .cse12 .cse15) 0)) (.cse2 (= (select .cse14 .cse15) 0))) (and .cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1) .cse1 (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) .cse2 (forall ((v_ArrVal_2395 Int) (v_ArrVal_2397 Int) (|v_ULTIMATE.start_main_~item~0#1.base_47| Int)) (or (and (forall ((v_ArrVal_2399 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2395)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2397)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2399) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2400 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2397)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2400)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) (and (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2395)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2397)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)))) (let ((.cse11 (select |c_#memory_$Pointer$.offset| .cse13)) (.cse9 (select |c_#memory_$Pointer$.base| .cse13))) (let ((.cse7 (select .cse9 0)) (.cse8 (= (select .cse12 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (.cse10 (= (select .cse11 0) 0))) (or (exists ((v_arrayElimCell_197 Int)) (let ((.cse6 (select |c_#memory_$Pointer$.base| v_arrayElimCell_197))) (let ((.cse4 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_197)) (.cse5 (select .cse6 0))) (and (= (select .cse4 0) 0) (= .cse5 |c_ULTIMATE.start_main_~bucket~0#1.base|) (= (select .cse4 4) 0) (= (select (select |c_#memory_$Pointer$.base| .cse5) 0) 0) (not (= v_arrayElimCell_197 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse5) 0) 0) (= (select .cse6 4) 0))))) (and .cse0 (= 0 (select (select |c_#memory_$Pointer$.base| .cse7) 0)) .cse8 .cse1 (= (select .cse9 4) 0) .cse10 (= (select (select |c_#memory_$Pointer$.offset| .cse7) 0) 0) .cse2 (= (select .cse11 4) 0)) (and .cse0 (= .cse7 0) .cse8 .cse1 .cse10 .cse2)))))))) is different from false [2022-07-13 15:05:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:05:31,905 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2022-07-13 15:05:31,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 15:05:31,906 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-13 15:05:31,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:05:31,906 INFO L225 Difference]: With dead ends: 125 [2022-07-13 15:05:31,906 INFO L226 Difference]: Without dead ends: 114 [2022-07-13 15:05:31,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=176, Invalid=826, Unknown=6, NotChecked=252, Total=1260 [2022-07-13 15:05:31,907 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 66 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:05:31,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 383 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 129 Invalid, 0 Unknown, 244 Unchecked, 0.2s Time] [2022-07-13 15:05:31,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-13 15:05:31,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 99. [2022-07-13 15:05:31,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 98 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:05:31,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 119 transitions. [2022-07-13 15:05:31,915 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 119 transitions. Word has length 27 [2022-07-13 15:05:31,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:05:31,915 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 119 transitions. [2022-07-13 15:05:31,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:05:31,916 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 119 transitions. [2022-07-13 15:05:31,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 15:05:31,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:05:31,916 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:05:31,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-13 15:05:32,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 15:05:32,119 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:05:32,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:05:32,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1921519731, now seen corresponding path program 1 times [2022-07-13 15:05:32,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:05:32,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28575185] [2022-07-13 15:05:32,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:05:32,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:05:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:05:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:05:32,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:05:32,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28575185] [2022-07-13 15:05:32,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28575185] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:05:32,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814331169] [2022-07-13 15:05:32,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:05:32,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:05:32,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:05:32,423 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:05:32,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 15:05:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:05:32,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-13 15:05:32,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:05:32,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:32,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-07-13 15:05:32,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:32,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-07-13 15:05:32,634 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-07-13 15:05:32,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 62 [2022-07-13 15:05:32,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:32,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:32,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:32,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-13 15:05:32,643 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:05:32,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2022-07-13 15:05:32,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:32,674 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-13 15:05:32,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-07-13 15:05:32,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:32,686 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-13 15:05:32,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 35 [2022-07-13 15:05:32,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:32,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:05:32,738 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-13 15:05:32,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 49 [2022-07-13 15:05:32,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:32,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:05:32,749 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-13 15:05:32,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 44 [2022-07-13 15:05:33,384 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-13 15:05:33,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 57 [2022-07-13 15:05:33,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:33,394 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:05:33,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 45 [2022-07-13 15:05:33,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-13 15:05:33,474 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:05:33,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-07-13 15:05:33,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:05:33,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:05:33,549 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2613 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2613) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)))) (forall ((v_ArrVal_2612 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2612) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) is different from false [2022-07-13 15:05:33,886 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2609 Int) (v_ArrVal_2610 Int)) (or (and (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2609)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2610)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2613 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2609)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2610)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2613) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2612 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2610)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2612)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) is different from false [2022-07-13 15:05:33,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-13 15:05:33,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814331169] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:05:33,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:05:33,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 27 [2022-07-13 15:05:33,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229058454] [2022-07-13 15:05:33,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:05:33,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 15:05:33,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:05:33,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 15:05:33,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=508, Unknown=3, NotChecked=94, Total=702 [2022-07-13 15:05:33,935 INFO L87 Difference]: Start difference. First operand 99 states and 119 transitions. Second operand has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:05:34,073 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse0 (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (and (not (= .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2609 Int) (v_ArrVal_2610 Int)) (or (and (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2609)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2610)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2613 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2609)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2610)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2613) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2612 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2610)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2612)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) (= |c_ULTIMATE.start_main_~bcki~0#1.offset| 0) (= (select .cse1 .cse3) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.offset|) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select .cse4 .cse3) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse5) 0) (= |c_ULTIMATE.start_main_~item~0#1.base| 0) (not (= .cse0 0)) (not (= |c_ULTIMATE.start_main_~bcki~0#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse5) 0)))) is different from false [2022-07-13 15:05:34,190 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse0 (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2609 Int) (v_ArrVal_2610 Int)) (or (and (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2609)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2610)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2613 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2609)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2610)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2613) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2612 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2610)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2612)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) (= (select .cse1 .cse3) 0) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= (select .cse4 .cse3) 0) (not (= .cse0 0))))) is different from false [2022-07-13 15:05:34,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:05:34,602 INFO L93 Difference]: Finished difference Result 147 states and 177 transitions. [2022-07-13 15:05:34,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 15:05:34,602 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-13 15:05:34,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:05:34,603 INFO L225 Difference]: With dead ends: 147 [2022-07-13 15:05:34,603 INFO L226 Difference]: Without dead ends: 136 [2022-07-13 15:05:34,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=200, Invalid=933, Unknown=5, NotChecked=268, Total=1406 [2022-07-13 15:05:34,604 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 81 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:05:34,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 397 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 189 Invalid, 0 Unknown, 265 Unchecked, 0.1s Time] [2022-07-13 15:05:34,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-13 15:05:34,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 117. [2022-07-13 15:05:34,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 115 states have (on average 1.2521739130434784) internal successors, (144), 116 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:05:34,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2022-07-13 15:05:34,610 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 144 transitions. Word has length 27 [2022-07-13 15:05:34,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:05:34,610 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 144 transitions. [2022-07-13 15:05:34,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:05:34,611 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 144 transitions. [2022-07-13 15:05:34,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 15:05:34,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:05:34,611 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:05:34,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 15:05:34,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-13 15:05:34,827 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:05:34,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:05:34,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1308386699, now seen corresponding path program 1 times [2022-07-13 15:05:34,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:05:34,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933445241] [2022-07-13 15:05:34,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:05:34,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:05:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:05:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:05:34,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:05:34,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933445241] [2022-07-13 15:05:34,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933445241] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:05:34,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:05:34,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:05:34,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699207835] [2022-07-13 15:05:34,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:05:34,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:05:34,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:05:34,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:05:34,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:05:34,906 INFO L87 Difference]: Start difference. First operand 117 states and 144 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:05:35,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:05:35,029 INFO L93 Difference]: Finished difference Result 162 states and 200 transitions. [2022-07-13 15:05:35,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:05:35,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-13 15:05:35,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:05:35,030 INFO L225 Difference]: With dead ends: 162 [2022-07-13 15:05:35,030 INFO L226 Difference]: Without dead ends: 127 [2022-07-13 15:05:35,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 15:05:35,031 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 46 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:05:35,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 105 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:05:35,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-13 15:05:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2022-07-13 15:05:35,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 115 states have (on average 1.2434782608695651) internal successors, (143), 116 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:05:35,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2022-07-13 15:05:35,037 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 27 [2022-07-13 15:05:35,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:05:35,037 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2022-07-13 15:05:35,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:05:35,037 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2022-07-13 15:05:35,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 15:05:35,038 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:05:35,038 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:05:35,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 15:05:35,038 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:05:35,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:05:35,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1764820376, now seen corresponding path program 2 times [2022-07-13 15:05:35,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:05:35,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103869314] [2022-07-13 15:05:35,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:05:35,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:05:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:05:35,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:05:35,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:05:35,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103869314] [2022-07-13 15:05:35,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103869314] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:05:35,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871912091] [2022-07-13 15:05:35,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:05:35,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:05:35,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:05:35,217 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:05:35,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 15:05:35,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:05:35,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:05:35,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-13 15:05:35,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:05:35,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:35,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:35,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:35,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2022-07-13 15:05:35,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:35,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-07-13 15:05:35,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:35,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-07-13 15:05:35,595 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-13 15:05:35,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 34 [2022-07-13 15:05:35,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2022-07-13 15:05:35,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 15:05:35,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 15:05:35,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2022-07-13 15:05:35,658 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 15:05:35,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-13 15:05:35,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 15:05:35,676 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 15:05:35,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-13 15:05:35,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 15:05:35,701 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-13 15:05:35,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-07-13 15:05:35,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 15:05:35,745 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:05:35,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 15:05:35,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-13 15:05:35,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 15:05:35,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 15:05:35,931 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:05:35,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 45 [2022-07-13 15:05:36,049 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-07-13 15:05:36,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-13 15:05:36,058 INFO L356 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2022-07-13 15:05:36,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 25 [2022-07-13 15:05:36,174 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-13 15:05:36,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2022-07-13 15:05:36,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 15:05:36,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 15:05:36,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:05:36,512 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_2930 (Array Int Int)) (|ULTIMATE.start_main_~bcki~0#1.base| Int) (v_ArrVal_2929 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2930))) (let ((.cse2 (select .cse1 |ULTIMATE.start_main_~bcki~0#1.base|)) (.cse3 (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (and (forall ((v_ArrVal_2933 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2929))) (store .cse0 |ULTIMATE.start_main_~bcki~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~bcki~0#1.base|) (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_2933))) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (= (select (select (store .cse1 |ULTIMATE.start_main_~bcki~0#1.base| (store .cse2 .cse3 |c_ULTIMATE.start_main_~item~0#1.offset|)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (not (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) 2)) |ULTIMATE.start_main_~bcki~0#1.base|) (+ 8 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (not (= (select .cse2 .cse3) 0)))))) is different from false [2022-07-13 15:05:36,555 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:05:36,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-13 15:05:37,018 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-13 15:05:37,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 1 [2022-07-13 15:05:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 15:05:37,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871912091] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:05:37,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:05:37,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-07-13 15:05:37,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6224162] [2022-07-13 15:05:37,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:05:37,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-13 15:05:37,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:05:37,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 15:05:37,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=474, Unknown=2, NotChecked=44, Total=600 [2022-07-13 15:05:37,021 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:05:37,183 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse7 (select .cse6 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select .cse0 .cse1) 0) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_2930 (Array Int Int)) (|ULTIMATE.start_main_~bcki~0#1.base| Int) (v_ArrVal_2929 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2930))) (let ((.cse4 (select .cse3 |ULTIMATE.start_main_~bcki~0#1.base|)) (.cse5 (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (and (forall ((v_ArrVal_2933 Int)) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2929))) (store .cse2 |ULTIMATE.start_main_~bcki~0#1.base| (store (select .cse2 |ULTIMATE.start_main_~bcki~0#1.base|) (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_2933))) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (= (select (select (store .cse3 |ULTIMATE.start_main_~bcki~0#1.base| (store .cse4 .cse5 |c_ULTIMATE.start_main_~item~0#1.offset|)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (not (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) 2)) |ULTIMATE.start_main_~bcki~0#1.base|) (+ 8 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (not (= (select .cse4 .cse5) 0)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 0) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select .cse6 .cse1) 0) (not (= .cse7 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= (select (select |c_#memory_$Pointer$.base| .cse7) 0) |c_ULTIMATE.start_main_~bucket~0#1.base|))))) is different from false [2022-07-13 15:05:52,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:05:52,700 INFO L93 Difference]: Finished difference Result 150 states and 183 transitions. [2022-07-13 15:05:52,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 15:05:52,700 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-13 15:05:52,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:05:52,701 INFO L225 Difference]: With dead ends: 150 [2022-07-13 15:05:52,701 INFO L226 Difference]: Without dead ends: 139 [2022-07-13 15:05:52,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=274, Invalid=1211, Unknown=5, NotChecked=150, Total=1640 [2022-07-13 15:05:52,702 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 66 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 217 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:05:52,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 323 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 150 Invalid, 0 Unknown, 217 Unchecked, 0.2s Time] [2022-07-13 15:05:52,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-13 15:05:52,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 115. [2022-07-13 15:05:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 113 states have (on average 1.247787610619469) internal successors, (141), 114 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:05:52,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2022-07-13 15:05:52,707 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 29 [2022-07-13 15:05:52,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:05:52,708 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2022-07-13 15:05:52,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:05:52,708 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2022-07-13 15:05:52,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 15:05:52,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:05:52,708 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:05:52,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 15:05:52,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 15:05:52,923 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:05:52,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:05:52,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1842471721, now seen corresponding path program 1 times [2022-07-13 15:05:52,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:05:52,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290442388] [2022-07-13 15:05:52,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:05:52,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:05:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:05:52,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:05:52,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:05:52,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290442388] [2022-07-13 15:05:52,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290442388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:05:52,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:05:52,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:05:52,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966936781] [2022-07-13 15:05:52,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:05:52,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:05:52,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:05:52,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:05:52,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:05:52,992 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:05:53,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:05:53,152 INFO L93 Difference]: Finished difference Result 150 states and 186 transitions. [2022-07-13 15:05:53,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:05:53,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-13 15:05:53,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:05:53,153 INFO L225 Difference]: With dead ends: 150 [2022-07-13 15:05:53,153 INFO L226 Difference]: Without dead ends: 139 [2022-07-13 15:05:53,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-13 15:05:53,153 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 49 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:05:53,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 107 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:05:53,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-13 15:05:53,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 126. [2022-07-13 15:05:53,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 124 states have (on average 1.2419354838709677) internal successors, (154), 125 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:05:53,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2022-07-13 15:05:53,160 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 29 [2022-07-13 15:05:53,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:05:53,160 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2022-07-13 15:05:53,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:05:53,160 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2022-07-13 15:05:53,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 15:05:53,161 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:05:53,161 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:05:53,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 15:05:53,161 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:05:53,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:05:53,161 INFO L85 PathProgramCache]: Analyzing trace with hash -461850395, now seen corresponding path program 1 times [2022-07-13 15:05:53,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:05:53,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222311702] [2022-07-13 15:05:53,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:05:53,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:05:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:05:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:05:53,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:05:53,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222311702] [2022-07-13 15:05:53,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222311702] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:05:53,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060557547] [2022-07-13 15:05:53,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:05:53,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:05:53,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:05:53,321 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:05:53,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 15:05:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:05:53,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-13 15:05:53,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:05:53,545 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-13 15:05:53,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 34 [2022-07-13 15:05:53,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:05:53,559 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:05:53,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 15:05:53,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:05:53,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:53,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-13 15:05:53,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:53,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-13 15:05:53,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-13 15:05:53,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-07-13 15:05:53,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-13 15:05:53,757 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:05:53,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2022-07-13 15:05:53,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:05:53,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-07-13 15:05:53,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 15:05:53,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 15:05:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:05:53,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:05:53,819 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3239 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_3239) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse0))) 0)) (forall ((v_ArrVal_3240 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_3240) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse1)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse1))) 0))) is different from false [2022-07-13 15:05:53,824 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3239 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_3239) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0))) 0)) (forall ((v_ArrVal_3240 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_3240) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1))) 0))) is different from false [2022-07-13 15:05:53,836 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3239 (Array Int Int))) (= (let ((.cse2 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse2 |c_ULTIMATE.start_main_~item~0#1.base|)))) (select (store .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_3239) (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse2 |c_ULTIMATE.start_main_~item~0#1.offset|)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1))) 0)) (forall ((v_ArrVal_3240 (Array Int Int))) (= (let ((.cse4 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse4 |c_ULTIMATE.start_main_~item~0#1.offset|))) (.cse5 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (select (select (store .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_3240) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse4 |c_ULTIMATE.start_main_~item~0#1.base|)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse5)) (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse5)))) 0))) is different from false [2022-07-13 15:05:53,893 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3240 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_3240) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (forall ((v_ArrVal_3239 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_3239) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) is different from false [2022-07-13 15:05:53,898 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3239 (Array Int Int)) (v_ArrVal_3231 Int)) (= (select (select (store (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| 4) v_ArrVal_3231)) |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_3239) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (forall ((v_ArrVal_3240 (Array Int Int)) (v_ArrVal_3233 Int)) (= (select (select (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| 4) v_ArrVal_3233)) |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_3240) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) is different from false [2022-07-13 15:05:53,909 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:05:53,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 27 [2022-07-13 15:05:53,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-13 15:05:53,916 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-13 15:05:53,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 1 [2022-07-13 15:05:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-13 15:05:53,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060557547] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:05:53,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:05:53,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2022-07-13 15:05:53,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602001852] [2022-07-13 15:05:53,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:05:53,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 15:05:53,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:05:53,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 15:05:53,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=227, Unknown=5, NotChecked=170, Total=462 [2022-07-13 15:05:53,933 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:05:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:05:54,496 INFO L93 Difference]: Finished difference Result 230 states and 278 transitions. [2022-07-13 15:05:54,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 15:05:54,496 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-13 15:05:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:05:54,497 INFO L225 Difference]: With dead ends: 230 [2022-07-13 15:05:54,497 INFO L226 Difference]: Without dead ends: 219 [2022-07-13 15:05:54,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=634, Unknown=5, NotChecked=290, Total=1122 [2022-07-13 15:05:54,498 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 238 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 546 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:05:54,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 386 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 384 Invalid, 0 Unknown, 546 Unchecked, 0.3s Time] [2022-07-13 15:05:54,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-13 15:05:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 172. [2022-07-13 15:05:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 170 states have (on average 1.2588235294117647) internal successors, (214), 171 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:05:54,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 214 transitions. [2022-07-13 15:05:54,507 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 214 transitions. Word has length 29 [2022-07-13 15:05:54,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:05:54,507 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 214 transitions. [2022-07-13 15:05:54,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:05:54,507 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 214 transitions. [2022-07-13 15:05:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 15:05:54,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:05:54,507 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:05:54,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-13 15:05:54,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-07-13 15:05:54,708 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:05:54,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:05:54,708 INFO L85 PathProgramCache]: Analyzing trace with hash -993211820, now seen corresponding path program 1 times [2022-07-13 15:05:54,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:05:54,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263274437] [2022-07-13 15:05:54,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:05:54,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:05:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:05:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:05:54,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:05:54,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263274437] [2022-07-13 15:05:54,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263274437] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:05:54,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810217380] [2022-07-13 15:05:54,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:05:54,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:05:54,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:05:54,839 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:05:54,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 15:05:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:05:55,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 123 conjunts are in the unsatisfiable core [2022-07-13 15:05:55,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:05:55,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2022-07-13 15:05:55,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-07-13 15:05:55,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2022-07-13 15:05:55,098 INFO L356 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-07-13 15:05:55,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 99 [2022-07-13 15:05:55,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-07-13 15:05:55,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-07-13 15:05:55,131 INFO L356 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-07-13 15:05:55,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 46 [2022-07-13 15:05:55,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-13 15:05:55,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-13 15:05:55,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:05:55,215 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-13 15:05:55,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 74 [2022-07-13 15:05:55,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-07-13 15:05:55,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,231 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-13 15:05:55,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-13 15:05:55,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 15:05:55,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-13 15:05:55,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,330 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:05:55,330 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:05:55,338 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-07-13 15:05:55,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 99 treesize of output 85 [2022-07-13 15:05:55,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 70 [2022-07-13 15:05:55,577 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:05:55,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-07-13 15:05:55,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:55,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:56,023 INFO L356 Elim1Store]: treesize reduction 182, result has 29.7 percent of original size [2022-07-13 15:05:56,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 74 treesize of output 107 [2022-07-13 15:05:56,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:05:56,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:05:56,084 INFO L356 Elim1Store]: treesize reduction 126, result has 35.7 percent of original size [2022-07-13 15:05:56,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 128 treesize of output 134 [2022-07-13 15:05:57,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 79 [2022-07-13 15:05:57,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 59 [2022-07-13 15:05:57,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:05:57,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:05:59,788 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3479 Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base|) |c_ULTIMATE.start_main_~itr~0#1.offset| v_ArrVal_3479)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3480 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base|) |c_ULTIMATE.start_main_~itr~0#1.offset| v_ArrVal_3480)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) is different from false [2022-07-13 15:06:01,809 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~itr~0#1.offset_33| Int)) (or (not (<= |v_ULTIMATE.start_main_~itr~0#1.offset_33| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4)))) (and (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3479 Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base|) |v_ULTIMATE.start_main_~itr~0#1.offset_33| v_ArrVal_3479)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3480 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base|) |v_ULTIMATE.start_main_~itr~0#1.offset_33| v_ArrVal_3480)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) is different from false [2022-07-13 15:06:10,532 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:06:10,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-07-13 15:06:12,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:06:12,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810217380] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:06:12,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:06:12,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 29 [2022-07-13 15:06:12,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044919589] [2022-07-13 15:06:12,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:06:12,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-13 15:06:12,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:06:12,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-13 15:06:12,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=602, Unknown=2, NotChecked=102, Total=812 [2022-07-13 15:06:12,988 INFO L87 Difference]: Start difference. First operand 172 states and 214 transitions. Second operand has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 29 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:06:15,188 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse17 (select .cse15 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse17))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~bcki~0#1.offset| 0)) (.cse2 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse5 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) (.cse4 (select |c_#memory_$Pointer$.offset| .cse17)) (.cse24 (select .cse3 0)) (.cse16 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (and (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1) .cse1 (= (select .cse0 .cse2) 0) (or (forall ((|v_ULTIMATE.start_main_~itr~0#1.offset_33| Int)) (or (not (<= |v_ULTIMATE.start_main_~itr~0#1.offset_33| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4)))) (and (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3479 Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base|) |v_ULTIMATE.start_main_~itr~0#1.offset_33| v_ArrVal_3479)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3480 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base|) |v_ULTIMATE.start_main_~itr~0#1.offset_33| v_ArrVal_3480)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) (and .cse1 (= |c_ULTIMATE.start_main_~bcki~0#1.base| 0))) (= (select .cse3 4) 0) (= (select .cse4 0) 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse5) 0) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (exists ((v_arrayElimIndex_53 Int) (|ULTIMATE.start_main_~item~0#1.base| Int)) (let ((.cse14 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_53)) (.cse13 (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_53))) (and (let ((.cse12 (select .cse14 0))) (let ((.cse9 (= (select .cse13 0) 0)) (.cse6 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (.cse10 (not (= .cse12 v_arrayElimIndex_53))) (.cse7 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_arrayElimIndex_53)) (.cse11 (not (= .cse12 |c_ULTIMATE.start_main_~bucket~0#1.base|)))) (or (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) 0) 0) (let ((.cse8 (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) 0) 0))) (or (and .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse8)))) (and .cse9 .cse6 .cse10 .cse7 .cse11)))) (not (= |ULTIMATE.start_main_~item~0#1.base| v_arrayElimIndex_53)) (not (= v_arrayElimIndex_53 0)) (= (select .cse14 4) 0) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| v_arrayElimIndex_53)) (not (= |ULTIMATE.start_main_~item~0#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select .cse13 4) 0)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select .cse15 .cse2) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse16) 0) (= (select |c_#valid| .cse17) 1) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) 1)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse5) 1) (forall ((|v_ULTIMATE.start_main_~itr~0#1.offset_33| Int) (v_ArrVal_3477 Int) (v_ArrVal_3473 Int)) (let ((.cse23 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (let ((.cse22 (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|) .cse23 v_ArrVal_3477)))) (let ((.cse18 (select (select (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|) .cse23 v_ArrVal_3473)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse19 (select (select .cse22 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (and (= .cse18 0) (= .cse19 0)) (and (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3480 Int)) (= (select (select (let ((.cse20 (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| 4) v_ArrVal_3477)))) (store .cse20 |ULTIMATE.start_main_~itr~0#1.base| (store (select .cse20 |ULTIMATE.start_main_~itr~0#1.base|) |v_ULTIMATE.start_main_~itr~0#1.offset_33| v_ArrVal_3480))) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3479 Int)) (= 0 (select (select (let ((.cse21 (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| 4) v_ArrVal_3473)))) (store .cse21 |ULTIMATE.start_main_~itr~0#1.base| (store (select .cse21 |ULTIMATE.start_main_~itr~0#1.base|) |v_ULTIMATE.start_main_~itr~0#1.offset_33| v_ArrVal_3479))) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))))) (not (<= |v_ULTIMATE.start_main_~itr~0#1.offset_33| (select (select .cse22 .cse18) (+ .cse19 4)))))))))) (not (= .cse17 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse24 .cse17)) (= (select .cse4 4) 0) (= |c_ULTIMATE.start_main_~item~0#1.base| 0) (not (= .cse24 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse16) 0)))))) is different from false [2022-07-13 15:06:17,528 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse7)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse8 (select .cse3 0)) (.cse6 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~bcki~0#1.offset| .cse0) (forall ((|v_ULTIMATE.start_main_~itr~0#1.offset_33| Int)) (or (not (<= |v_ULTIMATE.start_main_~itr~0#1.offset_33| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4)))) (and (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3479 Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base|) |v_ULTIMATE.start_main_~itr~0#1.offset_33| v_ArrVal_3479)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3480 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base|) |v_ULTIMATE.start_main_~itr~0#1.offset_33| v_ArrVal_3480)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse0 0) (= |c_ULTIMATE.start_main_~bcki~0#1.offset| 0) (= (select .cse1 .cse2) 0) (= (select .cse3 4) 0) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= (select .cse5 .cse2) 0) (not (= |c_ULTIMATE.start_main_~bcki~0#1.base| 0)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse6) 0) (= |c_ULTIMATE.start_main_~bcki~0#1.base| .cse7) (not (= .cse8 .cse7)) (exists ((|ULTIMATE.start_main_~item~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= |ULTIMATE.start_main_~item~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) 0) 0))) (= (select .cse4 4) 0) (not (= .cse8 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse6) 0)))))) is different from false [2022-07-13 15:06:19,540 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse6)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$.offset| .cse6)) (.cse7 (select .cse3 0))) (and (= |c_ULTIMATE.start_main_~bcki~0#1.offset| .cse0) (forall ((|v_ULTIMATE.start_main_~itr~0#1.offset_33| Int)) (or (not (<= |v_ULTIMATE.start_main_~itr~0#1.offset_33| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4)))) (and (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3479 Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base|) |v_ULTIMATE.start_main_~itr~0#1.offset_33| v_ArrVal_3479)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3480 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base|) |v_ULTIMATE.start_main_~itr~0#1.offset_33| v_ArrVal_3480)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse0 0) (= |c_ULTIMATE.start_main_~bcki~0#1.offset| 0) (= (select .cse1 .cse2) 0) (= |c_ULTIMATE.start_main_#t~mem13#1.offset| 0) (= (select .cse3 4) 0) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= (select .cse5 .cse2) 0) (not (= |c_ULTIMATE.start_main_~bcki~0#1.base| 0)) (= |c_ULTIMATE.start_main_~bcki~0#1.base| .cse6) (= |c_ULTIMATE.start_main_#t~mem13#1.base| 0) (not (= .cse7 .cse6)) (exists ((|ULTIMATE.start_main_~item~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= |ULTIMATE.start_main_~item~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) 0) 0))) (= (select .cse4 4) 0) (not (= .cse7 |c_ULTIMATE.start_main_~bucket~0#1.base|))))))) is different from false [2022-07-13 15:06:19,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:06:19,631 INFO L93 Difference]: Finished difference Result 272 states and 340 transitions. [2022-07-13 15:06:19,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 15:06:19,631 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 29 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-13 15:06:19,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:06:19,632 INFO L225 Difference]: With dead ends: 272 [2022-07-13 15:06:19,632 INFO L226 Difference]: Without dead ends: 182 [2022-07-13 15:06:19,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=202, Invalid=1003, Unknown=5, NotChecked=350, Total=1560 [2022-07-13 15:06:19,633 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 63 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 299 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:06:19,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 445 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 244 Invalid, 0 Unknown, 299 Unchecked, 0.3s Time] [2022-07-13 15:06:19,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-13 15:06:19,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2022-07-13 15:06:19,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 179 states have (on average 1.2458100558659218) internal successors, (223), 180 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:06:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 223 transitions. [2022-07-13 15:06:19,641 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 223 transitions. Word has length 30 [2022-07-13 15:06:19,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:06:19,642 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 223 transitions. [2022-07-13 15:06:19,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 29 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:06:19,642 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 223 transitions. [2022-07-13 15:06:19,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 15:06:19,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:06:19,642 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:06:19,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-13 15:06:19,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:06:19,855 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:06:19,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:06:19,856 INFO L85 PathProgramCache]: Analyzing trace with hash -217147576, now seen corresponding path program 1 times [2022-07-13 15:06:19,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:06:19,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102651162] [2022-07-13 15:06:19,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:06:19,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:06:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:06:20,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:06:20,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:06:20,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102651162] [2022-07-13 15:06:20,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102651162] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:06:20,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561136812] [2022-07-13 15:06:20,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:06:20,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:06:20,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:06:20,261 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:06:20,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 15:06:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:06:20,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 137 conjunts are in the unsatisfiable core [2022-07-13 15:06:20,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:06:20,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:20,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:20,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:20,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2022-07-13 15:06:20,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:20,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-07-13 15:06:20,528 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-07-13 15:06:20,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 99 [2022-07-13 15:06:20,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:20,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2022-07-13 15:06:20,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:20,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:20,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:20,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-07-13 15:06:20,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:20,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:20,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:20,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-07-13 15:06:20,564 INFO L356 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-07-13 15:06:20,564 INFO L390 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 4 case distinctions, treesize of input 51 treesize of output 46 [2022-07-13 15:06:20,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-13 15:06:20,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:20,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2022-07-13 15:06:20,643 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-13 15:06:20,643 INFO L390 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 20 treesize of output 22 [2022-07-13 15:06:20,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:20,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-07-13 15:06:20,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 15:06:20,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-13 15:06:20,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:20,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2022-07-13 15:06:20,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:20,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:20,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 70 [2022-07-13 15:06:21,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:21,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 103 [2022-07-13 15:06:21,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:21,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:21,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:06:21,420 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:06:21,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 74 [2022-07-13 15:06:21,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:21,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:06:21,449 INFO L356 Elim1Store]: treesize reduction 197, result has 15.1 percent of original size [2022-07-13 15:06:21,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 198 treesize of output 168 [2022-07-13 15:06:21,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:21,602 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:06:21,609 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-13 15:06:21,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 87 [2022-07-13 15:06:21,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:21,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:21,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 69 [2022-07-13 15:06:21,625 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:06:21,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 55 [2022-07-13 15:06:21,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 15:06:25,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:25,914 INFO L390 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 48 treesize of output 42 [2022-07-13 15:06:25,925 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-13 15:06:25,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 22 [2022-07-13 15:06:25,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:25,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:06:25,941 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-07-13 15:06:25,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 49 [2022-07-13 15:06:26,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-07-13 15:06:26,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:06:26,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:06:27,617 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:06:27,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1366 treesize of output 1348 [2022-07-13 15:06:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:06:33,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561136812] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:06:33,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:06:33,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 44 [2022-07-13 15:06:33,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561344470] [2022-07-13 15:06:33,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:06:33,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-13 15:06:33,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:06:33,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-13 15:06:33,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1683, Unknown=7, NotChecked=0, Total=1892 [2022-07-13 15:06:33,014 INFO L87 Difference]: Start difference. First operand 181 states and 223 transitions. Second operand has 44 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 44 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:06:33,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:06:33,444 INFO L93 Difference]: Finished difference Result 201 states and 246 transitions. [2022-07-13 15:06:33,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 15:06:33,444 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 44 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-13 15:06:33,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:06:33,445 INFO L225 Difference]: With dead ends: 201 [2022-07-13 15:06:33,445 INFO L226 Difference]: Without dead ends: 199 [2022-07-13 15:06:33,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=238, Invalid=1917, Unknown=7, NotChecked=0, Total=2162 [2022-07-13 15:06:33,446 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 52 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 478 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:06:33,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 527 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 209 Invalid, 0 Unknown, 478 Unchecked, 0.2s Time] [2022-07-13 15:06:33,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-13 15:06:33,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 193. [2022-07-13 15:06:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 191 states have (on average 1.2408376963350785) internal successors, (237), 192 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:06:33,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 237 transitions. [2022-07-13 15:06:33,456 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 237 transitions. Word has length 32 [2022-07-13 15:06:33,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:06:33,456 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 237 transitions. [2022-07-13 15:06:33,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 44 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:06:33,456 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 237 transitions. [2022-07-13 15:06:33,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 15:06:33,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:06:33,457 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:06:33,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-13 15:06:33,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:06:33,675 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 15:06:33,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:06:33,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1706080458, now seen corresponding path program 1 times [2022-07-13 15:06:33,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:06:33,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792245346] [2022-07-13 15:06:33,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:06:33,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:06:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:06:33,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 15:06:33,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:06:33,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792245346] [2022-07-13 15:06:33,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792245346] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:06:33,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062762903] [2022-07-13 15:06:33,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:06:33,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:06:33,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:06:33,816 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:06:33,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-13 15:06:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:06:34,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 105 conjunts are in the unsatisfiable core [2022-07-13 15:06:34,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:06:34,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:34,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-07-13 15:06:34,073 INFO L356 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-07-13 15:06:34,074 INFO L390 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 4 case distinctions, treesize of input 51 treesize of output 46 [2022-07-13 15:06:34,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:34,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 30 [2022-07-13 15:06:34,089 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-07-13 15:06:34,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 51 [2022-07-13 15:06:34,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-13 15:06:34,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:34,127 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-13 15:06:34,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-07-13 15:06:34,139 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-13 15:06:34,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-07-13 15:06:34,145 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:06:34,145 INFO L390 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 11 treesize of output 11 [2022-07-13 15:06:34,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:34,189 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:06:34,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-07-13 15:06:34,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:06:34,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:34,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:34,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:06:34,207 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-13 15:06:34,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 46 [2022-07-13 15:06:34,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:34,628 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:06:34,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 97 [2022-07-13 15:06:34,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:34,632 INFO L390 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 61 treesize of output 59 [2022-07-13 15:06:34,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:34,641 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-07-13 15:06:34,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 124 [2022-07-13 15:06:34,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:34,774 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-13 15:06:34,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 127 [2022-07-13 15:06:34,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:34,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:06:34,784 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-13 15:06:34,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 77 [2022-07-13 15:06:34,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:34,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2022-07-13 15:06:34,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:34,931 INFO L390 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 37 treesize of output 39 [2022-07-13 15:06:34,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:34,938 INFO L356 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-07-13 15:06:34,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 19 [2022-07-13 15:06:34,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:06:34,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:06:34,949 INFO L356 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2022-07-13 15:06:34,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 46 [2022-07-13 15:06:35,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-07-13 15:06:35,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:06:35,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:06:35,158 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3981 (Array Int Int)) (v_ArrVal_3985 Int) (v_ArrVal_3983 Int) (v_ArrVal_3980 Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|)) (.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_3981)) (.cse1 (select .cse4 |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse2 (select .cse0 .cse1)) (.cse7 (select .cse6 |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (= (let ((.cse5 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4)) (.cse3 (+ .cse7 4))) (select (select (store .cse0 .cse1 (store .cse2 .cse3 v_ArrVal_3985)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse4 .cse5 v_ArrVal_3983)) .cse1) .cse3)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse6 .cse5 v_ArrVal_3980)) .cse1) .cse3) 4))) (select .cse2 (+ .cse7 8))))))) is different from false [2022-07-13 15:06:35,164 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3981 (Array Int Int)) (v_ArrVal_3985 Int) (v_ArrVal_3983 Int) (v_ArrVal_3980 Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_3981)) (.cse1 (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse2 (select .cse0 .cse1)) (.cse7 (select .cse6 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (= (let ((.cse5 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse3 (+ .cse7 4))) (select (select (store .cse0 .cse1 (store .cse2 .cse3 v_ArrVal_3985)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse4 .cse5 v_ArrVal_3983)) .cse1) .cse3)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse6 .cse5 v_ArrVal_3980)) .cse1) .cse3) 4))) (select .cse2 (+ 8 .cse7))))))) is different from false [2022-07-13 15:06:35,178 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3975 Int) (v_ArrVal_3981 (Array Int Int)) (v_ArrVal_3985 Int) (v_ArrVal_3983 Int) (v_ArrVal_3980 Int)) (let ((.cse10 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse10 |c_ULTIMATE.start_main_~item~0#1.base|)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse10 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~bcki~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse10 v_ArrVal_3975)) |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_3981)) (.cse1 (select .cse5 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse2 (select .cse0 .cse1)) (.cse9 (select .cse8 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (= (let ((.cse6 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse3 (+ .cse9 4))) (select (select (store .cse0 .cse1 (store .cse2 .cse3 v_ArrVal_3985)) (select (select (store .cse4 |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse5 .cse6 v_ArrVal_3983)) .cse1) .cse3)) (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse8 .cse6 v_ArrVal_3980)) .cse1) .cse3) 4))) (select .cse2 (+ .cse9 8))))))))) is different from false [2022-07-13 15:06:35,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:06:35,850 INFO L356 Elim1Store]: treesize reduction 132, result has 55.6 percent of original size [2022-07-13 15:06:35,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 1375 treesize of output 1289 [2022-07-13 15:06:35,970 INFO L356 Elim1Store]: treesize reduction 418, result has 66.7 percent of original size [2022-07-13 15:06:35,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 9312 treesize of output 9034 [2022-07-13 15:06:36,012 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:06:36,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9682 treesize of output 8338