./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-buckets-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-buckets-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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 valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a4c2149f6fe1f453f0ff04220f5041f2227f6654d0fa84d48205415ce284fcb --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 05:50:11,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 05:50:11,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 05:50:11,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 05:50:11,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 05:50:11,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 05:50:11,931 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 05:50:11,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 05:50:11,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 05:50:11,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 05:50:11,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 05:50:11,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 05:50:11,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 05:50:11,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 05:50:11,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 05:50:11,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 05:50:11,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 05:50:11,949 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 05:50:11,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 05:50:11,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 05:50:11,957 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 05:50:11,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 05:50:11,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 05:50:11,959 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 05:50:11,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 05:50:11,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 05:50:11,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 05:50:11,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 05:50:11,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 05:50:11,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 05:50:11,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 05:50:11,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 05:50:11,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 05:50:11,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 05:50:11,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 05:50:11,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 05:50:11,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 05:50:11,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 05:50:11,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 05:50:11,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 05:50:11,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 05:50:11,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 05:50:11,974 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-07-14 05:50:11,991 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 05:50:11,992 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 05:50:11,992 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 05:50:11,992 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 05:50:11,993 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 05:50:11,993 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 05:50:11,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 05:50:11,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 05:50:11,994 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 05:50:11,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 05:50:11,994 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 05:50:11,994 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 05:50:11,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 05:50:11,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 05:50:11,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 05:50:11,995 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 05:50:11,995 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 05:50:11,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 05:50:11,995 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 05:50:11,995 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 05:50:11,995 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 05:50:11,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 05:50:11,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 05:50:11,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 05:50:11,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:11,996 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 05:50:11,996 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 05:50:11,997 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 05:50:11,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 05:50:11,997 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 valid-memcleanup) ) 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 -> 5a4c2149f6fe1f453f0ff04220f5041f2227f6654d0fa84d48205415ce284fcb [2022-07-14 05:50:12,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 05:50:12,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 05:50:12,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 05:50:12,217 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 05:50:12,217 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 05:50:12,219 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-buckets-2.i [2022-07-14 05:50:12,263 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92a5e6f53/1f4431007ad246d6b16d0fe0f417faca/FLAGbe2f166ac [2022-07-14 05:50:12,664 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 05:50:12,665 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-2.i [2022-07-14 05:50:12,676 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92a5e6f53/1f4431007ad246d6b16d0fe0f417faca/FLAGbe2f166ac [2022-07-14 05:50:12,690 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92a5e6f53/1f4431007ad246d6b16d0fe0f417faca [2022-07-14 05:50:12,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 05:50:12,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 05:50:12,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:12,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 05:50:12,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 05:50:12,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:12,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c46d417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12, skipping insertion in model container [2022-07-14 05:50:12,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:12,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 05:50:12,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 05:50:12,926 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-2.i[22663,22676] [2022-07-14 05:50:12,932 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-2.i[22734,22747] [2022-07-14 05:50:12,935 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-2.i[22862,22875] [2022-07-14 05:50:12,938 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-2.i[23275,23288] [2022-07-14 05:50:12,939 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-2.i[23364,23377] [2022-07-14 05:50:12,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:12,949 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 05:50:12,973 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-2.i[22663,22676] [2022-07-14 05:50:12,974 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-2.i[22734,22747] [2022-07-14 05:50:12,975 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-2.i[22862,22875] [2022-07-14 05:50:12,977 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-2.i[23275,23288] [2022-07-14 05:50:12,978 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-2.i[23364,23377] [2022-07-14 05:50:12,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:12,995 INFO L208 MainTranslator]: Completed translation [2022-07-14 05:50:12,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12 WrapperNode [2022-07-14 05:50:12,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:12,997 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 05:50:12,997 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 05:50:12,997 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 05:50:13,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:13,011 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:13,027 INFO L137 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 161 [2022-07-14 05:50:13,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 05:50:13,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 05:50:13,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 05:50:13,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 05:50:13,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:13,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:13,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:13,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:13,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:13,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:13,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:13,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 05:50:13,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 05:50:13,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 05:50:13,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 05:50:13,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:13,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:13,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:13,090 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-14 05:50:13,092 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-14 05:50:13,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 05:50:13,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 05:50:13,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 05:50:13,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 05:50:13,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 05:50:13,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 05:50:13,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 05:50:13,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 05:50:13,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 05:50:13,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 05:50:13,211 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 05:50:13,225 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 05:50:13,630 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 05:50:13,638 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 05:50:13,638 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2022-07-14 05:50:13,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:13 BoogieIcfgContainer [2022-07-14 05:50:13,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 05:50:13,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 05:50:13,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 05:50:13,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 05:50:13,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 05:50:12" (1/3) ... [2022-07-14 05:50:13,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd2c12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:50:13, skipping insertion in model container [2022-07-14 05:50:13,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (2/3) ... [2022-07-14 05:50:13,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd2c12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:50:13, skipping insertion in model container [2022-07-14 05:50:13,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:13" (3/3) ... [2022-07-14 05:50:13,648 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-buckets-2.i [2022-07-14 05:50:13,657 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 05:50:13,658 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2022-07-14 05:50:13,693 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 05:50:13,697 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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@46aba1db, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6625f537 [2022-07-14 05:50:13,698 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-07-14 05:50:13,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 82 states have (on average 2.2195121951219514) internal successors, (182), 154 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:13,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 05:50:13,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:13,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 05:50:13,710 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:13,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:13,714 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-14 05:50:13,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:13,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524433929] [2022-07-14 05:50:13,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:13,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:13,837 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-14 05:50:13,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:13,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524433929] [2022-07-14 05:50:13,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524433929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:13,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:13,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:13,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130307971] [2022-07-14 05:50:13,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:13,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:13,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:13,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:13,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:13,873 INFO L87 Difference]: Start difference. First operand has 155 states, 82 states have (on average 2.2195121951219514) internal successors, (182), 154 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:14,062 INFO L93 Difference]: Finished difference Result 190 states and 198 transitions. [2022-07-14 05:50:14,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:14,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-07-14 05:50:14,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:14,077 INFO L225 Difference]: With dead ends: 190 [2022-07-14 05:50:14,078 INFO L226 Difference]: Without dead ends: 186 [2022-07-14 05:50:14,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-14 05:50:14,082 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 141 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:14,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 120 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:14,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-14 05:50:14,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 149. [2022-07-14 05:50:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 81 states have (on average 1.9259259259259258) internal successors, (156), 148 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:14,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 156 transitions. [2022-07-14 05:50:14,118 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 156 transitions. Word has length 3 [2022-07-14 05:50:14,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:14,118 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 156 transitions. [2022-07-14 05:50:14,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:14,119 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2022-07-14 05:50:14,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 05:50:14,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:14,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 05:50:14,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 05:50:14,121 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:14,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:14,122 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-14 05:50:14,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:14,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542575254] [2022-07-14 05:50:14,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:14,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:14,156 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-14 05:50:14,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:14,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542575254] [2022-07-14 05:50:14,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542575254] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:14,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:14,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:14,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599012628] [2022-07-14 05:50:14,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:14,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:14,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:14,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:14,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:14,163 INFO L87 Difference]: Start difference. First operand 149 states and 156 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:14,281 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2022-07-14 05:50:14,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:14,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-07-14 05:50:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:14,283 INFO L225 Difference]: With dead ends: 185 [2022-07-14 05:50:14,284 INFO L226 Difference]: Without dead ends: 185 [2022-07-14 05:50:14,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-14 05:50:14,285 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 70 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:14,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 190 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:14,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-14 05:50:14,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 145. [2022-07-14 05:50:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 81 states have (on average 1.876543209876543) internal successors, (152), 144 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 152 transitions. [2022-07-14 05:50:14,294 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 152 transitions. Word has length 3 [2022-07-14 05:50:14,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:14,294 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 152 transitions. [2022-07-14 05:50:14,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions. [2022-07-14 05:50:14,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 05:50:14,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:14,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:14,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 05:50:14,295 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:14,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:14,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924362, now seen corresponding path program 1 times [2022-07-14 05:50:14,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:14,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69575220] [2022-07-14 05:50:14,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:14,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:14,361 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-14 05:50:14,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:14,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69575220] [2022-07-14 05:50:14,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69575220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:14,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:14,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:14,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840757599] [2022-07-14 05:50:14,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:14,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:14,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:14,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:14,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:14,366 INFO L87 Difference]: Start difference. First operand 145 states and 152 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-14 05:50:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:14,569 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2022-07-14 05:50:14,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 05:50:14,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-14 05:50:14,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:14,573 INFO L225 Difference]: With dead ends: 151 [2022-07-14 05:50:14,573 INFO L226 Difference]: Without dead ends: 151 [2022-07-14 05:50:14,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:50:14,576 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 97 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:14,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 305 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:14,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-14 05:50:14,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2022-07-14 05:50:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 90 states have (on average 1.7555555555555555) internal successors, (158), 142 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:14,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 158 transitions. [2022-07-14 05:50:14,587 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 158 transitions. Word has length 10 [2022-07-14 05:50:14,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:14,587 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 158 transitions. [2022-07-14 05:50:14,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-14 05:50:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 158 transitions. [2022-07-14 05:50:14,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 05:50:14,589 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:14,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:14,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 05:50:14,589 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:14,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:14,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924363, now seen corresponding path program 1 times [2022-07-14 05:50:14,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:14,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384061772] [2022-07-14 05:50:14,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:14,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:14,695 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-14 05:50:14,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:14,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384061772] [2022-07-14 05:50:14,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384061772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:14,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:14,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:14,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145876518] [2022-07-14 05:50:14,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:14,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:14,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:14,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:14,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:14,701 INFO L87 Difference]: Start difference. First operand 143 states and 158 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-14 05:50:14,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:14,859 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2022-07-14 05:50:14,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 05:50:14,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-14 05:50:14,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:14,860 INFO L225 Difference]: With dead ends: 139 [2022-07-14 05:50:14,860 INFO L226 Difference]: Without dead ends: 139 [2022-07-14 05:50:14,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:50:14,861 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 6 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:14,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 416 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:14,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-14 05:50:14,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-07-14 05:50:14,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 90 states have (on average 1.711111111111111) internal successors, (154), 138 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-14 05:50:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2022-07-14 05:50:14,866 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 10 [2022-07-14 05:50:14,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:14,866 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2022-07-14 05:50:14,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-14 05:50:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2022-07-14 05:50:14,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 05:50:14,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:14,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:14,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 05:50:14,867 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:14,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:14,868 INFO L85 PathProgramCache]: Analyzing trace with hash 592229104, now seen corresponding path program 1 times [2022-07-14 05:50:14,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:14,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322526766] [2022-07-14 05:50:14,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:14,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:14,945 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-14 05:50:14,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:14,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322526766] [2022-07-14 05:50:14,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322526766] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:14,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:14,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:14,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369184731] [2022-07-14 05:50:14,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:14,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:14,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:14,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:14,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:14,946 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-14 05:50:15,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:15,114 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2022-07-14 05:50:15,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:50:15,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-14 05:50:15,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:15,115 INFO L225 Difference]: With dead ends: 146 [2022-07-14 05:50:15,115 INFO L226 Difference]: Without dead ends: 146 [2022-07-14 05:50:15,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 05:50:15,116 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 94 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:15,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 297 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:15,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-14 05:50:15,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2022-07-14 05:50:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 90 states have (on average 1.7) internal successors, (153), 137 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 153 transitions. [2022-07-14 05:50:15,120 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 153 transitions. Word has length 17 [2022-07-14 05:50:15,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:15,120 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 153 transitions. [2022-07-14 05:50:15,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-14 05:50:15,121 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2022-07-14 05:50:15,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 05:50:15,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:15,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:15,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 05:50:15,121 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:15,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:15,122 INFO L85 PathProgramCache]: Analyzing trace with hash 592229105, now seen corresponding path program 1 times [2022-07-14 05:50:15,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:15,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619042888] [2022-07-14 05:50:15,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:15,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:15,185 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-14 05:50:15,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:15,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619042888] [2022-07-14 05:50:15,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619042888] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:15,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:15,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:15,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132041090] [2022-07-14 05:50:15,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:15,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:15,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:15,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:15,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:15,188 INFO L87 Difference]: Start difference. First operand 138 states and 153 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-14 05:50:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:15,321 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2022-07-14 05:50:15,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:50:15,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-14 05:50:15,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:15,322 INFO L225 Difference]: With dead ends: 138 [2022-07-14 05:50:15,322 INFO L226 Difference]: Without dead ends: 138 [2022-07-14 05:50:15,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:15,323 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 8 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:15,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 403 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:15,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-14 05:50:15,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2022-07-14 05:50:15,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 90 states have (on average 1.6666666666666667) internal successors, (150), 134 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2022-07-14 05:50:15,327 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 17 [2022-07-14 05:50:15,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:15,327 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2022-07-14 05:50:15,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-14 05:50:15,327 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2022-07-14 05:50:15,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 05:50:15,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:15,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:15,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 05:50:15,328 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:15,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:15,329 INFO L85 PathProgramCache]: Analyzing trace with hash 840457529, now seen corresponding path program 1 times [2022-07-14 05:50:15,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:15,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402871896] [2022-07-14 05:50:15,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:15,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:15,421 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-14 05:50:15,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:15,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402871896] [2022-07-14 05:50:15,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402871896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:15,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:15,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:15,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14896087] [2022-07-14 05:50:15,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:15,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:15,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:15,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:15,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:15,425 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:15,476 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2022-07-14 05:50:15,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:15,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-14 05:50:15,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:15,477 INFO L225 Difference]: With dead ends: 141 [2022-07-14 05:50:15,477 INFO L226 Difference]: Without dead ends: 141 [2022-07-14 05:50:15,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-14 05:50:15,478 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 67 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:15,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 143 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:15,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-14 05:50:15,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2022-07-14 05:50:15,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 90 states have (on average 1.6111111111111112) internal successors, (145), 129 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 145 transitions. [2022-07-14 05:50:15,481 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 145 transitions. Word has length 23 [2022-07-14 05:50:15,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:15,482 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 145 transitions. [2022-07-14 05:50:15,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,482 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2022-07-14 05:50:15,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 05:50:15,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:15,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:15,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 05:50:15,483 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:15,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:15,483 INFO L85 PathProgramCache]: Analyzing trace with hash 840457530, now seen corresponding path program 1 times [2022-07-14 05:50:15,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:15,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453192138] [2022-07-14 05:50:15,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:15,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:15,537 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-14 05:50:15,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:15,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453192138] [2022-07-14 05:50:15,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453192138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:15,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:15,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:15,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282096359] [2022-07-14 05:50:15,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:15,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:15,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:15,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:15,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:15,540 INFO L87 Difference]: Start difference. First operand 130 states and 145 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:15,589 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2022-07-14 05:50:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:15,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-14 05:50:15,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:15,592 INFO L225 Difference]: With dead ends: 136 [2022-07-14 05:50:15,592 INFO L226 Difference]: Without dead ends: 136 [2022-07-14 05:50:15,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-14 05:50:15,593 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 62 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:15,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 144 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:15,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-14 05:50:15,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2022-07-14 05:50:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 90 states have (on average 1.5555555555555556) internal successors, (140), 124 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2022-07-14 05:50:15,596 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 23 [2022-07-14 05:50:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:15,610 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2022-07-14 05:50:15,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2022-07-14 05:50:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 05:50:15,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:15,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:15,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 05:50:15,612 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:15,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:15,613 INFO L85 PathProgramCache]: Analyzing trace with hash 225913191, now seen corresponding path program 1 times [2022-07-14 05:50:15,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:15,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624795284] [2022-07-14 05:50:15,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:15,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:15,676 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-14 05:50:15,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:15,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624795284] [2022-07-14 05:50:15,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624795284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:15,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:15,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:15,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067130063] [2022-07-14 05:50:15,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:15,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:15,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:15,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:15,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:15,679 INFO L87 Difference]: Start difference. First operand 125 states and 140 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-14 05:50:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:15,805 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2022-07-14 05:50:15,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:15,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-14 05:50:15,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:15,807 INFO L225 Difference]: With dead ends: 175 [2022-07-14 05:50:15,807 INFO L226 Difference]: Without dead ends: 175 [2022-07-14 05:50:15,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:15,809 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 215 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:15,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 162 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:15,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-14 05:50:15,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2022-07-14 05:50:15,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 97 states have (on average 1.5670103092783505) internal successors, (152), 131 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 152 transitions. [2022-07-14 05:50:15,813 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 152 transitions. Word has length 25 [2022-07-14 05:50:15,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:15,815 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 152 transitions. [2022-07-14 05:50:15,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-14 05:50:15,815 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 152 transitions. [2022-07-14 05:50:15,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 05:50:15,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:15,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:15,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 05:50:15,816 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:15,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:15,817 INFO L85 PathProgramCache]: Analyzing trace with hash 225913192, now seen corresponding path program 1 times [2022-07-14 05:50:15,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:15,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087643526] [2022-07-14 05:50:15,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:15,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:15,953 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-14 05:50:15,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:15,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087643526] [2022-07-14 05:50:15,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087643526] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:15,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:15,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:50:15,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152422853] [2022-07-14 05:50:15,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:15,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:50:15,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:15,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:50:15,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:15,956 INFO L87 Difference]: Start difference. First operand 132 states and 152 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) 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-14 05:50:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:16,179 INFO L93 Difference]: Finished difference Result 226 states and 250 transitions. [2022-07-14 05:50:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 05:50:16,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) 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-14 05:50:16,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:16,182 INFO L225 Difference]: With dead ends: 226 [2022-07-14 05:50:16,182 INFO L226 Difference]: Without dead ends: 226 [2022-07-14 05:50:16,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-14 05:50:16,182 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 255 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:16,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 246 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:16,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-07-14 05:50:16,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 170. [2022-07-14 05:50:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 135 states have (on average 1.548148148148148) internal successors, (209), 169 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2022-07-14 05:50:16,186 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 209 transitions. Word has length 25 [2022-07-14 05:50:16,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:16,187 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 209 transitions. [2022-07-14 05:50:16,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) 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-14 05:50:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 209 transitions. [2022-07-14 05:50:16,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 05:50:16,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:16,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:16,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 05:50:16,187 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:16,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:16,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1586624732, now seen corresponding path program 1 times [2022-07-14 05:50:16,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:16,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479712279] [2022-07-14 05:50:16,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:16,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:16,240 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-14 05:50:16,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:16,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479712279] [2022-07-14 05:50:16,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479712279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:16,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:16,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:16,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513583815] [2022-07-14 05:50:16,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:16,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:50:16,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:16,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:50:16,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:50:16,244 INFO L87 Difference]: Start difference. First operand 170 states and 209 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:16,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:16,305 INFO L93 Difference]: Finished difference Result 210 states and 242 transitions. [2022-07-14 05:50:16,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:50:16,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-14 05:50:16,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:16,307 INFO L225 Difference]: With dead ends: 210 [2022-07-14 05:50:16,307 INFO L226 Difference]: Without dead ends: 210 [2022-07-14 05:50:16,307 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-14 05:50:16,308 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 188 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:16,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 217 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:16,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-14 05:50:16,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 168. [2022-07-14 05:50:16,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 134 states have (on average 1.5298507462686568) internal successors, (205), 167 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:16,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 205 transitions. [2022-07-14 05:50:16,317 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 205 transitions. Word has length 26 [2022-07-14 05:50:16,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:16,318 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 205 transitions. [2022-07-14 05:50:16,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:16,318 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 205 transitions. [2022-07-14 05:50:16,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 05:50:16,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:16,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:16,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 05:50:16,323 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:16,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:16,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1044883735, now seen corresponding path program 1 times [2022-07-14 05:50:16,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:16,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601627009] [2022-07-14 05:50:16,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:16,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:16,636 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-14 05:50:16,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:16,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601627009] [2022-07-14 05:50:16,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601627009] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:16,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:16,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-14 05:50:16,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343511262] [2022-07-14 05:50:16,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:16,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 05:50:16,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:16,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 05:50:16,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-07-14 05:50:16,638 INFO L87 Difference]: Start difference. First operand 168 states and 205 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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-14 05:50:17,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:17,323 INFO L93 Difference]: Finished difference Result 198 states and 231 transitions. [2022-07-14 05:50:17,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-14 05:50:17,324 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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-14 05:50:17,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:17,324 INFO L225 Difference]: With dead ends: 198 [2022-07-14 05:50:17,324 INFO L226 Difference]: Without dead ends: 198 [2022-07-14 05:50:17,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=240, Invalid=950, Unknown=0, NotChecked=0, Total=1190 [2022-07-14 05:50:17,325 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 192 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:17,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 688 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 05:50:17,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-14 05:50:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 174. [2022-07-14 05:50:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 141 states have (on average 1.4822695035460993) internal successors, (209), 173 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 209 transitions. [2022-07-14 05:50:17,328 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 209 transitions. Word has length 29 [2022-07-14 05:50:17,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:17,328 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 209 transitions. [2022-07-14 05:50:17,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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-14 05:50:17,328 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 209 transitions. [2022-07-14 05:50:17,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-14 05:50:17,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:17,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:17,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 05:50:17,329 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:17,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:17,329 INFO L85 PathProgramCache]: Analyzing trace with hash 981328753, now seen corresponding path program 1 times [2022-07-14 05:50:17,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:17,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963631080] [2022-07-14 05:50:17,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:17,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:17,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:17,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963631080] [2022-07-14 05:50:17,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963631080] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:17,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:17,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:17,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907865483] [2022-07-14 05:50:17,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:17,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:17,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:17,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:17,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:17,361 INFO L87 Difference]: Start difference. First operand 174 states and 209 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:17,375 INFO L93 Difference]: Finished difference Result 172 states and 207 transitions. [2022-07-14 05:50:17,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:17,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-14 05:50:17,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:17,376 INFO L225 Difference]: With dead ends: 172 [2022-07-14 05:50:17,376 INFO L226 Difference]: Without dead ends: 172 [2022-07-14 05:50:17,376 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-14 05:50:17,377 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:17,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 174 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:17,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-14 05:50:17,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-07-14 05:50:17,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 140 states have (on average 1.4785714285714286) internal successors, (207), 171 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 207 transitions. [2022-07-14 05:50:17,380 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 207 transitions. Word has length 31 [2022-07-14 05:50:17,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:17,380 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 207 transitions. [2022-07-14 05:50:17,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,380 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 207 transitions. [2022-07-14 05:50:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-14 05:50:17,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:17,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:17,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 05:50:17,381 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:17,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:17,382 INFO L85 PathProgramCache]: Analyzing trace with hash 873646240, now seen corresponding path program 1 times [2022-07-14 05:50:17,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:17,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88493572] [2022-07-14 05:50:17,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:17,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:17,437 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-14 05:50:17,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:17,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88493572] [2022-07-14 05:50:17,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88493572] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:17,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:17,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:17,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798107481] [2022-07-14 05:50:17,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:17,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:50:17,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:17,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:50:17,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:50:17,440 INFO L87 Difference]: Start difference. First operand 172 states and 207 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:17,516 INFO L93 Difference]: Finished difference Result 209 states and 238 transitions. [2022-07-14 05:50:17,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:50:17,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-14 05:50:17,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:17,518 INFO L225 Difference]: With dead ends: 209 [2022-07-14 05:50:17,519 INFO L226 Difference]: Without dead ends: 209 [2022-07-14 05:50:17,519 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-14 05:50:17,519 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 169 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:17,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 216 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-14 05:50:17,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 174. [2022-07-14 05:50:17,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 142 states have (on average 1.471830985915493) internal successors, (209), 173 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 209 transitions. [2022-07-14 05:50:17,523 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 209 transitions. Word has length 35 [2022-07-14 05:50:17,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:17,524 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 209 transitions. [2022-07-14 05:50:17,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,524 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 209 transitions. [2022-07-14 05:50:17,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 05:50:17,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:17,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:17,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 05:50:17,526 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:17,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:17,526 INFO L85 PathProgramCache]: Analyzing trace with hash 124937643, now seen corresponding path program 1 times [2022-07-14 05:50:17,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:17,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258321545] [2022-07-14 05:50:17,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:17,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:17,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:17,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258321545] [2022-07-14 05:50:17,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258321545] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:17,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891966825] [2022-07-14 05:50:17,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:17,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:17,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:17,902 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-14 05:50:17,902 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-14 05:50:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:18,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-14 05:50:18,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:18,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:18,085 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:18,086 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-14 05:50:18,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-14 05:50:18,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 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 05:50:18,148 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 14 treesize of output 16 [2022-07-14 05:50:18,175 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 05:50:18,175 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 05:50:18,217 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 19 treesize of output 18 [2022-07-14 05:50:18,422 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-14 05:50:18,422 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 47 treesize of output 49 [2022-07-14 05:50:18,435 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 12 treesize of output 8 [2022-07-14 05:50:18,519 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-14 05:50:18,519 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 56 treesize of output 56 [2022-07-14 05:50:18,571 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-14 05:50:18,572 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 56 treesize of output 56 [2022-07-14 05:50:18,641 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-07-14 05:50:18,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-07-14 05:50:18,684 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 32 treesize of output 30 [2022-07-14 05:50:18,721 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 32 treesize of output 30 [2022-07-14 05:50:18,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:18,786 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 05:50:18,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:18,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:18,974 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_32| Int) (v_ArrVal_804 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_48| Int) (v_ArrVal_802 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_32|) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_48| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_802) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_804) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) 1))) is different from false [2022-07-14 05:50:19,006 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_801 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_32| Int) (v_ArrVal_804 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_48| Int) (v_ArrVal_802 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_802) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_801) |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_804) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) 1) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_32|) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_48| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-07-14 05:50:19,061 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_801 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_32| Int) (v_ArrVal_804 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_48| Int) (v_ArrVal_802 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_802) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_801) |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_804) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) 1) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_32|) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_48| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-07-14 05:50:19,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_801 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_32| Int) (v_ArrVal_804 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_48| Int) (v_ArrVal_802 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_32|) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_48| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_802) (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_801) |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_804) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) 1))) is different from false [2022-07-14 05:50:19,180 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_796 Int) (v_ArrVal_801 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_32| Int) (v_ArrVal_804 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_48| Int) (v_ArrVal_802 Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_6| Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_6| v_ArrVal_796))) (or (not (= 0 (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_32|))) (= (select (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_802) (select (select (store (store (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|) |ULTIMATE.start_main_~bcki~0#1.offset| |v_ULTIMATE.start_main_#t~malloc4#1.base_6|)) |v_ULTIMATE.start_main_#t~malloc4#1.base_6| v_ArrVal_801) |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_804) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) 1) (not (= (select .cse0 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_48| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_6|) 0))))) is different from false [2022-07-14 05:50:19,198 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:19,198 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 27 treesize of output 31 [2022-07-14 05:50:19,219 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_796 Int) (v_ArrVal_801 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_32| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_48| Int) (v_ArrVal_802 Int)) (let ((.cse1 (select v_arrayElimArr_1 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse0 (store |c_#valid| .cse1 v_ArrVal_796))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_32|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) (= (select (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_802) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_1) .cse1 v_ArrVal_801) |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_804) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) 1) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_48| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| .cse1) 0)) (not (= (select .cse0 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)))))) is different from false [2022-07-14 05:50:19,302 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_796 Int) (v_ArrVal_801 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_32| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_48| Int) (v_ArrVal_802 Int)) (let ((.cse1 (select v_arrayElimArr_1 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse0 (store |c_#valid| .cse1 v_ArrVal_796))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_32|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) (= (select (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_802) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_1) .cse1 v_ArrVal_801) |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_804) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) 1) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_48| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse0 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (= (select |c_#valid| .cse1) 0)))))) is different from false [2022-07-14 05:50:19,328 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_796 Int) (v_ArrVal_801 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_32| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_48| Int) (v_ArrVal_802 Int)) (let ((.cse2 (select v_arrayElimArr_1 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse0 (store |c_#valid| .cse2 v_ArrVal_796)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_32|) 0)) (not (= (select .cse0 .cse1) 1)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_48| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| .cse2) 0)) (= (select (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_802) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_1) .cse2 v_ArrVal_801) |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_804) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) 1))))) is different from false [2022-07-14 05:50:19,369 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:19,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-07-14 05:50:19,375 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:19,376 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:19,383 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:19,383 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 50 treesize of output 50 [2022-07-14 05:50:19,395 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:19,396 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 68 treesize of output 64 [2022-07-14 05:50:19,498 INFO L356 Elim1Store]: treesize reduction 27, result has 77.7 percent of original size [2022-07-14 05:50:19,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 283 [2022-07-14 05:50:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:20,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891966825] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:20,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:20,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 42 [2022-07-14 05:50:20,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68694543] [2022-07-14 05:50:20,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:20,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-14 05:50:20,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:20,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-14 05:50:20,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1030, Unknown=11, NotChecked=584, Total=1806 [2022-07-14 05:50:20,536 INFO L87 Difference]: Start difference. First operand 174 states and 209 transitions. Second operand has 43 states, 42 states have (on average 2.357142857142857) internal successors, (99), 43 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:21,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:21,572 INFO L93 Difference]: Finished difference Result 279 states and 314 transitions. [2022-07-14 05:50:21,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-14 05:50:21,572 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.357142857142857) internal successors, (99), 43 states have internal predecessors, (99), 0 states have call successors, (0), 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 37 [2022-07-14 05:50:21,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:21,573 INFO L225 Difference]: With dead ends: 279 [2022-07-14 05:50:21,573 INFO L226 Difference]: Without dead ends: 279 [2022-07-14 05:50:21,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 60 SyntacticMatches, 9 SemanticMatches, 61 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=496, Invalid=2495, Unknown=11, NotChecked=904, Total=3906 [2022-07-14 05:50:21,575 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 974 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 3218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2100 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:21,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 1251 Invalid, 3218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 986 Invalid, 0 Unknown, 2100 Unchecked, 0.4s Time] [2022-07-14 05:50:21,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-14 05:50:21,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 192. [2022-07-14 05:50:21,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 160 states have (on average 1.44375) internal successors, (231), 191 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:21,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 231 transitions. [2022-07-14 05:50:21,578 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 231 transitions. Word has length 37 [2022-07-14 05:50:21,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:21,578 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 231 transitions. [2022-07-14 05:50:21,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.357142857142857) internal successors, (99), 43 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:21,578 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 231 transitions. [2022-07-14 05:50:21,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 05:50:21,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:21,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:21,611 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-14 05:50:21,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-14 05:50:21,787 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:21,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:21,788 INFO L85 PathProgramCache]: Analyzing trace with hash 124937644, now seen corresponding path program 1 times [2022-07-14 05:50:21,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:21,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220843729] [2022-07-14 05:50:21,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:21,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:22,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:22,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220843729] [2022-07-14 05:50:22,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220843729] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:22,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886402065] [2022-07-14 05:50:22,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:22,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:22,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:22,297 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-14 05:50:22,298 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-14 05:50:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:22,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-14 05:50:22,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:22,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:22,434 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-14 05:50:22,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:22,456 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-14 05:50:22,466 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:22,466 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-14 05:50:22,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:22,490 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-14 05:50:22,495 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-14 05:50:22,522 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 16 treesize of output 8 [2022-07-14 05:50:22,578 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-14 05:50:22,587 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-14 05:50:22,602 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 05:50:22,602 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 05:50:22,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:50:22,663 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-14 05:50:22,704 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 25 treesize of output 13 [2022-07-14 05:50:22,784 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-14 05:50:22,792 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-14 05:50:22,806 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-14 05:50:22,871 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 05:50:22,872 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-14 05:50:22,900 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-14 05:50:22,914 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-14 05:50:23,021 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:23,021 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 1 case distinctions, treesize of input 35 treesize of output 23 [2022-07-14 05:50:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:23,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:23,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886402065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:23,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 05:50:23,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [17] total 34 [2022-07-14 05:50:23,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416772828] [2022-07-14 05:50:23,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:23,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 05:50:23,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:23,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 05:50:23,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2022-07-14 05:50:23,072 INFO L87 Difference]: Start difference. First operand 192 states and 231 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:23,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:23,669 INFO L93 Difference]: Finished difference Result 204 states and 243 transitions. [2022-07-14 05:50:23,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 05:50:23,670 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-07-14 05:50:23,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:23,670 INFO L225 Difference]: With dead ends: 204 [2022-07-14 05:50:23,670 INFO L226 Difference]: Without dead ends: 203 [2022-07-14 05:50:23,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=255, Invalid=1907, Unknown=0, NotChecked=0, Total=2162 [2022-07-14 05:50:23,671 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 61 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:23,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 764 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 618 Invalid, 0 Unknown, 103 Unchecked, 0.3s Time] [2022-07-14 05:50:23,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-14 05:50:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2022-07-14 05:50:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 168 states have (on average 1.4226190476190477) internal successors, (239), 199 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:23,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 239 transitions. [2022-07-14 05:50:23,674 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 239 transitions. Word has length 37 [2022-07-14 05:50:23,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:23,674 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 239 transitions. [2022-07-14 05:50:23,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:23,675 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 239 transitions. [2022-07-14 05:50:23,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 05:50:23,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:23,675 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:23,693 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-14 05:50:23,886 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,SelfDestructingSolverStorable15 [2022-07-14 05:50:23,887 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:23,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:23,887 INFO L85 PathProgramCache]: Analyzing trace with hash -706370693, now seen corresponding path program 1 times [2022-07-14 05:50:23,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:23,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110149841] [2022-07-14 05:50:23,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:23,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:24,125 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-14 05:50:24,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:24,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110149841] [2022-07-14 05:50:24,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110149841] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:24,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049408900] [2022-07-14 05:50:24,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:24,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:24,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:24,127 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-14 05:50:24,129 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-14 05:50:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:24,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-14 05:50:24,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:24,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:24,265 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:24,265 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-14 05:50:24,271 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-14 05:50:24,306 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 14 treesize of output 16 [2022-07-14 05:50:24,320 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 14 treesize of output 16 [2022-07-14 05:50:24,330 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:24,331 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-14 05:50:24,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 05:50:24,415 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-14 05:50:24,415 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 47 treesize of output 49 [2022-07-14 05:50:24,420 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 12 treesize of output 8 [2022-07-14 05:50:24,470 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-14 05:50:24,470 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 56 treesize of output 56 [2022-07-14 05:50:24,505 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-14 05:50:24,505 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 56 treesize of output 56 [2022-07-14 05:50:24,518 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 16 treesize of output 12 [2022-07-14 05:50:24,564 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 05:50:24,564 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 31 treesize of output 32 [2022-07-14 05:50:24,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:24,697 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:24,697 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 25 treesize of output 16 [2022-07-14 05:50:24,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 05:50:24,711 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-14 05:50:24,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:25,165 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:25,165 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 47 treesize of output 51 [2022-07-14 05:50:25,366 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:25,367 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 17 treesize of output 21 [2022-07-14 05:50:25,374 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:25,374 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-14 05:50:29,705 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:29,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-14 05:50:29,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:29,719 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:29,720 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 33 treesize of output 33 [2022-07-14 05:50:29,731 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:29,731 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 29 treesize of output 33 [2022-07-14 05:50:29,748 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:29,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-14 05:50:29,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:29,755 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:29,755 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 30 treesize of output 30 [2022-07-14 05:50:29,762 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:29,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 18 treesize of output 22 [2022-07-14 05:50:29,786 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:29,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2022-07-14 05:50:31,916 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-14 05:50:31,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049408900] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:31,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:31,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 17] total 36 [2022-07-14 05:50:31,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188942228] [2022-07-14 05:50:31,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:31,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-14 05:50:31,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:31,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-14 05:50:31,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1169, Unknown=24, NotChecked=0, Total=1332 [2022-07-14 05:50:31,919 INFO L87 Difference]: Start difference. First operand 200 states and 239 transitions. Second operand has 37 states, 36 states have (on average 2.388888888888889) internal successors, (86), 37 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:32,564 INFO L93 Difference]: Finished difference Result 214 states and 253 transitions. [2022-07-14 05:50:32,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-14 05:50:32,564 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.388888888888889) internal successors, (86), 37 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-14 05:50:32,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:32,565 INFO L225 Difference]: With dead ends: 214 [2022-07-14 05:50:32,565 INFO L226 Difference]: Without dead ends: 214 [2022-07-14 05:50:32,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=326, Invalid=2100, Unknown=24, NotChecked=0, Total=2450 [2022-07-14 05:50:32,566 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 176 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 840 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:32,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1184 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 750 Invalid, 0 Unknown, 840 Unchecked, 0.3s Time] [2022-07-14 05:50:32,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-14 05:50:32,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 210. [2022-07-14 05:50:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 178 states have (on average 1.4101123595505618) internal successors, (251), 209 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 251 transitions. [2022-07-14 05:50:32,570 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 251 transitions. Word has length 38 [2022-07-14 05:50:32,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:32,570 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 251 transitions. [2022-07-14 05:50:32,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.388888888888889) internal successors, (86), 37 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 251 transitions. [2022-07-14 05:50:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 05:50:32,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:32,571 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:32,590 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-14 05:50:32,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:32,787 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:32,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:32,788 INFO L85 PathProgramCache]: Analyzing trace with hash -706370692, now seen corresponding path program 1 times [2022-07-14 05:50:32,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:32,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167805412] [2022-07-14 05:50:32,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:32,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:33,118 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-14 05:50:33,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:33,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167805412] [2022-07-14 05:50:33,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167805412] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:33,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688533611] [2022-07-14 05:50:33,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:33,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:33,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:33,124 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-14 05:50:33,125 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-14 05:50:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:33,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-14 05:50:33,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:33,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:33,271 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 05:50:33,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 05:50:33,301 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-14 05:50:33,306 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-14 05:50:33,410 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:33,411 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 31 treesize of output 29 [2022-07-14 05:50:33,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:33,419 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 14 treesize of output 16 [2022-07-14 05:50:33,460 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:33,461 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 31 treesize of output 29 [2022-07-14 05:50:33,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:33,473 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 14 treesize of output 16 [2022-07-14 05:50:33,490 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:33,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 05:50:33,510 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-14 05:50:33,510 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-14 05:50:33,570 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-14 05:50:33,570 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 35 treesize of output 26 [2022-07-14 05:50:33,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:33,583 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 14 treesize of output 16 [2022-07-14 05:50:33,735 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 05:50:33,735 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 65 treesize of output 55 [2022-07-14 05:50:33,751 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:33,752 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 14 treesize of output 20 [2022-07-14 05:50:33,755 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 5 treesize of output 3 [2022-07-14 05:50:33,804 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 05:50:33,804 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 65 treesize of output 55 [2022-07-14 05:50:33,821 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:33,821 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 14 treesize of output 20 [2022-07-14 05:50:33,826 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 5 treesize of output 3 [2022-07-14 05:50:33,870 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 05:50:33,870 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 63 [2022-07-14 05:50:33,873 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 22 treesize of output 24 [2022-07-14 05:50:34,044 INFO L356 Elim1Store]: treesize reduction 54, result has 28.0 percent of original size [2022-07-14 05:50:34,044 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 61 treesize of output 52 [2022-07-14 05:50:34,092 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 05:50:34,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-07-14 05:50:34,363 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:34,366 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 05:50:34,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 26 [2022-07-14 05:50:34,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:34,370 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 05:50:34,424 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-14 05:50:34,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:34,646 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (or (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1273) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|))) (and (<= 0 (+ .cse0 4)) (<= (+ .cse0 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|))))) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_59| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_59|)))) is different from false [2022-07-14 05:50:35,060 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:35,060 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 33 treesize of output 37 [2022-07-14 05:50:35,205 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:35,205 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 106 treesize of output 110 [2022-07-14 05:50:35,220 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:35,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 70 [2022-07-14 05:50:35,282 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 26 treesize of output 22 [2022-07-14 05:50:35,293 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 26 treesize of output 22 [2022-07-14 05:50:35,310 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 26 treesize of output 22 [2022-07-14 05:50:35,321 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 26 treesize of output 22 [2022-07-14 05:50:35,338 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 26 treesize of output 22 [2022-07-14 05:50:35,347 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 26 treesize of output 22 [2022-07-14 05:50:35,385 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 26 treesize of output 22 [2022-07-14 05:50:35,395 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 26 treesize of output 22 [2022-07-14 05:50:35,409 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 26 treesize of output 22 [2022-07-14 05:50:35,419 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 26 treesize of output 22 [2022-07-14 05:50:35,435 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 26 treesize of output 22 [2022-07-14 05:50:35,445 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 26 treesize of output 22 [2022-07-14 05:50:35,483 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 26 treesize of output 22 [2022-07-14 05:50:35,501 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 26 treesize of output 22 [2022-07-14 05:50:35,519 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_arrayElimArr_8 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_59| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_59|)) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (and (forall ((v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1267) (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1273) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_prenex_3) (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|) v_prenex_4) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) 4))) (forall ((v_ArrVal_1274 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_8) (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) |c_ULTIMATE.start_main_~bcki~0#1.base|)) (forall ((v_ArrVal_1274 (Array Int Int))) (not (let ((.cse0 (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_8) .cse0 v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) .cse0))))) (not (= 0 (select |c_#valid| (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|)))))) is different from false [2022-07-14 05:50:35,532 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 26 treesize of output 22 [2022-07-14 05:50:35,537 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 26 treesize of output 22 [2022-07-14 05:50:35,554 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 26 treesize of output 22 [2022-07-14 05:50:35,558 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 26 treesize of output 22 [2022-07-14 05:50:35,570 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 26 treesize of output 22 [2022-07-14 05:50:35,575 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 26 treesize of output 22 [2022-07-14 05:50:35,624 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 26 treesize of output 22 [2022-07-14 05:50:35,632 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 26 treesize of output 22 [2022-07-14 05:50:35,659 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_arrayElimArr_8 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_59| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_59|)) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (not (= 0 (select |c_#valid| (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (and (forall ((v_ArrVal_1274 (Array Int Int))) (not (let ((.cse0 (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_8) .cse0 v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|))))) (forall ((v_ArrVal_1274 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem3#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_8) (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|))) (forall ((v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_ArrVal_1267) (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1273) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_prenex_3) (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|) v_prenex_4) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) 4)))))) is different from false [2022-07-14 05:50:35,667 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 30 treesize of output 26 [2022-07-14 05:50:35,672 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 30 treesize of output 26 [2022-07-14 05:50:35,688 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 30 treesize of output 26 [2022-07-14 05:50:35,693 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 30 treesize of output 26 [2022-07-14 05:50:35,712 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 30 treesize of output 26 [2022-07-14 05:50:35,723 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 30 treesize of output 26 [2022-07-14 05:50:35,771 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 30 treesize of output 26 [2022-07-14 05:50:35,779 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 30 treesize of output 26 [2022-07-14 05:50:35,796 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_arrayElimArr_8 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_59| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (and (forall ((v_ArrVal_1274 (Array Int Int))) (not (let ((.cse0 (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_arrayElimArr_8) .cse0 v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) .cse0)))) (forall ((v_ArrVal_1274 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_8) (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) .cse1))) (forall ((v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_1267) (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1273) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_prenex_3) (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|) v_prenex_4) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) 4)))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_59|)) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (not (= 0 (select |c_#valid| (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|)))))) is different from false [2022-07-14 05:50:35,804 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 30 treesize of output 26 [2022-07-14 05:50:35,809 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 30 treesize of output 26 [2022-07-14 05:50:35,826 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 30 treesize of output 26 [2022-07-14 05:50:35,831 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 30 treesize of output 26 [2022-07-14 05:50:35,848 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 30 treesize of output 26 [2022-07-14 05:50:35,861 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 30 treesize of output 26 [2022-07-14 05:50:35,908 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 30 treesize of output 26 [2022-07-14 05:50:35,916 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 30 treesize of output 26 [2022-07-14 05:50:35,941 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:35,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-14 05:50:35,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:35,947 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:35,947 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 34 treesize of output 34 [2022-07-14 05:50:35,950 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 9 [2022-07-14 05:50:35,966 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:35,966 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 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-14 05:50:35,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:35,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:35,970 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-14 05:50:35,975 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:35,975 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 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-14 05:50:35,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:35,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:35,978 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-14 05:50:35,984 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 05:50:35,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2022-07-14 05:50:35,987 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 33 treesize of output 29 [2022-07-14 05:50:36,190 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-14 05:50:36,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688533611] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:36,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:36,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 45 [2022-07-14 05:50:36,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707964448] [2022-07-14 05:50:36,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:36,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-14 05:50:36,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:36,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-14 05:50:36,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1528, Unknown=18, NotChecked=332, Total=2070 [2022-07-14 05:50:36,193 INFO L87 Difference]: Start difference. First operand 210 states and 251 transitions. Second operand has 46 states, 45 states have (on average 2.466666666666667) internal successors, (111), 46 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:37,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:37,195 INFO L93 Difference]: Finished difference Result 261 states and 296 transitions. [2022-07-14 05:50:37,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-14 05:50:37,196 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.466666666666667) internal successors, (111), 46 states have internal predecessors, (111), 0 states have call successors, (0), 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 38 [2022-07-14 05:50:37,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:37,197 INFO L225 Difference]: With dead ends: 261 [2022-07-14 05:50:37,197 INFO L226 Difference]: Without dead ends: 261 [2022-07-14 05:50:37,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=420, Invalid=2882, Unknown=20, NotChecked=460, Total=3782 [2022-07-14 05:50:37,198 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 244 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1153 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:37,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1332 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 703 Invalid, 0 Unknown, 1153 Unchecked, 0.3s Time] [2022-07-14 05:50:37,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-14 05:50:37,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 233. [2022-07-14 05:50:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 204 states have (on average 1.411764705882353) internal successors, (288), 232 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:37,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 288 transitions. [2022-07-14 05:50:37,201 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 288 transitions. Word has length 38 [2022-07-14 05:50:37,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:37,201 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 288 transitions. [2022-07-14 05:50:37,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.466666666666667) internal successors, (111), 46 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 288 transitions. [2022-07-14 05:50:37,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 05:50:37,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:37,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:37,221 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-14 05:50:37,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-14 05:50:37,402 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:37,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:37,403 INFO L85 PathProgramCache]: Analyzing trace with hash 448725100, now seen corresponding path program 1 times [2022-07-14 05:50:37,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:37,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41656026] [2022-07-14 05:50:37,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:37,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:37,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:37,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:37,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41656026] [2022-07-14 05:50:37,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41656026] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:37,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983078580] [2022-07-14 05:50:37,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:37,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:37,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:37,746 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-14 05:50:37,746 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-14 05:50:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:37,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-14 05:50:37,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:37,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:37,885 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 05:50:37,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 05:50:37,908 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-14 05:50:37,912 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-14 05:50:38,010 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:38,011 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 14 treesize of output 20 [2022-07-14 05:50:38,016 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 5 treesize of output 3 [2022-07-14 05:50:38,034 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:38,034 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 31 treesize of output 29 [2022-07-14 05:50:38,089 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 05:50:38,093 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 5 treesize of output 3 [2022-07-14 05:50:38,106 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:38,106 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 31 treesize of output 29 [2022-07-14 05:50:38,141 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-07-14 05:50:38,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-07-14 05:50:38,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 16 [2022-07-14 05:50:38,204 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-14 05:50:38,204 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 44 treesize of output 31 [2022-07-14 05:50:38,215 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 14 treesize of output 16 [2022-07-14 05:50:38,381 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 05:50:38,381 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 87 treesize of output 69 [2022-07-14 05:50:38,403 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:38,403 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 14 treesize of output 20 [2022-07-14 05:50:38,407 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 5 treesize of output 3 [2022-07-14 05:50:38,454 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 05:50:38,455 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 87 treesize of output 69 [2022-07-14 05:50:38,473 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:38,474 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 14 treesize of output 20 [2022-07-14 05:50:38,477 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 5 treesize of output 3 [2022-07-14 05:50:38,534 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 05:50:38,534 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 77 [2022-07-14 05:50:38,538 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 22 treesize of output 24 [2022-07-14 05:50:38,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:38,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 20 [2022-07-14 05:50:38,645 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-14 05:50:38,645 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-14 05:50:38,701 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 14 treesize of output 16 [2022-07-14 05:50:38,710 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 05:50:38,711 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 74 treesize of output 62 [2022-07-14 05:50:38,793 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 05:50:38,793 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 74 treesize of output 62 [2022-07-14 05:50:38,797 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 14 treesize of output 16 [2022-07-14 05:50:38,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:38,958 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 05:50:38,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 26 [2022-07-14 05:50:38,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:38,962 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 05:50:38,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:38,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:39,124 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_65| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|))) (and (<= (+ 12 .cse0) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|))) (<= 0 (+ 8 .cse0)))))) is different from false [2022-07-14 05:50:39,500 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_65| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (and (forall ((v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1448 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1446) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1452) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) 12) (select (store |c_#length| |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1448) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1447) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)))) (forall ((v_ArrVal_1452 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1446) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1452) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) 8)))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_41|) 0)))) is different from false [2022-07-14 05:50:40,407 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:40,407 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 42 treesize of output 46 [2022-07-14 05:50:40,712 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:40,712 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 502 treesize of output 488 [2022-07-14 05:50:40,750 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:40,751 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 102 treesize of output 99 [2022-07-14 05:50:40,910 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 51 treesize of output 43 [2022-07-14 05:50:40,919 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 49 treesize of output 41 [2022-07-14 05:50:41,033 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 51 treesize of output 43 [2022-07-14 05:50:41,042 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 49 treesize of output 41 [2022-07-14 05:50:41,063 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 51 treesize of output 43 [2022-07-14 05:50:41,088 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 49 treesize of output 41 [2022-07-14 05:50:41,254 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 51 treesize of output 43 [2022-07-14 05:50:41,264 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 49 treesize of output 41 [2022-07-14 05:50:41,357 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 51 treesize of output 43 [2022-07-14 05:50:41,366 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 49 treesize of output 41 [2022-07-14 05:50:41,388 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 51 treesize of output 43 [2022-07-14 05:50:41,404 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 49 treesize of output 41 [2022-07-14 05:50:41,454 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 49 treesize of output 41 [2022-07-14 05:50:41,466 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 51 treesize of output 43 [2022-07-14 05:50:41,519 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int)) (let ((.cse1 (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse2 (store |c_#valid| .cse1 1))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_65| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)) (and (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_14) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1447) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) |c_ULTIMATE.start_main_~bcki~0#1.base|)) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (not (let ((.cse0 (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= .cse0 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_14) .cse0 v_ArrVal_1447) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|))))) (forall ((v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_26 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_prenex_25) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_prenex_24) |v_ULTIMATE.start_main_~item~0#1.base_41| v_prenex_26) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) 8))) (forall ((v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1441) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1446) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1452) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_14) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1447) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) |v_ULTIMATE.start_main_~item~0#1.base_41|)))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (not (= (select |c_#valid| .cse1) 0)) (not (= 0 (select .cse2 |v_ULTIMATE.start_main_~item~0#1.base_41|))) (not (= (select .cse2 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)))))) is different from false [2022-07-14 05:50:41,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-14 05:50:41,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 49 treesize of output 41 [2022-07-14 05:50:41,728 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 51 treesize of output 43 [2022-07-14 05:50:41,743 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 49 treesize of output 41 [2022-07-14 05:50:41,776 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 51 treesize of output 43 [2022-07-14 05:50:41,785 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 49 treesize of output 41 [2022-07-14 05:50:41,849 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 51 treesize of output 43 [2022-07-14 05:50:41,873 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 49 treesize of output 41 [2022-07-14 05:50:41,913 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int)) (let ((.cse0 (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse1 (store |c_#valid| .cse0 1))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_65| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (not (= (select |c_#valid| .cse0) 0)) (not (= (select .cse1 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (= 0 (select .cse1 |v_ULTIMATE.start_main_~item~0#1.base_41|))) (and (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_14) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1447) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) |v_ULTIMATE.start_main_~item~0#1.base_41|))) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem3#1.base| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_14) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1447) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|))) (forall ((v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_ArrVal_1441) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1446) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1452) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_26 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_prenex_25) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_prenex_24) |v_ULTIMATE.start_main_~item~0#1.base_41| v_prenex_26) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) 8))) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (not (let ((.cse2 (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= .cse2 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_14) .cse2 v_ArrVal_1447) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)))))))))) is different from false [2022-07-14 05:50:42,035 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 59 treesize of output 51 [2022-07-14 05:50:42,056 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 57 treesize of output 49 [2022-07-14 05:50:42,156 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 59 treesize of output 51 [2022-07-14 05:50:42,179 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 57 treesize of output 49 [2022-07-14 05:50:42,223 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 57 treesize of output 49 [2022-07-14 05:50:42,232 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 59 treesize of output 51 [2022-07-14 05:50:42,285 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 59 treesize of output 51 [2022-07-14 05:50:42,302 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 57 treesize of output 49 [2022-07-14 05:50:42,365 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int)) (let ((.cse2 (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse3 (store |c_#valid| .cse2 1))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_65| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)) (and (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (not (let ((.cse0 (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= .cse0 (select (select (store (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_arrayElimArr_14) .cse0 v_ArrVal_1447) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|))))) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_14) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1447) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) .cse1))) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_arrayElimArr_14) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1447) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) |v_ULTIMATE.start_main_~item~0#1.base_41|))) (forall ((v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_1441) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1446) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1452) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_26 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_prenex_25) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_prenex_24) |v_ULTIMATE.start_main_~item~0#1.base_41| v_prenex_26) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|))))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (not (= (select |c_#valid| .cse2) 0)) (not (= (select .cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 1)) (not (= 0 (select .cse3 |v_ULTIMATE.start_main_~item~0#1.base_41|))))))) is different from false [2022-07-14 05:50:42,483 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 59 treesize of output 51 [2022-07-14 05:50:42,508 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 57 treesize of output 49 [2022-07-14 05:50:42,595 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 59 treesize of output 51 [2022-07-14 05:50:42,619 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 57 treesize of output 49 [2022-07-14 05:50:42,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-07-14 05:50:42,673 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 59 treesize of output 51 [2022-07-14 05:50:42,726 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 59 treesize of output 51 [2022-07-14 05:50:42,738 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 57 treesize of output 49 [2022-07-14 05:50:42,794 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-14 05:50:42,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:42,797 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:42,802 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:42,802 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 33 treesize of output 33 [2022-07-14 05:50:42,816 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:42,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-14 05:50:42,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:42,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:42,825 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:42,825 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 30 treesize of output 30 [2022-07-14 05:50:42,843 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 9 treesize of output 7 [2022-07-14 05:50:42,859 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 05:50:42,859 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 1 case distinctions, treesize of input 26 treesize of output 1 [2022-07-14 05:50:42,879 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:42,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 05:50:42,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:42,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:42,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:42,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:42,900 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-14 05:50:42,908 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:42,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 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-14 05:50:42,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:42,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:42,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:42,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:42,914 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-14 05:50:42,925 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:42,925 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 68 treesize of output 66 [2022-07-14 05:50:45,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:45,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983078580] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:45,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:45,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 20] total 49 [2022-07-14 05:50:45,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897268133] [2022-07-14 05:50:45,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:45,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-14 05:50:45,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:45,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-14 05:50:45,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1741, Unknown=23, NotChecked=450, Total=2450 [2022-07-14 05:50:45,226 INFO L87 Difference]: Start difference. First operand 233 states and 288 transitions. Second operand has 50 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 50 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:46,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:46,413 INFO L93 Difference]: Finished difference Result 305 states and 349 transitions. [2022-07-14 05:50:46,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-14 05:50:46,414 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 50 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-14 05:50:46,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:46,415 INFO L225 Difference]: With dead ends: 305 [2022-07-14 05:50:46,415 INFO L226 Difference]: Without dead ends: 305 [2022-07-14 05:50:46,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 63 ConstructedPredicates, 5 IntricatePredicates, 2 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=455, Invalid=3080, Unknown=25, NotChecked=600, Total=4160 [2022-07-14 05:50:46,416 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 258 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 3012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2255 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:46,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 1750 Invalid, 3012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 726 Invalid, 0 Unknown, 2255 Unchecked, 0.4s Time] [2022-07-14 05:50:46,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-07-14 05:50:46,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 247. [2022-07-14 05:50:46,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 218 states have (on average 1.3944954128440368) internal successors, (304), 246 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:46,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 304 transitions. [2022-07-14 05:50:46,419 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 304 transitions. Word has length 38 [2022-07-14 05:50:46,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:46,419 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 304 transitions. [2022-07-14 05:50:46,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 50 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:46,419 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 304 transitions. [2022-07-14 05:50:46,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 05:50:46,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:46,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:46,439 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-14 05:50:46,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:46,620 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:46,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:46,621 INFO L85 PathProgramCache]: Analyzing trace with hash -372876340, now seen corresponding path program 1 times [2022-07-14 05:50:46,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:46,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549289169] [2022-07-14 05:50:46,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:46,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:46,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:46,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:46,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549289169] [2022-07-14 05:50:46,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549289169] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:46,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657504492] [2022-07-14 05:50:46,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:46,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:46,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:46,974 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-14 05:50:46,974 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-14 05:50:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:47,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-14 05:50:47,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:47,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:47,121 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 05:50:47,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 05:50:47,153 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-14 05:50:47,158 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-14 05:50:47,262 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:47,262 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 14 treesize of output 20 [2022-07-14 05:50:47,265 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 5 treesize of output 3 [2022-07-14 05:50:47,277 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:47,277 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 31 treesize of output 29 [2022-07-14 05:50:47,325 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:47,325 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 14 treesize of output 20 [2022-07-14 05:50:47,338 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 5 treesize of output 3 [2022-07-14 05:50:47,349 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:47,349 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 31 treesize of output 29 [2022-07-14 05:50:47,378 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-07-14 05:50:47,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-07-14 05:50:47,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 16 [2022-07-14 05:50:47,441 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:47,441 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 14 treesize of output 20 [2022-07-14 05:50:47,447 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 5 treesize of output 3 [2022-07-14 05:50:47,465 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-14 05:50:47,466 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 44 treesize of output 31 [2022-07-14 05:50:47,660 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 05:50:47,660 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 87 treesize of output 69 [2022-07-14 05:50:47,679 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:47,679 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 14 treesize of output 20 [2022-07-14 05:50:47,689 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 5 treesize of output 3 [2022-07-14 05:50:47,735 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 05:50:47,735 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 87 treesize of output 69 [2022-07-14 05:50:47,753 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:47,754 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 14 treesize of output 20 [2022-07-14 05:50:47,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 5 treesize of output 3 [2022-07-14 05:50:47,810 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 05:50:47,810 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 77 [2022-07-14 05:50:47,820 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 22 treesize of output 24 [2022-07-14 05:50:47,909 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-14 05:50:47,910 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-14 05:50:47,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 20 [2022-07-14 05:50:47,965 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 05:50:47,965 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 74 treesize of output 62 [2022-07-14 05:50:47,977 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 14 treesize of output 16 [2022-07-14 05:50:48,037 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 05:50:48,037 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 74 treesize of output 62 [2022-07-14 05:50:48,040 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 14 treesize of output 16 [2022-07-14 05:50:48,177 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:48,179 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 05:50:48,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 26 [2022-07-14 05:50:48,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:48,183 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 05:50:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:48,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:48,328 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_71| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1625) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|))) (and (<= 0 (+ .cse0 8)) (<= (+ .cse0 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|))))))) is different from false [2022-07-14 05:50:48,641 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int) (|v_ULTIMATE.start_main_~item~0#1.base_44| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_44|) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_71| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (and (forall ((v_ArrVal_1625 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1620) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1625) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)))) (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1622 Int)) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1620) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1625) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)) (select (store |c_#length| |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1622) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1621) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|))))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)))) is different from false [2022-07-14 05:50:49,535 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:49,535 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 42 treesize of output 46 [2022-07-14 05:50:49,831 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:49,832 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 502 treesize of output 488 [2022-07-14 05:50:49,886 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:49,887 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 102 treesize of output 99 [2022-07-14 05:50:50,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 49 treesize of output 41 [2022-07-14 05:50:50,079 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 51 treesize of output 43 [2022-07-14 05:50:50,194 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 49 treesize of output 41 [2022-07-14 05:50:50,218 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 51 treesize of output 43 [2022-07-14 05:50:50,247 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 51 treesize of output 43 [2022-07-14 05:50:50,273 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 49 treesize of output 41 [2022-07-14 05:50:50,456 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 49 treesize of output 41 [2022-07-14 05:50:50,465 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 51 treesize of output 43 [2022-07-14 05:50:50,586 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 49 treesize of output 41 [2022-07-14 05:50:50,612 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 51 treesize of output 43 [2022-07-14 05:50:50,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-14 05:50:50,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 49 treesize of output 41 [2022-07-14 05:50:50,704 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 49 treesize of output 41 [2022-07-14 05:50:50,717 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 51 treesize of output 43 [2022-07-14 05:50:50,766 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int) (|v_ULTIMATE.start_main_~item~0#1.base_44| Int)) (let ((.cse2 (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse0 (store |c_#valid| .cse2 1))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_44|) 0)) (and (forall ((v_ArrVal_1614 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1620 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1614) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1620) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1625) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)))) (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (not (let ((.cse1 (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_21) .cse1 v_ArrVal_1621) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) .cse1)))) (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_21) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1621) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) |v_ULTIMATE.start_main_~item~0#1.base_44|))) (forall ((v_prenex_103 (Array Int Int)) (v_prenex_104 (Array Int Int)) (v_prenex_105 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_prenex_103) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_prenex_105) |v_ULTIMATE.start_main_~item~0#1.base_44| v_prenex_104) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_21) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1621) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) |c_ULTIMATE.start_main_~bcki~0#1.base|))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (not (= (select |c_#valid| .cse2) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_71| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)) (not (= (select .cse0 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)))))) is different from false [2022-07-14 05:50:50,868 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 51 treesize of output 43 [2022-07-14 05:50:50,904 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 49 treesize of output 41 [2022-07-14 05:50:51,007 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 51 treesize of output 43 [2022-07-14 05:50:51,032 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 49 treesize of output 41 [2022-07-14 05:50:51,075 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 51 treesize of output 43 [2022-07-14 05:50:51,095 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 49 treesize of output 41 [2022-07-14 05:50:51,135 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 51 treesize of output 43 [2022-07-14 05:50:51,180 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 49 treesize of output 41 [2022-07-14 05:50:51,208 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int) (|v_ULTIMATE.start_main_~item~0#1.base_44| Int)) (let ((.cse2 (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse0 (store |c_#valid| .cse2 1))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_44|) 0)) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (and (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_21) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1621) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) |c_ULTIMATE.start_main_#t~mem3#1.base|)) (forall ((v_ArrVal_1614 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1620 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_ArrVal_1614) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1620) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1625) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) 8))) (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_21) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1621) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) |v_ULTIMATE.start_main_~item~0#1.base_44|))) (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (not (let ((.cse1 (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_21) .cse1 v_ArrVal_1621) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) .cse1)))) (forall ((v_prenex_103 (Array Int Int)) (v_prenex_104 (Array Int Int)) (v_prenex_105 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_prenex_103) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_prenex_105) |v_ULTIMATE.start_main_~item~0#1.base_44| v_prenex_104) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) |ULTIMATE.start_main_~bcki~0#1.offset|))) (not (= (select |c_#valid| .cse2) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_71| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)) (not (= (select .cse0 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)))))) is different from false [2022-07-14 05:50:51,311 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 59 treesize of output 51 [2022-07-14 05:50:51,329 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 57 treesize of output 49 [2022-07-14 05:50:51,421 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 59 treesize of output 51 [2022-07-14 05:50:51,437 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 57 treesize of output 49 [2022-07-14 05:50:51,466 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 59 treesize of output 51 [2022-07-14 05:50:51,484 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 57 treesize of output 49 [2022-07-14 05:50:51,534 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 59 treesize of output 51 [2022-07-14 05:50:51,547 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 57 treesize of output 49 [2022-07-14 05:50:51,600 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int) (|v_ULTIMATE.start_main_~item~0#1.base_44| Int)) (let ((.cse1 (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse0 (store |c_#valid| .cse1 1))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_44|) 0)) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (not (= (select |c_#valid| .cse1) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_71| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 1)) (and (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_arrayElimArr_21) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1621) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) |v_ULTIMATE.start_main_~item~0#1.base_44|))) (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_21) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1621) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) .cse2))) (forall ((v_ArrVal_1614 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1620 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_1614) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1620) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1625) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) 8))) (forall ((v_prenex_103 (Array Int Int)) (v_prenex_104 (Array Int Int)) (v_prenex_105 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_prenex_103) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_prenex_105) |v_ULTIMATE.start_main_~item~0#1.base_44| v_prenex_104) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (not (let ((.cse3 (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= .cse3 (select (select (store (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_arrayElimArr_21) .cse3 v_ArrVal_1621) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)))))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)))))) is different from false [2022-07-14 05:50:51,728 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 59 treesize of output 51 [2022-07-14 05:50:51,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 57 treesize of output 49 [2022-07-14 05:50:51,848 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 59 treesize of output 51 [2022-07-14 05:50:51,865 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 57 treesize of output 49 [2022-07-14 05:50:51,902 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 59 treesize of output 51 [2022-07-14 05:50:51,919 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 57 treesize of output 49 [2022-07-14 05:50:51,976 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 59 treesize of output 51 [2022-07-14 05:50:51,988 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 57 treesize of output 49 [2022-07-14 05:50:52,049 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:52,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-14 05:50:52,059 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:52,059 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 1042 treesize of output 1014 [2022-07-14 05:50:52,069 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 1002 treesize of output 970 [2022-07-14 05:50:52,077 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 493 treesize of output 477 [2022-07-14 05:50:52,085 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 954 treesize of output 890 [2022-07-14 05:50:52,247 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:52,247 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 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 05:50:52,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:52,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:52,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:52,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-14 05:50:52,257 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:52,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-14 05:50:52,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:52,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:52,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:52,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-14 05:50:52,266 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 05:50:52,266 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 1 case distinctions, treesize of input 27 treesize of output 1 [2022-07-14 05:50:52,271 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 05:50:52,271 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 1 case distinctions, treesize of input 26 treesize of output 1 [2022-07-14 05:50:52,273 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 63 treesize of output 53 [2022-07-14 05:50:52,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:52,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657504492] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:52,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:52,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 20] total 49 [2022-07-14 05:50:52,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554332885] [2022-07-14 05:50:52,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:52,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-14 05:50:52,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:52,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-14 05:50:52,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1736, Unknown=23, NotChecked=450, Total=2450 [2022-07-14 05:50:52,950 INFO L87 Difference]: Start difference. First operand 247 states and 304 transitions. Second operand has 50 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 50 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:56,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:56,105 INFO L93 Difference]: Finished difference Result 309 states and 354 transitions. [2022-07-14 05:50:56,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-14 05:50:56,106 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 50 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-14 05:50:56,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:56,107 INFO L225 Difference]: With dead ends: 309 [2022-07-14 05:50:56,107 INFO L226 Difference]: Without dead ends: 309 [2022-07-14 05:50:56,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 5 IntricatePredicates, 2 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=434, Invalid=2979, Unknown=29, NotChecked=590, Total=4032 [2022-07-14 05:50:56,108 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 233 mSDsluCounter, 1894 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 2020 SdHoareTripleChecker+Invalid, 3469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2417 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:56,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 2020 Invalid, 3469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1019 Invalid, 0 Unknown, 2417 Unchecked, 0.5s Time] [2022-07-14 05:50:56,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-07-14 05:50:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 236. [2022-07-14 05:50:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 207 states have (on average 1.4057971014492754) internal successors, (291), 235 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:56,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 291 transitions. [2022-07-14 05:50:56,112 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 291 transitions. Word has length 38 [2022-07-14 05:50:56,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:56,112 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 291 transitions. [2022-07-14 05:50:56,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 50 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:56,112 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 291 transitions. [2022-07-14 05:50:56,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 05:50:56,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:56,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:56,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:56,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:56,327 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:56,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:56,328 INFO L85 PathProgramCache]: Analyzing trace with hash -422654064, now seen corresponding path program 1 times [2022-07-14 05:50:56,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:56,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504229329] [2022-07-14 05:50:56,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:56,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:56,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:56,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504229329] [2022-07-14 05:50:56,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504229329] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:56,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975325404] [2022-07-14 05:50:56,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:56,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:56,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:56,513 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-14 05:50:56,514 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-14 05:50:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:56,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-14 05:50:56,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:56,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:50:56,671 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:56,671 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-14 05:50:56,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:50:56,742 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:56,743 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 30 treesize of output 28 [2022-07-14 05:50:56,756 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:56,756 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 30 treesize of output 28 [2022-07-14 05:50:56,769 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:56,769 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-14 05:50:56,800 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-14 05:50:56,800 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 35 treesize of output 26 [2022-07-14 05:50:56,898 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-14 05:50:56,898 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 46 treesize of output 48 [2022-07-14 05:50:56,902 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 12 treesize of output 8 [2022-07-14 05:50:56,950 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-14 05:50:56,951 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 55 treesize of output 55 [2022-07-14 05:50:56,984 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-14 05:50:56,984 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 55 treesize of output 55 [2022-07-14 05:50:56,992 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 16 treesize of output 12 [2022-07-14 05:50:57,050 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 05:50:57,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-07-14 05:50:57,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:57,095 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:57,095 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 15 [2022-07-14 05:50:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:57,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:57,172 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_76| Int) (v_ArrVal_1770 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_76|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1770) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_76|) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_76| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-07-14 05:50:57,187 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_76| Int) (v_ArrVal_1770 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_76|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_76| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1770) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_76|) 0)))) is different from false [2022-07-14 05:50:57,193 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_76| Int) (v_ArrVal_1770 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_76|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_76| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1770) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_76|) 0)))) is different from false [2022-07-14 05:50:57,205 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_76| Int) (v_ArrVal_1770 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_76|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_76| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select (select (store (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|) |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1770) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_76|) 0)))) is different from false [2022-07-14 05:50:57,240 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:57,240 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 17 treesize of output 21 [2022-07-14 05:50:57,249 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_76| Int) (v_ArrVal_1770 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_27 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_76|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_27) .cse0 v_ArrVal_1770) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_76|) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_76| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| .cse0) 0))))) is different from false [2022-07-14 05:50:57,267 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_76| Int) (v_ArrVal_1770 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_27 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_76|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_76| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_27) .cse0 v_ArrVal_1770) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_76|) 0)) (not (= (select |c_#valid| .cse0) 0))))) is different from false [2022-07-14 05:50:57,278 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_76| Int) (v_ArrVal_1770 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_27 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_arrayElimArr_27) .cse0 v_ArrVal_1770) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_76|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_76|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_76| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| .cse0) 0))))) is different from false [2022-07-14 05:50:57,301 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:57,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-14 05:50:57,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:57,308 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:57,309 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 33 treesize of output 33 [2022-07-14 05:50:57,315 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:57,316 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 29 treesize of output 33 [2022-07-14 05:50:57,323 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 05:50:57,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 05:50:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:57,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975325404] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:57,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:57,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 38 [2022-07-14 05:50:57,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627911956] [2022-07-14 05:50:57,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:57,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-14 05:50:57,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:57,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-14 05:50:57,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=780, Unknown=8, NotChecked=448, Total=1406 [2022-07-14 05:50:57,429 INFO L87 Difference]: Start difference. First operand 236 states and 291 transitions. Second operand has 38 states, 38 states have (on average 2.5526315789473686) internal successors, (97), 38 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:59,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:59,289 INFO L93 Difference]: Finished difference Result 247 states and 291 transitions. [2022-07-14 05:50:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 05:50:59,289 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.5526315789473686) internal successors, (97), 38 states have internal predecessors, (97), 0 states have call successors, (0), 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 39 [2022-07-14 05:50:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:59,290 INFO L225 Difference]: With dead ends: 247 [2022-07-14 05:50:59,290 INFO L226 Difference]: Without dead ends: 247 [2022-07-14 05:50:59,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=317, Invalid=1509, Unknown=8, NotChecked=616, Total=2450 [2022-07-14 05:50:59,292 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 189 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1320 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:59,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1321 Invalid, 2036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 684 Invalid, 0 Unknown, 1320 Unchecked, 0.3s Time] [2022-07-14 05:50:59,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-14 05:50:59,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 236. [2022-07-14 05:50:59,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 207 states have (on average 1.4009661835748792) internal successors, (290), 235 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:59,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 290 transitions. [2022-07-14 05:50:59,296 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 290 transitions. Word has length 39 [2022-07-14 05:50:59,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:59,297 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 290 transitions. [2022-07-14 05:50:59,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.5526315789473686) internal successors, (97), 38 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:59,297 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 290 transitions. [2022-07-14 05:50:59,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 05:50:59,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:59,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:59,334 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-14 05:50:59,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:59,515 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:50:59,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:59,516 INFO L85 PathProgramCache]: Analyzing trace with hash -27982635, now seen corresponding path program 1 times [2022-07-14 05:50:59,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:59,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824122078] [2022-07-14 05:50:59,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:59,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:59,868 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-14 05:50:59,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:59,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824122078] [2022-07-14 05:50:59,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824122078] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:59,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:59,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-14 05:50:59,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103461821] [2022-07-14 05:50:59,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:59,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-14 05:50:59,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:59,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-14 05:50:59,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-07-14 05:50:59,869 INFO L87 Difference]: Start difference. First operand 236 states and 290 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:00,715 INFO L93 Difference]: Finished difference Result 287 states and 340 transitions. [2022-07-14 05:51:00,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-14 05:51:00,717 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-07-14 05:51:00,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:00,718 INFO L225 Difference]: With dead ends: 287 [2022-07-14 05:51:00,718 INFO L226 Difference]: Without dead ends: 287 [2022-07-14 05:51:00,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=979, Unknown=0, NotChecked=0, Total=1260 [2022-07-14 05:51:00,719 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 342 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:00,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 694 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 05:51:00,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-07-14 05:51:00,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 240. [2022-07-14 05:51:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 211 states have (on average 1.3933649289099526) internal successors, (294), 239 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:00,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 294 transitions. [2022-07-14 05:51:00,723 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 294 transitions. Word has length 41 [2022-07-14 05:51:00,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:00,723 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 294 transitions. [2022-07-14 05:51:00,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:51:00,723 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 294 transitions. [2022-07-14 05:51:00,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 05:51:00,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:00,724 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:00,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 05:51:00,724 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-14 05:51:00,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:00,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1534306045, now seen corresponding path program 1 times [2022-07-14 05:51:00,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:51:00,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907082103] [2022-07-14 05:51:00,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:00,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:51:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:01,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:01,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:51:01,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907082103] [2022-07-14 05:51:01,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907082103] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:01,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527189570] [2022-07-14 05:51:01,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:01,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:51:01,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:51:01,185 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-14 05:51:01,187 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-14 05:51:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:01,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 82 conjunts are in the unsatisfiable core [2022-07-14 05:51:01,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:01,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 05:51:01,351 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 05:51:01,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 05:51:01,377 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-14 05:51:01,382 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-14 05:51:01,466 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:51:01,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-07-14 05:51:01,477 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-14 05:51:01,491 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:01,492 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 31 treesize of output 29 [2022-07-14 05:51:01,526 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-14 05:51:01,527 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 28 treesize of output 23 [2022-07-14 05:51:01,539 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-14 05:51:01,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2022-07-14 05:51:01,592 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 05:51:01,592 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-14 05:51:01,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:01,627 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 28 treesize of output 30 [2022-07-14 05:51:01,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:01,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:01,637 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 28 treesize of output 30 [2022-07-14 05:51:01,736 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 05:51:01,736 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 68 treesize of output 54 [2022-07-14 05:51:01,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:01,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:01,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:01,744 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 25 treesize of output 30 [2022-07-14 05:51:01,768 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 05:51:01,768 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 68 treesize of output 54 [2022-07-14 05:51:01,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:01,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:01,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:01,773 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 25 treesize of output 30 [2022-07-14 05:51:01,795 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 05:51:01,795 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 62 [2022-07-14 05:51:01,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:01,798 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 33 treesize of output 38 [2022-07-14 05:51:01,923 INFO L356 Elim1Store]: treesize reduction 74, result has 30.2 percent of original size [2022-07-14 05:51:01,923 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 6 case distinctions, treesize of input 64 treesize of output 62 [2022-07-14 05:51:01,939 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 05:51:01,939 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 36 [2022-07-14 05:51:02,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:51:02,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:02,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:51:02,290 INFO L356 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2022-07-14 05:51:02,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 85 treesize of output 48 [2022-07-14 05:51:02,294 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:51:02,298 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 05:51:02,298 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-14 05:51:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:02,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:02,570 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_82| Int) (v_ArrVal_2014 (Array Int Int)) (v_ArrVal_2013 (Array Int Int))) (or (and (forall ((v_ArrVal_2016 Int)) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2014))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (select (select (store .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse1 (+ |v_ULTIMATE.start_main_~bcki~0#1.offset_82| 4) v_ArrVal_2016)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2013) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_82|)) (+ (select .cse1 |v_ULTIMATE.start_main_~bcki~0#1.offset_82|) 4)))) 0)) (forall ((v_ArrVal_2018 Int)) (= (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2013))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (select (store .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse3 (+ |v_ULTIMATE.start_main_~bcki~0#1.offset_82| 4) v_ArrVal_2018)) (select .cse3 |v_ULTIMATE.start_main_~bcki~0#1.offset_82|)))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2014) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_82|) 4)) 0))) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_82| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_82|)))) is different from false [2022-07-14 05:51:03,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:51:03,823 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:03,823 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 2 case distinctions, treesize of input 83 treesize of output 74 [2022-07-14 05:51:03,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:51:03,833 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:03,833 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 2 case distinctions, treesize of input 59 treesize of output 66 [2022-07-14 05:51:03,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:51:03,854 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:03,854 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 2 case distinctions, treesize of input 83 treesize of output 74 [2022-07-14 05:51:03,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:51:03,862 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:03,863 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 2 case distinctions, treesize of input 59 treesize of output 66 [2022-07-14 05:51:05,861 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:05,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 92 [2022-07-14 05:51:05,867 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:05,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 68 [2022-07-14 05:51:05,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:51:05,902 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:05,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1286 treesize of output 1222 [2022-07-14 05:51:05,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:51:05,921 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:05,922 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 1622 treesize of output 1498 [2022-07-14 05:51:05,943 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:05,943 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 1494 treesize of output 1436 [2022-07-14 05:51:05,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:51:06,004 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:06,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 1716 treesize of output 1580 [2022-07-14 05:51:06,042 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:06,042 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 1458 treesize of output 1406